/external/eigen/unsupported/Eigen/src/SVD/ |
JacobiSVD.h | 79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols()) 82 ::new (&m_qr) QRType(svd.rows(), svd.cols()); 89 if(matrix.rows() > matrix.cols()) 92 svd.m_workMatrix = m_qr.matrixQR().block(0,0,matrix.cols(),matrix.cols()).template triangularView<Upper>(); 124 if (svd.cols() != m_qr.rows() || svd.rows() != m_qr.cols()) 127 ::new (&m_qr) QRType(svd.cols(), svd.rows()); 129 m_adjoint.resize(svd.cols(), svd.rows()) [all...] |
/external/ceres-solver/internal/ceres/ |
block_structure.h | 81 vector<Block> cols; member in struct:ceres::internal::CompressedRowBlockStructure 87 vector<CompressedColumn> cols; member in struct:ceres::internal::CompressedColumnBlockStructure
|
partitioned_matrix_view_impl.h | 55 num_col_blocks_f_ = bs->cols.size() - num_col_blocks_e_; 74 for (int c = 0; c < bs->cols.size(); ++c) { 75 const Block& block = bs->cols[c]; 110 const int col_block_pos = bs->cols[col_block_id].position; 111 const int col_block_size = bs->cols[col_block_id].size; 137 const int col_block_pos = bs->cols[col_block_id].position; 138 const int col_block_size = bs->cols[col_block_id].size; 152 const int col_block_pos = bs->cols[col_block_id].position; 153 const int col_block_size = bs->cols[col_block_id].size; 176 const int col_block_pos = bs->cols[col_block_id].position [all...] |
/external/chromium_org/third_party/skia/src/utils/ |
SkPatchGrid.h | 90 SkPatchGrid(int rows = 0, int cols = 0, VertexType flags = kNone_VertexType, 114 * Resets the grid of patches to contain rows and cols of patches. 116 void reset(int rows, int cols, VertexType flags, SkXfermode* xMode);
|
/external/eigen/Eigen/src/Core/ |
Select.h | 69 eigen_assert(m_condition.cols() == m_then.cols() && m_condition.cols() == m_else.cols()); 73 Index cols() const { return m_condition.cols(); } function in class:Eigen::Select 142 derived(), thenMatrix.derived(), ThenDerived::Constant(rows(),cols(),elseScalar)); 157 derived(), ElseDerived::Constant(rows(),cols(),thenScalar), elseMatrix.derived());
|
Random.h | 31 * 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) 51 return NullaryExpr(rows, cols, internal::scalar_random_op<Scalar>()); 112 return *this = Random(rows(), cols());
|
/external/eigen/Eigen/src/misc/ |
SparseSolve.h | 39 inline Index rows() const { return m_dec.cols(); } 40 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::sparse_solve_retval_base 55 int rhsCols = m_rhs.cols(); 80 using Base::cols; \ 109 inline Index rows() const { return m_dec.cols(); } 110 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_with_guess
|
Solve.h | 44 inline Index rows() const { return m_dec.cols(); } 45 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::solve_retval_base 70 using Base::cols; \
|
/external/eigen/test/eigen2/ |
eigen2_cholesky.cpp | 25 int cols = m.cols(); local 32 MatrixType a0 = MatrixType::Random(rows,cols); 34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols); 37 MatrixType a1 = MatrixType::Random(rows,cols); 93 SquareMatrixType symm = a0.block(0,0,rows,cols-4) * a0.block(0,0,rows,cols-4).adjoint();
|
eigen2_map.cpp | 42 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, cols); [all...] |
eigen2_triangular.cpp | 21 int cols = m.cols(); local 23 MatrixType m1 = MatrixType::Random(rows, cols), 24 m2 = MatrixType::Random(rows, cols), 25 m3(rows, cols), 26 m4(rows, cols), 27 r1(rows, cols), 28 r2(rows, cols), 29 mzero = MatrixType::Zero(rows, cols), 30 mones = MatrixType::Ones(rows, cols), [all...] |
eigen2_cwiseop.cpp | 29 int cols = m.cols(); local 31 MatrixType m1 = MatrixType::Random(rows, cols), 32 m2 = MatrixType::Random(rows, cols), 33 m3(rows, cols), 34 m4(rows, cols), 35 mzero = MatrixType::Zero(rows, cols), 36 mones = MatrixType::Ones(rows, cols), 47 c = ei_random<int>(0, cols-1); 52 m3 = MatrixType::Constant(rows, cols, s1) [all...] |
/external/eigen/test/ |
eigensolver_complex.cpp | 23 VERIFY(vec1.cols() == 1); 24 VERIFY(vec2.cols() == 1); 40 Index cols = m.cols(); local 45 MatrixType a = MatrixType::Random(rows,cols); 75 MatrixType z = MatrixType::Zero(rows,cols); 79 MatrixType id = MatrixType::Identity(rows, cols); 97 MatrixType a = MatrixType::Random(m.rows(),m.cols());
|
basicstuff.cpp | 22 Index cols = m.cols(); local 26 MatrixType m1 = MatrixType::Random(rows, cols), 27 m2 = MatrixType::Random(rows, cols), 28 m3(rows, cols), 29 mzero = MatrixType::Zero(rows, cols), 39 c = internal::random<Index>(0, cols-1); 70 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1)); 81 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic) 83 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols-1))) 139 Index cols = m.cols(); local [all...] |
mapped_matrix.cpp | 52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local 62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols); 63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols); 64 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols); 65 MatrixType ma1 = Map<MatrixType>(array1, rows, cols); [all...] |
block.cpp | 44 Index cols = m.cols(); local 46 MatrixType m1 = MatrixType::Random(rows, cols), 48 m2 = MatrixType::Random(rows, cols), 49 m3(rows, cols), 50 ones = MatrixType::Ones(rows, cols); 57 Index c1 = internal::random<Index>(0,cols-1); 58 Index c2 = internal::random<Index>(c1,cols-1); 81 RowVectorType br1(m1.block(r1,0,1,cols)); 94 if (rows>=5 && cols>=8 184 Index cols = m.cols(); local 218 Index cols = m.cols(); local [all...] |
cwiseop.cpp | 73 Index cols = m.cols(); local 75 MatrixType m1 = MatrixType::Random(rows, cols), 77 m2 = MatrixType::Random(rows, cols), 78 m3(rows, cols), 79 m4(rows, cols), 80 mzero = MatrixType::Zero(rows, cols), 81 mones = MatrixType::Ones(rows, cols), 89 c = internal::random<Index>(0, cols-1); 94 m3 = MatrixType::Constant(rows, cols, s1) [all...] |
/development/ndk/platforms/android-L/include/linux/ |
virtio_console.h | 30 __u16 cols; member in struct:virtio_console_config
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/common/ |
vp9_debugmodes.c | 32 int cols = cm->mi_cols; local 39 for (mi_col = 0; mi_col < cols; mi_col++) { 58 int cols = cm->mi_cols; local 70 for (mi_col = 0; mi_col < cols; mi_col++) {
|
/external/eigen/Eigen/src/Geometry/ |
Homogeneous.h | 76 inline Index cols() const { return m_matrix.cols() + (int(Direction)==Horizontal ? 1 : 0); } function in class:Eigen::Homogeneous 81 || (int(Direction)==Horizontal && col==m_matrix.cols())) 180 Direction==Horizontal ? _expression().cols()-1 : _expression().cols()).cwiseQuotient( 186 Direction==Horizontal ? _expression().cols()-1:0, 188 Direction==Horizontal ? 1 : _expression().cols()), 190 Direction==Horizontal ? _expression().cols()-1 : 1)); 247 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_left_product_impl 286 inline Index cols() const { return m_rhs.cols(); } function in struct:Eigen::internal::homogeneous_right_product_impl [all...] |
/external/libvpx/libvpx/vp9/common/ |
vp9_debugmodes.c | 32 int cols = cm->mi_cols; local 39 for (mi_col = 0; mi_col < cols; mi_col++) { 57 int cols = cm->mi_cols; local 69 for (mi_col = 0; mi_col < cols; mi_col++) {
|
/external/chromium_org/third_party/libvpx/source/libvpx/test/ |
active_map_test.cc | 53 map.cols = (kWidth + 15) / 16; 55 ASSERT_EQ(map.cols, 13u); 61 map.cols = (kWidth + 15) / 16;
|
/external/eigen/Eigen/src/SparseCore/ |
SparseRedux.h | 19 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix"); 31 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix"); 39 eigen_assert(rows()>0 && cols()>0 && "you are using a non initialized matrix");
|
/external/eigen/demos/mix_eigen_and_c/ |
binary_library.h | 27 struct C_MatrixXd* MatrixXd_new(int rows, int cols); 31 void MatrixXd_resize (struct C_MatrixXd *m, int rows, int cols); 50 struct C_Map_MatrixXd* Map_MatrixXd_new(double *array, int rows, int cols);
|
/external/libvpx/libvpx/test/ |
active_map_test.cc | 53 map.cols = (kWidth + 15) / 16; 55 ASSERT_EQ(map.cols, 13u); 61 map.cols = (kWidth + 15) / 16;
|