| /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);
|
| Matrix_resize_int.cpp | 5 cout << "v: " << v.rows() << " rows, " << v.cols() << " cols" << endl;
6 cout << "w: " << w.rows() << " rows, " << w.cols() << " cols" << endl;
|
| 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;
|
| 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/test/ |
| 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);
25 VERIFY(y.rows() == 1 && y.cols() == rows);
27 y.resize(cols);
29 VERIFY(x.rows() == cols && x.cols() == 1);
|
| bandmatrix.cpp | 20 Index cols = _m.cols(); local
24 MatrixType m(rows,cols,supers,subs);
26 DenseMatrixType dm1(rows,cols);
44 for (int i=0; i<cols; ++i)
49 Index d = (std::min)(rows,cols);
50 Index a = std::max<Index>(0,cols-d-supers);
53 dm1.block(0,supers+1,cols-supers-1-a,cols-supers-1-a).template triangularView<Upper>().setZero();
55 if(b>0) dm1.block(d+subs,0,b,cols).setZero()
69 Index cols = internal::random<Index>(1,10); local
[all...] |
| array_reverse.cpp | 23 Index cols = m.cols(); local
27 MatrixType m1 = MatrixType::Random(rows, cols);
33 for ( int j = 0; j < cols; j++ ) {
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j));
41 for ( int j = 0; j < cols; j++ ) {
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j));
49 for ( int j = 0; j < cols; j++ ) {
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j));
57 for ( int j = 0; j < cols; j++ )
[all...] |
| 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:__anon19783
[all...] |
| /libcore/luni/src/test/java/tests/support/ |
| MockCallback.java | 24 public void columns(String cols[]) {
26 for (int i = 0; i <= cols.length; i++) {
27 System.out.println("<TD>" + cols[i] + "</TD>");
32 public boolean newrow(String cols[]) {
34 for (int i = 0; i <= cols.length; i++) {
35 System.out.println("<TD>" + cols[i] + "</TD>");
|
| /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/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 116 Matrix(unsigned rows, unsigned cols) :
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) :
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) {
124 std::fill(data, data + (rows * cols), initVal);
129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols])
[all...] |
| /external/eigen/doc/examples/ |
| class_Block.cpp | 8 topLeftCorner(MatrixBase<Derived>& m, int rows, int cols)
10 return Eigen::Block<Derived>(m.derived(), 0, 0, rows, cols);
15 topLeftCorner(const MatrixBase<Derived>& m, int rows, int cols)
17 return Eigen::Block<const Derived>(m.derived(), 0, 0, rows, cols);
|
| tut_matrix_resize_fixed_size.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
|
| /external/ceres-solver/internal/ceres/ |
| compressed_col_sparse_matrix_utils.h | 72 const IntegerType* cols,
76 rhs_and_solution[c] /= values[cols[c + 1] - 1];
77 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) {
93 const IntegerType* cols,
97 for (IntegerType idx = cols[c]; idx < cols[c + 1] - 1; ++idx) {
102 rhs_and_solution[c] = rhs_and_solution[c] / values[cols[c + 1] - 1];
119 const IntegerType* cols,
124 solution[rhs_nonzero_index] = 1.0 / values[cols[rhs_nonzero_index + 1] - 1]
[all...] |
| dense_sparse_matrix.cc | 69 const int *cols = m.cols(); local
73 m_(rows[i], cols[i]) += values[i];
112 m_.resize(m_.rows() + m_.cols(), m_.cols());
114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp;
118 m_.bottomLeftCorner(m_.cols(), m_.cols()) =
119 ConstVectorRef(d, m_.cols()).asDiagonal();
131 return m_.rows() - m_.cols();
[all...] |
| block_jacobi_preconditioner.cc | 49 for (int c = 0; c < block_structure_.cols.size(); ++c) {
50 int size = block_structure_.cols[c].size;
55 blocks_.resize(block_structure_.cols.size());
60 for (int c = 0; c < block_structure_.cols.size(); ++c) {
61 int size = block_structure_.cols[c].size;
80 const int col_block_size = bs->cols[cells[c].block_id].size;
103 for (int c = 0; c < bs->cols.size(); ++c) {
104 const int size = block_structure_.cols[c].size;
105 const int position = block_structure_.cols[c].position;
122 for (int c = 0; c < block_structure_.cols.size(); ++c)
[all...] |
| /external/eigen/Eigen/src/Eigen2Support/ |
| QR.h | 37 MatrixType ret = MatrixType::Identity(this->rows(), this->cols());
49 int cols = this->cols(); local
50 return MatrixRBlockType(this->matrixQR(), 0, 0, cols, cols).template triangularView<UpperTriangular>();
|
| /external/eigen/bench/ |
| 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/eigen2/ |
| eigen2_svd.cpp | 19 int cols = m.cols(); local
23 MatrixType a = MatrixType::Random(rows,cols);
26 Matrix<Scalar, MatrixType::ColsAtCompileTime, 1> x(cols,1), x2(cols,1);
34 MatrixType sigma = MatrixType::Zero(rows,cols);
36 sigma.block(0,0,cols,cols) = svd.singularValues().asDiagonal();
37 matU.block(0,0,rows,cols) = svd.matrixU();
42 if (rows==cols)
[all...] |
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 48 // rows, cols and values.
50 // rows is a num_rows + 1 sized array that points into the cols and
53 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the
59 // cols and values contain as many entries as there are non-zeros in
73 // cols = [ 1, 3, 1, 2, 3, 0, 1]
76 vector<int> cols; member in struct:ceres::CRSMatrix
|
| /external/chromium_org/third_party/skia/include/utils/ |
| SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) {
24 return this->init(NULL, NULL, texW, texH, rows, cols);
28 int texW, int texH, int rows, int cols);
45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
| /external/skia/include/utils/ |
| SkMeshUtils.h | 23 bool init(int texW, int texH, int rows, int cols) {
24 return this->init(NULL, NULL, texW, texH, rows, cols);
28 int texW, int texH, int rows, int cols);
45 static void Draw(SkCanvas*, const SkBitmap&, int rows, int cols,
|
