| /external/eigen/test/ |
| lu.cpp | 22 Index rows, cols, cols2; local
33 cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE);
38 cols2 = cols = MatrixType::ColsAtCompileTime;
52 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
55 VERIFY((MatrixType::Zero(rows,cols).fullPivLu().image(MatrixType::Zero(rows,cols)).cols() == 1));
57 MatrixType m1(rows, cols), m3(rows, cols2);
58 CMatrixType m2(cols, cols2);
59 createRandomPIMatrixOfRank(rank, rows, cols, m1)
138 Index cols = rows; local
[all...] |
| product.h | 36 Index cols = m.cols(); local
40 MatrixType m1 = MatrixType::Random(rows, cols),
41 m2 = MatrixType::Random(rows, cols),
42 m3(rows, cols);
48 square2 = ColSquareMatrixType::Random(cols, cols),
49 res2 = ColSquareMatrixType::Random(cols, cols);
51 ColVectorType vc2 = ColVectorType::Random(cols), vcres(cols)
[all...] |
| array_replicate.cpp | 25 Index cols = m.cols(); local
27 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols);
38 x1.resize(rows*f1,cols*f2);
41 x1.block(i*rows,j*cols,rows,cols) = m1;
44 x2.resize(2*rows,3*cols);
|
| swap.cpp | 32 typename MatrixType::Index cols = m.cols(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
|
| /external/linux-tools-perf/util/ui/ |
| progress.c | 15 int cols; local
19 newtGetScreenSize(&cols, NULL);
20 cols -= 4;
21 newtCenteredWindow(cols, 1, title);
25 self->scale = newtScale(0, 0, cols, total);
|
| /external/eigen/Eigen/src/QR/ |
| ColPivHouseholderQR.h | 81 ColPivHouseholderQR(Index rows, Index cols)
82 : m_qr(rows, cols),
83 m_hCoeffs((std::min)(rows,cols)),
84 m_colsPermutation(cols),
85 m_colsTranspositions(cols),
86 m_temp(cols),
87 m_colSqNorms(cols),
92 : m_qr(matrix.rows(), matrix.cols()),
93 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
94 m_colsPermutation(matrix.cols()),
257 inline Index cols() const { return m_qr.cols(); } function in class:Eigen::ColPivHouseholderQR
362 Index cols = matrix.cols(); local
461 const int cols = dec().cols(), local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/graphics/filters/custom/ |
| CustomFilterMesh.h | 44 static PassRefPtr<CustomFilterMesh> create(GraphicsContext3D* context, unsigned cols, unsigned rows, const FloatRect& meshBox, CustomFilterMeshType meshType)
46 return adoptRef(new CustomFilterMesh(context, cols, rows, meshBox, meshType));
60 CustomFilterMesh(GraphicsContext3D*, unsigned cols, unsigned rows, const FloatRect& meshBox, CustomFilterMeshType);
|
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.h | 62 unsigned cols; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
97 if (t->stride != t->block.size * t->cols * t->tiles_x)
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| u_linear.h | 62 unsigned cols; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
97 if (t->stride != t->block.size * t->cols * t->tiles_x)
|
| /external/ceres-solver/internal/ceres/ |
| detect_structure.cc | 71 *e_block_size = bs.cols[e_block_id].size;
73 *e_block_size != bs.cols[e_block_id].size) {
76 << bs.cols[e_block_id].size;
83 *f_block_size = bs.cols[f_block_id].size;
87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) {
90 << bs.cols[row.cells[c].block_id].size;
|
| compressed_col_sparse_matrix_utils_test.cc | 92 int* cols) {
107 cols[offset] = col_pos + c;
135 int* cols = tsm.mutable_cols(); local
142 rows + offset, cols + offset);
199 cols.resize(5);
203 cols[0] = 0;
207 cols[1] = 1;
211 cols[2] = 2;
217 cols[3] = 4;
225 cols[4] = 7
228 vector<int> cols; member in class:ceres::internal::SolveUpperTriangularTest
[all...] |
| /external/eigen/bench/ |
| bench_reverse.cpp | 21 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
32 int c = internal::random<int>(0,cols-1);
50 std::cout << rows << " x " << cols << " \t"
|
| sparse_randomsetter.cpp | 48 int cols = sm1.cols(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
68 int cols = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1
[all...] |
| sparse_trisolver.cpp | 40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst)
42 dst.startFill(rows*cols*density);
43 for(int j = 0; j < cols; j++)
59 int cols = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
65 DenseVector b = DenseVector::Random(cols);
66 DenseVector x = DenseVector::Random(cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
[all...] |
| spmv.cpp | 28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
41 int cols = size; local
55 cols = atoi(argv[i]+1);
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, cols, sm);
96 DenseMatrix dm(rows,cols), (rows,cols) local
[all...] |
| basicbenchmark.h | 44 const int cols = mat.cols(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
|
| sparse_dense_product.cpp | 55 int cols = SIZE; local
58 EigenSparseMatrix sm1(rows,cols);
59 DenseVector v1(cols), v2(cols);
65 //fillMatrix(density, rows, cols, sm1);
66 fillMatrix2(7, rows, cols, sm1);
72 DenseMatrix m1(rows,cols);
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
119 //GmmDynSparse gmmT3(rows,cols);
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_qr.cpp | 19 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
41 b = SquareMatrixType::Random(cols,cols);
|
| eigen2_swap.cpp | 32 int cols = m.cols(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
|
| product.h | 37 int cols = m.cols(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 mzero = MatrixType::Zero(rows, cols);
50 square2 = ColSquareMatrixType::Random(cols, cols),
51 res2 = ColSquareMatrixType::Random(cols, cols);
[all...] |
| eigen2_basicstuff.cpp | 18 int cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
36 c = ei_random<int>(0, cols-1);
68 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
78 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)
80 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1)))
[all...] |
| eigen2_linearstructure.cpp | 22 int cols = m.cols(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols);
35 c = ei_random<int>(0, cols-1);
66 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
67 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
68 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| DenseStorage.h | 95 static inline DenseIndex cols(void) {return _Cols;} function in class:Eigen::DenseStorage
111 static inline DenseIndex cols(void) {return _Cols;} function in class:Eigen::DenseStorage
138 inline DenseStorage(DenseIndex, DenseIndex rows, DenseIndex cols) : m_rows(rows), m_cols(cols) {}
142 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
143 inline void conservativeResize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; }
144 inline void resize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; }
161 inline DenseIndex cols(void) const {return _Cols; function in class:Eigen::DenseStorage
180 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
204 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
242 inline DenseIndex cols(void) const {return m_cols;} function in class:Eigen::DenseStorage
278 static inline DenseIndex cols(void) {return _Cols;} function in class:Eigen::DenseStorage
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| Block.h | 43 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
63 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
95 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
116 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
120 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
|
| /external/eigen/Eigen/src/LU/ |
| FullPivLU.h | 79 FullPivLU(Index rows, Index cols);
313 return cols() - rank();
326 return rank() == cols();
351 return isInjective() && (m_lu.rows() == m_lu.cols());
364 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
366 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
372 inline Index cols() const { return m_lu.cols(); } function in class:Eigen::FullPivLU
392 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols)
393 : m_lu(rows, cols),
424 const Index cols = matrix.cols(); local
550 const Index cols = dec().matrixLU().cols(), dimker = cols - rank(); local
675 const Index rows = dec().rows(), cols = dec().cols(), local
[all...] |
