Searched defs:rows (Results 1 - 25 of 316) sorted by relevance

1234567891011>>

/external/eigen/doc/snippets/
H A DTutorial_commainit_02.cpp1 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/eigen/doc/examples/
H A Dclass_Block.cpp8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols) argument
10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols) argument
17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
/external/eigen/failtest/
H A Dmap_nonconst_ctor_on_const_ptr_2.cpp11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument
12 Map<MatrixXf> m(ptr, rows, cols);
H A Dmap_nonconst_ctor_on_const_ptr_3.cpp11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument
12 Map<MatrixXf, Aligned, InnerStride<2> > m(ptr, rows, cols, InnerStride<2>());
H A Dmap_nonconst_ctor_on_const_ptr_4.cpp11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){ argument
12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
/external/eigen/doc/
H A Dtutorial.cpp27 int rows = 3, cols = 3; local
/external/eigen/test/
H A Dconservative_resize.cpp40 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) );
H A Dupperbidiagonalization.cpp15 const typename MatrixType::Index rows = m.rows(); local
21 MatrixType a = MatrixType::Random(rows,cols);
23 RealMatrixType b(rows, cols);
H A Dbandmatrix.cpp19 Index rows = _m.rows(); local
24 MatrixType m(rows,cols,supers,subs);
26 DenseMatrixType dm1(rows,cols);
49 Index d = (std::min)(rows,cols);
51 Index b = std::max<Index>(0,rows-d-subs);
52 if(a>0) dm1.block(0,d+supers,rows,a).setZero();
54 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
68 Index rows local
[all...]
H A Dcorners.cpp19 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
52 rows = MatrixType::RowsAtCompileTime, enumerator in enum:__anon5691
[all...]
H A Ddiagonal.cpp20 Index rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols);
31 if (rows>2)
H A Ddontalign.cpp27 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);
/external/eigen/test/eigen2/
H A Deigen2_qr.cpp18 int rows = m.rows(); local
25 MatrixType a = MatrixType::Random(rows,cols);
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
H A Deigen2_inverse.cpp19 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
29 identity = MatrixType::Identity(rows, rows);
31 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8)
33 m1 = MatrixType::Random(rows, cols);
H A Deigen2_linearstructure.cpp21 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols);
34 int r = ei_random<int>(0, rows-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,col
[all...]
H A Deigen2_map.cpp42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test non-const-correctness support in eigen2
54 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
55 MatrixType ma1 = Map<MatrixType>(array1, rows, col
[all...]
H A Deigen2_miscmatrices.cpp21 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...]
H A Deigen2_newstdvector.cpp18 int rows = m.rows(); local
20 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
21 std::vector<MatrixType,Eigen::aligned_allocator<MatrixType> > v(10, MatrixType(rows,cols)), w(20, y);
H A Deigen2_qtvector.cpp23 int rows = m.rows(); local
25 MatrixType x = MatrixType::Random(rows,cols), y = MatrixType::Random(rows,cols);
26 QVector<MatrixType> v(10, MatrixType(rows,cols)), w(20, y);
/external/eigen/unsupported/test/
H A Dkronecker_product.cpp18 void check_dimension(const MatrixType& ab, const unsigned int rows, const unsigned int cols) argument
20 VERIFY_IS_EQUAL(ab.rows(), rows);
28 VERIFY_IS_EQUAL(ab.rows(), 6);
73 VERIFY_IS_EQUAL(ab.rows(), 12);
/external/chromium/chrome/browser/geolocation/
H A Dgeolocation_exceptions_table_model_unittest.cc65 GeolocationExceptionsTableModel::Rows rows; local
66 rows.insert(0U);
67 EXPECT_TRUE(model_->CanRemoveRows(rows));
76 EXPECT_FALSE(model_->CanRemoveRows(rows));
79 rows.clear();
80 rows.insert(1U);
81 rows.insert(2U);
82 EXPECT_TRUE(model_->CanRemoveRows(rows));
91 GeolocationExceptionsTableModel::Rows rows; local
92 rows
[all...]
/external/chromium/chrome/browser/notifications/
H A Dnotification_exceptions_table_model_unittest.cc109 RemoveRowsTableModel::Rows rows; local
110 rows.insert(0); // allowed.com
111 rows.insert(3); // e-allowed2.com
112 model_->RemoveRows(rows);
119 RemoveRowsTableModel::Rows rows; local
120 rows.insert(0);
121 rows.insert(1);
122 rows.insert(2);
123 model_->RemoveRows(rows);
/external/eigen/Eigen/src/Core/
H A DRandom.h31 * The parameters \a rows and \a cols are the number of rows and of columns of
35 * it is redundant to pass \a rows and \a cols as arguments, so Random() should be used
49 DenseBase<Derived>::Random(Index rows, Index cols) argument
51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>());
112 return *this = Random(rows(), cols());
134 * \param rows the new number of rows
144 PlainObjectBase<Derived>::setRandom(Index rows, Index cols) argument
146 resize(rows, col
[all...]
/external/eigen/bench/
H A Dbasicbenchmark.h43 const int rows = mat.rows(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
H A Dsparse_transpose.cpp38 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,col
[all...]

Completed in 673 milliseconds

1234567891011>>