HomeSort by relevance Sort by last modified time
    Searched refs:cols (Results 101 - 125 of 787) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/ceres-solver/internal/ceres/
compressed_row_sparse_matrix_test.cc 224 EXPECT_EQ(crsm->num_nonzeros(), crs_matrix.cols.size());
232 EXPECT_EQ(crsm->cols()[i], crs_matrix.cols[i]);
284 int* cols = matrix_->mutable_cols(); local
288 cols[0] = 0;
292 cols[1] = 1;
296 cols[2] = 1;
298 cols[3] = 2;
302 cols[4] = 0;
304 cols[5] = 1
351 int* cols = matrix.mutable_cols(); local
438 vector<int> cols; local
    [all...]
block_sparse_matrix.cc 57 for (int i = 0; i < block_structure_->cols.size(); ++i) {
58 num_cols_ += block_structure_->cols[i].size;
70 int col_block_size = block_structure_->cols[col_block_id].size;
98 int col_block_size = block_structure_->cols[col_block_id].size;
99 int col_block_pos = block_structure_->cols[col_block_id].position;
118 int col_block_size = block_structure_->cols[col_block_id].size;
119 int col_block_pos = block_structure_->cols[col_block_id].position;
136 int col_block_size = block_structure_->cols[col_block_id].size;
137 int col_block_pos = block_structure_->cols[col_block_id].position;
153 int col_block_size = block_structure_->cols[col_block_id].size
    [all...]
block_structure.h 81 vector<Block> cols; member in struct:ceres::internal::CompressedRowBlockStructure
87 vector<CompressedColumn> cols; member in struct:ceres::internal::CompressedColumnBlockStructure
  /external/eigen/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())
741 inline Index cols() const { return m_cols; } function in class:Eigen::JacobiSVD
    [all...]
  /external/chromium_org/third_party/pexpect/
screen.py 69 self.cols = c
76 self.w = [ [SPACE] * self.cols for c in range(self.rows)]
98 top_bot = '+' + '-'*self.cols + '+\n'
103 self.fill_region (1,1,self.rows,self.cols, ch)
109 cs = constrain (cs, 1, self.cols)
110 ce = constrain (ce, 1, self.cols)
158 c = constrain (c, 1, self.cols)
177 c = constrain (c, 1, self.cols)
178 for ci in range (self.cols, c, -1):
189 c = constrain (c, 1, self.cols)
    [all...]
  /external/eigen/test/
product_extra.cpp 22 Index cols = m.cols(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
26 m3(rows, cols),
27 mzero = MatrixType::Zero(rows, cols),
31 square2 = MatrixType::Random(cols, cols),
32 res2 = MatrixType::Random(cols, cols);
    [all...]
integer_types.cpp 28 Index cols = m.cols(); local
30 MatrixType m1(rows, cols),
31 m2 = MatrixType::Random(rows, cols),
32 mzero = MatrixType::Zero(rows, cols);
35 m1 = MatrixType::Random(rows, cols);
62 Index cols = m.cols(); local
66 MatrixType m1(rows, cols),
67 m2 = MatrixType::Random(rows, cols),
    [all...]
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...]
  /external/lldb/test/pexpect-2.4/
screen.py 53 self.cols = c
60 self.w = [ [SPACE] * self.cols for c in range(self.rows)]
82 top_bot = '+' + '-'*self.cols + '+\n'
87 self.fill_region (1,1,self.rows,self.cols, ch)
93 cs = constrain (cs, 1, self.cols)
94 ce = constrain (ce, 1, self.cols)
142 c = constrain (c, 1, self.cols)
161 c = constrain (c, 1, self.cols)
162 for ci in range (self.cols, c, -1):
173 c = constrain (c, 1, self.cols)
    [all...]
  /external/eigen/Eigen/src/Eigenvalues/
GeneralizedEigenSolver.h 149 : m_eivec(A.rows(), A.cols()),
150 m_alphas(A.cols()),
151 m_betas(A.cols()),
154 m_realQZ(A.cols()),
155 m_matS(A.rows(), A.cols()),
156 m_tmp(A.cols())
283 // Index n = m_eivec.cols();
295 eigen_assert(A.cols() == A.rows() && B.cols() == A.rows() && B.cols() == B.rows())
    [all...]
  /external/eigen/bench/
BenchSparseUtil.h 27 void fillMatrix(float density, int rows, int cols, EigenSparseMatrix& dst)
29 dst.reserve(double(rows)*cols*density);
30 for(int j = 0; j < cols; j++)
42 void fillMatrix2(int nnzPerCol, int rows, int cols, EigenSparseMatrix& dst)
44 // std::cout << "alloc " << nnzPerCol*cols << "\n";
45 dst.reserve(nnzPerCol*cols);
46 for(int j = 0; j < cols; j++)
65 for (int j=0; j<src.cols(); ++j)
76 GmmDynSparse tmp(src.rows(), src.cols());
77 for (int j=0; j<src.cols(); ++j
    [all...]
  /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/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());
  /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();
  /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/replicaisland/src/com/replica/replicaisland/
TiledWorld.java 35 public TiledWorld(int cols, int rows) {
37 mTilesArray = new int[cols][rows];
39 mColCount = cols;
41 for (int x = 0; x < cols; x++) {
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/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;

Completed in 577 milliseconds

1 2 3 45 6 7 8 91011>>