/external/eigen/doc/snippets/ |
H A D | 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/examples/ |
H A D | class_Block.cpp | 8 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 D | map_nonconst_ctor_on_const_ptr_2.cpp | 11 void foo(CV_QUALIFIER float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<MatrixXf> m(ptr, rows, cols);
|
H A D | map_nonconst_ctor_on_const_ptr_3.cpp | 11 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 D | map_nonconst_ctor_on_const_ptr_4.cpp | 11 void foo(const float *ptr, DenseIndex rows, DenseIndex cols){ argument 12 Map<CV_QUALIFIER MatrixXf, Unaligned, OuterStride<> > m(ptr, rows, cols, OuterStride<>(2));
|
/external/ceres-solver/include/ceres/ |
H A D | crs_matrix.h | 49 // rows, cols and values. 51 // rows is a num_rows + 1 sized array that points into the cols and 54 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the 60 // cols and values contain as many entries as there are non-zeros in 74 // cols = [ 1, 3, 1, 2, 3, 0, 1] 77 vector<int> cols; member in struct:ceres::CRSMatrix
|
/external/eigen/doc/ |
H A D | tutorial.cpp | 27 int rows = 3, cols = 3; local
|
/external/eigen/test/eigen2/ |
H A D | eigen2_qr.cpp | 19 int cols = m.cols(); local 25 MatrixType a = MatrixType::Random(rows,cols); 28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR()); 41 b = SquareMatrixType::Random(cols,cols);
|
/external/eigen/test/ |
H A D | product_trsolve.cpp | 30 template<typename Scalar,int Size, int Cols> void trsolve(int size=Size,int cols=Cols) argument 39 Matrix<Scalar,Size,Cols,colmajor> cmRhs(size,cols); 40 Matrix<Scalar,Size,Cols,rowmajor> rmRhs(size,cols); 41 Matrix<Scalar,Dynamic,Dynamic,colmajor> ref(size,cols); 71 int c = internal::random<int>(0,cols-1);
|
H A D | selfadjoint.cpp | 21 Index cols = m.cols(); local 23 MatrixType m1 = MatrixType::Random(rows, cols), 24 m3(rows, cols);
|
H A D | 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();
|
H A D | 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) 69 Index cols = internal::random<Index>(1,10); local [all...] |
H A D | 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) );
|
H A D | 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:__anon21033 [all...] |
H A D | diagonal.cpp | 18 Index cols = m.cols(); local 20 MatrixType m1 = MatrixType::Random(rows, cols), 21 m2 = MatrixType::Random(rows, cols);
|
H A D | dontalign.cpp | 28 Index cols = m.cols(); local 30 MatrixType a = MatrixType::Random(rows,cols);
|
/external/ceres-solver/internal/ceres/ |
H A D | 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_inde 70 SolveUpperTriangularInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 91 SolveUpperTriangularTransposeInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument [all...] |
H A D | incomplete_lq_factorization_test.cc | 52 EXPECT_EQ(expected.cols()[i], actual.cols()[i]); 85 int* cols = matrix.mutable_cols(); local 94 cols[idx] = j; 141 EXPECT_EQ(matrix.cols()[0], 0); 149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]); 159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0); 160 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 1], 3); 161 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 2], 5); 173 EXPECT_EQ(matrix.cols()[matri [all...] |
/external/chromium_org/third_party/angle/tests/compiler_tests/ |
H A D | VariablePacker_test.cpp | 151 int cols = gl::VariableColumnCount(type); local 152 int squareSize = std::max(rows, cols);
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/ |
H A D | debugmodes.c | 16 void vp8_print_modes_and_motion_vectors(MODE_INFO *mi, int rows, int cols, int frame) argument 30 for (mb_col = 0; mb_col < cols; mb_col++) 49 for (mb_col = 0; mb_col < cols; mb_col++) 69 for (mb_col = 0; mb_col < cols; mb_col++) 94 for (b_col = 0; b_col < 4 * cols; b_col++) 96 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2); 117 for (mb_col = 0; mb_col < cols; mb_col++) 142 for (b_col = 0; b_col < 4 * cols; b_col++) 144 mb_index = (b_row >> 2) * (cols + 1) + (b_col >> 2);
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_linear.h | 62 unsigned cols; member in struct:pipe_tile_info 94 if (t->tile.size != t->block.size * t->cols * t->rows) 97 if (t->stride != t->block.size * t->cols * t->tiles_x)
|
/external/eigen/Eigen/src/Eigen2Support/ |
H A D | 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/ |
H A D | basicbenchmark.h | 44 const int cols = mat.cols(); local 46 MatrixType I(rows,cols); 47 MatrixType m(rows,cols);
|
H A D | 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/blas/ |
H A D | GeneralRank1Update.h | 22 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 28 for (Index i=0; i<cols; ++i) 36 static void run(Index rows, Index cols, Scalar* mat, Index stride, const Scalar* u, const Scalar* v, Scalar alpha) argument 38 general_rank1_update<Scalar,Index,ColMajor,ConjRhs,ConjRhs>::run(rows,cols,mat,stride,u,v,alpha);
|