| /external/eigen/doc/snippets/ |
| Matrix_resize_NoChange_int.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
| Matrix_resize_int_NoChange.cpp | 3 cout << "m: " << m.rows() << " rows, " << m.cols() << " cols" << endl;
|
| Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
| Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
5 MatrixXf::Zero(rows-3,3),
6 MatrixXf::Identity(rows-3,cols-3);
|
| tut_matrix_assignment_resizing.cpp | 2 std::cout << "a is of size " << a.rows() << "x" << a.cols() << std::endl;
5 std::cout << "a is now of size " << a.rows() << "x" << a.cols() << std::endl;
|
| /external/eigen/failtest/ |
| map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<MatrixXf> m(ptr, rows, cols);
|
| map_nonconst_ctor_on_const_ptr_3.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
|
| map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){
12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
| /external/eigen/test/eigen2/ |
| eigen2_sparse_product.cpp | 14 const int rows = ref.rows(); local
19 double density = std::max(8./(rows*cols), 0.01);
25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows);
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows);
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows);
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows)
[all...] |
| eigen2_miscmatrices.cpp | 21 int rows = m.rows(); local
24 int r = ei_random<int>(0, rows-1), r2 = ei_random<int>(0, rows-1), c = ei_random<int>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
28 VectorType v1 = VectorType::Random(rows);
34 square = MatrixType::Zero(rows, rows);
35 square.diagonal() = VectorType::Ones(rows);
[all...] |
| eigen2_sparse_basic.cpp | 48 const int rows = ref.rows(); local
53 double density = std::max(8./(rows*cols), 0.01);
58 SparseMatrixType m(rows, cols);
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
60 DenseVector vec1 = DenseVector::Random(rows);
88 int i = ei_random<int>(0,rows-1);
90 int h = ei_random<int>(1,rows-i-1);
117 for(int r=0; r<rows; r++)
167 DenseMatrix m1(rows,cols)
[all...] |
| /external/chromium-trace/catapult/tracing/tracing/ui/analysis/ |
| counter_sample_sub_view_test.html | 43 var rows = analysisEl.$.table.tableRows;
44 assert.lengthOf(rows, 1);
45 assert.isTrue(rows[0].isExpanded);
46 assert.equal(rows[0].counter, 'ctr1');
47 assert.equal(rows[0].series, 'series1');
48 assert.equal(rows[0].start, 0);
49 assert.equal(rows[0].value, 0);
52 var subRows = rows[0].subRows;
73 var rows = analysisEl.$.table.tableRows;
74 assert.lengthOf(rows, 1)
[all...] |
| /external/eigen/test/ |
| miscmatrices.cpp | 20 Index rows = m.rows(); local
23 Index r = internal::random<Index>(0, rows-1), r2 = internal::random<Index>(0, rows-1), c = internal::random<Index>(0, cols-1);
24 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
25 MatrixType m1 = MatrixType::Ones(rows,cols);
27 VectorType v1 = VectorType::Random(rows);
33 square = MatrixType::Zero(rows, rows);
34 square.diagonal() = VectorType::Ones(rows);
[all...] |
| resize.cpp | 12 template<DenseIndex rows, DenseIndex cols>
15 MatrixXf A(rows, cols);
17 Matrix<double, rows, cols> C;
20 VERIFY(B.rows() == rows && B.cols() == cols);
22 VectorXf x(rows);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
29 VERIFY(x.rows() == cols && x.cols() == 1);
|
| sparse_basic.cpp | 19 const Index rows = ref.rows(); local
24 double density = (std::max)(8./(rows*cols), 0.01);
32 SparseMatrixType m(rows, cols);
33 DenseMatrix refMat = DenseMatrix::Zero(rows, cols);
34 DenseVector vec1 = DenseVector::Random(rows);
61 int i = internal::random<int>(0,rows-1);
63 int h = internal::random<int>(1,rows-i-1);
121 for(int r=0; r<rows; r++)
135 DenseMatrix m1(rows,cols)
[all...] |
| array_replicate.cpp | 23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
29 VectorType v1 = VectorType::Random(rows);
37 x1.resize(rows*f1,cols*f2);
40 x1.block(i*rows,j*cols,rows,cols) = m1;
43 x2.resize(2*rows,3*cols);
48 x2.resize(rows,f1)
[all...] |
| array_for_matrix.cpp | 19 Index rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols);
26 ColVectorType cv1 = ColVectorType::Random(rows);
34 VERIFY_IS_APPROX((m1.array() + s1).matrix(), MatrixType::Constant(rows,cols,s1) + m1);
35 VERIFY_IS_APPROX(((m1*Scalar(2)).array() - s2).matrix(), (m1+m1) - MatrixType::Constant(rows,cols,s2) );
62 VERIFY_IS_APPROX(m1.block(0,0,rows,0).rowwise().prod(), ColVectorType::Ones(rows));
80 Index rows = m.rows(); local
150 Index rows = m.rows(); local
193 Index rows = t.rows(), cols = t.cols(); local
[all...] |
| dontalign.cpp | 27 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 SquareMatrixType square = SquareMatrixType::Random(rows,rows);
32 VectorType v = VectorType::Random(rows);
43 Scalar* array = internal::aligned_new<Scalar>(rows);
44 v = VectorType::MapAligned(array, rows);
45 internal::aligned_delete(array, rows);
|
| spqr_support.cpp | 17 int rows = internal::random<int>(1,maxRows); local
18 int cols = internal::random<int>(1,rows);
19 double density = (std::max)(8./(rows*cols), 0.01);
21 A.resize(rows,rows);
22 dA.resize(rows,rows);
25 return rows;
38 int m = A.rows();
|
| /external/eigen/doc/examples/ |
| function_taking_eigenbase.cpp | 8 std::cout << "size (rows, cols): " << b.size() << " (" << b.rows()
|
| /external/skia/src/utils/ |
| SkMeshUtils.cpp | 21 int texW, int texH, int rows, int cols) {
22 if (rows < 2 || cols < 2) {
34 fTexCount = rows * cols;
35 rows -= 1;
37 fIndexCount = rows * cols * 6;
54 for (int x = 0; x < rows; x++) {
56 *idx++ = index + rows + 1;
60 *idx++ = index + rows + 1;
61 *idx++ = index + rows + 2;
72 const SkScalar dx = SkIntToScalar(texW) / rows;
[all...] |
| /external/deqp/framework/common/ |
| tcuMatrix.hpp | 34 template <typename T, int Rows, int Cols>
38 typedef Vector<T, Rows> Element;
44 ROWS = Rows,
50 explicit Matrix (const T src[Rows*Cols]);
51 Matrix (const Vector<T, Rows>& src);
52 Matrix (const Matrix<T, Rows, Cols>& src);
55 Matrix<T, Rows, Cols>& operator= (const Matrix<T, Rows, Cols>& src);
56 Matrix<T, Rows, Cols>& operator*= (const Matrix<T, Rows, Cols>& src)
[all...] |
| /external/opencv3/modules/cudev/include/opencv2/cudev/grid/ |
| split_merge.hpp | 68 const int rows = getRows(src); local
71 CV_Assert( getRows(mask) == rows && getCols(mask) == cols );
73 dst.create(rows, cols);
78 rows, cols, local
87 const int rows = getRows(src); local
90 CV_Assert( getRows(dst) == rows && getCols(dst) == cols );
91 CV_Assert( getRows(mask) == rows && getCols(mask) == cols );
96 rows, cols, local
105 const int rows = getRows(src); local
108 dst.create(rows, cols)
113 rows, cols, local
122 const int rows = getRows(src); local
130 rows, cols, local
139 const int rows = getRows(src); local
150 rows, cols, local
159 const int rows = getRows(src); local
170 rows, cols, local
179 const int rows = getRows(src); local
189 rows, cols, local
198 const int rows = getRows(src); local
216 const int rows = getRows(src); local
225 rows, cols, local
234 const int rows = getRows(src); local
243 rows, cols, local
252 const int rows = getRows(src); local
264 rows, cols, local
273 const int rows = getRows(src); local
285 rows, cols, local
294 const int rows = getRows(src); local
305 rows, cols, local
314 const int rows = getRows(src); local
333 const int rows = getRows(src); local
343 rows, cols, local
352 const int rows = getRows(src); local
362 rows, cols, local
371 const int rows = getRows(src); local
384 rows, cols, local
393 const int rows = getRows(src); local
406 rows, cols, local
415 const int rows = getRows(src); local
427 rows, cols, local
436 const int rows = getRows(src); local
456 const int rows = getRows(src); local
467 rows, cols, local
476 const int rows = getRows(src); local
487 rows, cols, local
[all...] |
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 169 Matrix(unsigned Rows, unsigned Cols) :
170 Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
175 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal)
176 : Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
177 std::fill(Data, Data + (Rows * Cols), InitVal);
182 : Rows(M.Rows), Cols(M.Cols), Data(new PBQPNum[Rows * Cols])
[all...] |
| /external/eigen/bench/ |
| sparse_transpose.cpp | 38 int rows = SIZE; local
42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols);
47 fillMatrix(density, rows, cols, sm1);
52 DenseMatrix m1(rows,cols), m3(rows,cols);
59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
81 GmmDynSparse gmmT3(rows,cols);
82 GmmSparse m1(rows,cols), m3(rows,cols)
[all...] |
