| /external/eigen/doc/snippets/ |
| 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);
|
| /external/ImageMagick/Magick++/tests/ |
| exceptions.cpp | 57 size_t rows = 480; local
58 Geometry geometry(columns,rows);
|
| attributes.cpp | 27 size_t rows = 480; local
28 Geometry geometry(columns,rows);
276 if ( image.baseRows() != rows )
282 << ") != rows ("
283 << rows
1240 // rows
1242 if ( image.rows() != rows )
1246 << ", rows is canvas rows as expected" << endl
[all...] |
| /external/tensorflow/tensorflow/core/kernels/ |
| self_adjoint_eig_op.cc | 51 const int64 rows = inputs[0].rows(); variable
52 if (rows == 0) {
53 // If X is an empty matrix (0 rows, 0 col), X * X' == X.
66 outputs->at(0).bottomRows(rows) = es.eigenvectors();
|
| self_adjoint_eig_v2_op_impl.h | 57 const int64 rows = inputs[0].rows(); variable
58 if (rows == 0) {
59 // If X is an empty matrix (0 rows, 0 col), X * X' == X.
|
| eigen_activations_test.cc | 31 const ptrdiff_t rows = 32; local
34 Tensor<float, 4> input(depth, rows, cols, batch);
37 Tensor<float, 4> result(depth, rows, cols, batch);
42 for (int r = 0; r < rows; ++r) {
55 const ptrdiff_t rows = 32; local
58 Tensor<float, 4> input(depth, rows, cols, batch);
61 Tensor<float, 4> result(depth, rows, cols, batch);
66 for (int r = 0; r < rows; ++r) {
79 const ptrdiff_t rows = 32; local
82 Tensor<float, 4> input(depth, rows, cols, batch)
[all...] |
| /external/eigen/doc/ |
| tutorial.cpp | 27 int rows = 3, cols = 3; local
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_idct.h | 30 transform_1d cols, rows; // vertical and horizontal member in struct:__anon26177
37 highbd_transform_1d cols, rows; // vertical and horizontal member in struct:__anon26178
|
| vp9_debugmodes.c | 29 int rows = cm->mi_rows; local
34 for (mi_row = 0; mi_row < rows; mi_row++) {
51 int rows = cm->mi_rows; local
62 for (mi_row = 0; mi_row < rows; mi_row++) {
76 for (mi_row = 0; mi_row < rows; mi_row++) {
|
| vp9_thread_common.h | 35 int rows; member in struct:VP9LfSyncData
43 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, struct VP9Common *cm, int rows,
|
| /external/eigen/bench/ |
| basicbenchmark.h | 43 const int rows = mat.rows(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
|
| 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...] |
| /external/eigen/test/ |
| eigen2support.cpp | 19 Index rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
43 VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
44 VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
|
| upperbidiagonalization.cpp | 15 const typename MatrixType::Index rows = m.rows(); local
21 MatrixType a = MatrixType::Random(rows,cols);
23 RealMatrixType b(rows, cols);
|
| zerosized.cpp | 34 VERIFY(t1.rows() == 0);
42 VERIFY(t2.rows() == 0);
52 Index rows = MatrixType::RowsAtCompileTime==Dynamic ? internal::random<Index>(1,10) : Index(MatrixType::RowsAtCompileTime); local
54 MatrixType m(rows,cols);
56 zeroReduction(m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0));
59 Matrix<Scalar,Dynamic,Dynamic> prod = m.template block<MatrixType::RowsAtCompileTime,0>(0,0,rows,0) * m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols);
60 VERIFY(prod.rows()==rows && prod.cols()==cols);
|
| bandmatrix.cpp | 18 Index rows = _m.rows(); local
23 MatrixType m(rows,cols,supers,subs);
25 DenseMatrixType dm1(rows,cols);
48 Index d = (std::min)(rows,cols);
50 Index b = std::max<Index>(0,rows-d-subs);
51 if(a>0) dm1.block(0,d+supers,rows,a).setZero();
53 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
65 Index rows = internal::random<Index>(1,10) local
[all...] |
| conservative_resize.cpp | 40 const Index rows = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
50 const Index rows = internal::random<Index>(50,75); local
53 m.conservativeResizeLike(MatrixType::Zero(rows,cols));
54 VERIFY_IS_APPROX(m.block(0,0,n.rows(),n.cols()), n);
55 VERIFY( rows<=50 || m.block(50,0,rows-50,cols).sum() == Scalar(0) );
56 VERIFY( cols<=50 || m.block(0,50,rows,cols-50).sum() == Scalar(0) );
77 m.conservativeResize(m.rows(),1)
[all...] |
| constructor.cpp | 26 Index rows = m.rows(); local
29 MatrixType m0 = MatrixType::Random(rows,cols);
33 VERIFY_EVALUATION_COUNT( MatrixType m2(m0.block(0,0,rows,cols)) , 1);
|
| corners.cpp | 19 Index rows = m.rows(); local
22 Index r = internal::random<Index>(1,rows);
25 MatrixType matrix = MatrixType::Random(rows,cols);
26 const MatrixType const_matrix = MatrixType::Random(rows,cols);
30 COMPARE_CORNER(bottomLeftCorner(r,c), block(rows-r,0,r,c));
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c));
33 Index sr = internal::random<Index>(1,rows) - 1;
34 Index nr = internal::random<Index>(1,rows-sr);
40 COMPARE_CORNER(bottomRows(r), block(rows-r,0,r,cols))
52 rows = MatrixType::RowsAtCompileTime, enumerator in enum:__anon19835
[all...] |
| ctorleak.cpp | 42 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
43 Foo::object_limit = internal::random<Index>(0, rows*cols - 2);
49 std::cout << "\nMatrixX m(" << rows << ", " << cols << ");\n";
50 MatrixX m(rows, cols);
59 Foo::object_limit = (rows+1)*(cols+1);
60 MatrixX A(rows, cols);
61 VERIFY_IS_EQUAL(Foo::object_count, rows*cols);
63 VERIFY_IS_EQUAL(Foo::object_count, (rows+1)*cols);
65 VERIFY_IS_EQUAL(Foo::object_count, rows*(cols+1));
|
| dense_storage.cpp | 14 template <typename T, int Rows, int Cols>
17 static const int Size = ((Rows==Dynamic || Cols==Dynamic) ? Dynamic : Rows*Cols);
18 typedef DenseStorage<T,Size, Rows,Cols, 0> DenseStorageType;
20 const int rows = (Rows==Dynamic) ? 4 : Rows; local
22 const int size = rows*cols;
23 DenseStorageType reference(size, rows, cols);
34 template <typename T, int Rows, int Cols
40 const int rows = (Rows==Dynamic) ? 4 : Rows; local
[all...] |
| diagonal.cpp | 17 Index rows = m.rows(); local
20 MatrixType m1 = MatrixType::Random(rows, cols),
21 m2 = MatrixType::Random(rows, cols);
30 if (rows>2)
72 Index rows = m.rows(); local
75 MatrixType m1 = MatrixType::Random(rows, cols);
77 if (rows>=2 && cols>=2)
|
| /external/libmpeg2/decoder/ |
| impeg2d_globals.h | 29 UWORD32 rows; member in struct:__anon25309
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_alt_ref_aq.h | 43 int rows; member in struct:MATX_8U
|
| /external/ImageMagick/coders/ |
| psd-private.h | 31 rows, member in struct:_PSDInfo
|
