| /external/eigen/doc/snippets/ |
| Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
4 MatrixXf::Zero(3,cols-3),
6 MatrixXf::Identity(rows-3,cols-3);
|
| /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 | 30 int cols = cm->mi_cols; local
36 for (mi_col = 0; mi_col < cols; mi_col++) {
52 int cols = cm->mi_cols; local
64 for (mi_col = 0; mi_col < cols; mi_col++) {
78 for (mi_col = 0; mi_col < cols; mi_col++) {
|
| /art/tools/ahat/src/main/com/android/ahat/ |
| SizeTable.java | 45 List<Column> cols = new ArrayList<Column>(); local
46 cols.add(left);
47 cols.add(new Column("Java Size", Column.Align.RIGHT));
48 cols.add(new Column("?", Column.Align.RIGHT, showDiff));
49 cols.add(new Column("Registered Native Size", Column.Align.RIGHT));
50 cols.add(new Column("?", Column.Align.RIGHT, showDiff));
51 cols.add(new Column("Total Size", Column.Align.RIGHT));
52 cols.add(new Column("?", Column.Align.RIGHT, showDiff));
53 cols.addAll(Arrays.asList(columns));
54 doc.table(cols.toArray(new Column[cols.size()]))
[all...] |
| /external/eigen/bench/ |
| basicbenchmark.h | 44 const int cols = mat.cols(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
|
| sparse_transpose.cpp | 39 int cols = 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 | 20 Index cols = m.cols(); 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) );
|
| upperbidiagonalization.cpp | 16 const typename MatrixType::Index cols = m.cols(); local
21 MatrixType a = MatrixType::Random(rows,cols);
23 RealMatrixType b(rows, cols);
25 b.block(0,0,cols,cols) = ubd.bidiagonal();
|
| zerosized.cpp | 36 VERIFY(t1.cols() == 0);
43 VERIFY(t2.cols() == 0);
53 Index cols = MatrixType::ColsAtCompileTime==Dynamic ? internal::random<Index>(1,10) : Index(MatrixType::ColsAtCompileTime); local
54 MatrixType m(rows,cols);
55 zeroReduction(m.template block<0,MatrixType::ColsAtCompileTime>(0,0,0,cols));
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 | 19 Index cols = _m.cols(); local
23 MatrixType m(rows,cols,supers,subs);
25 DenseMatrixType dm1(rows,cols);
43 for (int i=0; i<cols; ++i)
48 Index d = (std::min)(rows,cols);
49 Index a = std::max<Index>(0,cols-d-supers);
52 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
54 if(b>0) dm1.block(d+subs,0,b,cols).setZero()
66 Index cols = internal::random<Index>(1,10); local
[all...] |
| conservative_resize.cpp | 41 const Index cols = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
51 const Index cols = 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) );
|
| constructor.cpp | 27 Index cols = m.cols(); local
29 MatrixType m0 = MatrixType::Random(rows,cols);
33 VERIFY_EVALUATION_COUNT( MatrixType m2(m0.block(0,0,rows,cols)) , 1);
|
| corners.cpp | 20 Index cols = m.cols(); local
23 Index c = internal::random<Index>(1,cols);
25 MatrixType matrix = MatrixType::Random(rows,cols);
26 const MatrixType const_matrix = MatrixType::Random(rows,cols);
29 COMPARE_CORNER(topRightCorner(r,c), block(0,cols-c,r,c));
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c));
35 Index sc = internal::random<Index>(1,cols) - 1;
36 Index nc = internal::random<Index>(1,cols-sc);
38 COMPARE_CORNER(topRows(r), block(0,0,r,cols));
53 cols = MatrixType::ColsAtCompileTime, 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"; local
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;
21 const int cols = (Cols==Dynamic) ? 3 : Cols; local
22 const int size = rows*cols;
23 DenseStorageType reference(size, rows, cols);
34 template <typename T, int Rows, int Cols>
41 const int cols = (Cols==Dynamic) ? 3 : Cols; local
[all...] |
| diagonal.cpp | 18 Index cols = m.cols(); local
20 MatrixType m1 = MatrixType::Random(rows, cols),
21 m2 = MatrixType::Random(rows, cols);
73 Index cols = m.cols(); local
75 MatrixType m1 = MatrixType::Random(rows, cols);
77 if (rows>=2 && cols>=2)
|
| dontalign.cpp | 28 Index cols = m.cols(); local
30 MatrixType a = MatrixType::Random(rows,cols);
|
| inplace_decomposition.cpp | 24 Index cols = MatrixType::ColsAtCompileTime==Dynamic ? (square?rows:internal::random<Index>(2,rows)) : Index(MatrixType::ColsAtCompileTime); local
26 MatrixType A = MatrixType::Random(rows,cols);
28 ResType x(cols);
33 A.topRows(cols) = A.topRows(cols).adjoint() * A.topRows(cols);
46 if(rows==cols)
57 if(rows==cols)
71 if(rows==cols)
|
| inverse.cpp | 22 Index cols = m.cols(); local
26 MatrixType m1(rows, cols),
27 m2(rows, cols),
65 MatrixType m3 = v3*v3.transpose(), m4(rows,cols);
|
| jacobi.cpp | 19 Index cols = m.cols(); local
28 const MatrixType a(MatrixType::Random(rows, cols));
48 Index p = internal::random<Index>(0, cols-1);
51 q = internal::random<Index>(0, cols-1);
|
| mapstaticmethods.cpp | 73 Index rows = m.rows(), cols = m.cols(); local
77 PlainObjectType::Map(ptr, rows, cols).setZero();
78 PlainObjectType::MapAligned(ptr, rows, cols).setZero();
79 PlainObjectType::Map(const_ptr, rows, cols).sum();
80 PlainObjectType::MapAligned(const_ptr, rows, cols).sum();
82 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero();
83 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero();
84 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum();
85 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStride<>(i)).sum()
[all...] |
| miscmatrices.cpp | 21 Index cols = m.cols(); 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);
|
| /external/libvpx/libvpx/vp9/encoder/ |
| vp9_alt_ref_aq.h | 44 int cols; member in struct:MATX_8U
|
| /external/tensorflow/tensorflow/core/kernels/ |
| eigen_activations_test.cc | 32 const ptrdiff_t cols = 48; local
34 Tensor<float, 4> input(depth, rows, cols, batch);
37 Tensor<float, 4> result(depth, rows, cols, batch);
41 for (int c = 0; c < cols; ++c) {
56 const ptrdiff_t cols = 48; local
58 Tensor<float, 4> input(depth, rows, cols, batch);
61 Tensor<float, 4> result(depth, rows, cols, batch);
65 for (int c = 0; c < cols; ++c) {
80 const ptrdiff_t cols = 48; local
82 Tensor<float, 4> input(depth, rows, cols, batch)
[all...] |
