Searched refs:cols (Results 51 - 75 of 683) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dcorners.cpp20 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 Dproduct.h35 Index cols = m.cols(); local
39 MatrixType m1 = MatrixType::Random(rows, cols),
40 m2 = MatrixType::Random(rows, cols),
41 m3(rows, cols);
47 square2 = ColSquareMatrixType::Random(cols, cols),
48 res2 = ColSquareMatrixType::Random(cols, cols);
50 ColVectorType vc2 = ColVectorType::Random(cols), vcre
[all...]
H A Deigensolver_generalized_real.cpp21 Index cols = m.cols(); local
26 MatrixType a = MatrixType::Random(rows,cols);
27 MatrixType b = MatrixType::Random(rows,cols);
28 MatrixType a1 = MatrixType::Random(rows,cols);
29 MatrixType b1 = MatrixType::Random(rows,cols);
H A Dswap.cpp32 typename MatrixType::Index cols = m.cols(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_linear.h62 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/mesa3d/src/gallium/auxiliary/util/
H A Du_linear.h62 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/ceres-solver/internal/ceres/
H A Ddetect_structure.cc71 *e_block_size = bs.cols[e_block_id].size;
73 *e_block_size != bs.cols[e_block_id].size) {
76 << bs.cols[e_block_id].size;
83 *f_block_size = bs.cols[f_block_id].size;
87 if (*f_block_size != bs.cols[row.cells[c].block_id].size) {
90 << bs.cols[row.cells[c].block_id].size;
H A Dcompressed_col_sparse_matrix_utils_test.cc92 int* cols) {
107 cols[offset] = col_pos + c;
135 int* cols = tsm.mutable_cols(); local
142 rows + offset, cols + offset);
199 cols.resize(5);
203 cols[0] = 0;
207 cols[1] = 1;
211 cols[2] = 2;
217 cols[3] = 4;
225 cols[
87 FillBlock(const vector<int>& row_blocks, const vector<int>& col_blocks, const int row_block_id, const int col_block_id, int* rows, int* cols) argument
228 vector<int> cols; member in class:ceres::internal::SolveUpperTriangularTest
[all...]
/external/eigen/bench/
H A Dbench_reverse.cpp21 int cols = m.cols(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
32 int c = internal::random<int>(0,cols-1);
50 std::cout << rows << " x " << cols << " \t"
H A Dsparse_randomsetter.cpp48 int cols = sm1.cols(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
68 int cols = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols
[all...]
H A Dsparse_trisolver.cpp40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst) argument
42 dst.startFill(rows*cols*density);
43 for(int j = 0; j < cols; j++)
59 int cols = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
65 DenseVector b = DenseVector::Random(cols);
66 DenseVector x = DenseVector::Random(cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
[all...]
H A Dspmv.cpp28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
41 int cols = size; local
55 cols = atoi(argv[i]+1);
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, cols, sm);
96 DenseMatrix dm(rows,cols), (row local
[all...]
H A Dbasicbenchmark.h44 const int cols = mat.cols(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
H A Dsparse_dense_product.cpp55 int cols = SIZE; local
58 EigenSparseMatrix sm1(rows,cols);
59 DenseVector v1(cols), v2(cols);
65 //fillMatrix(density, rows, cols, sm1);
66 fillMatrix2(7, rows, cols, sm1);
72 DenseMatrix m1(rows,cols);
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
119 //GmmDynSparse gmmT3(rows,cols);
[all...]
/external/eigen/test/eigen2/
H A Deigen2_qr.cpp19 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);
H A Dproduct.h37 int cols = m.cols(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 mzero = MatrixType::Zero(rows, cols);
50 square2 = ColSquareMatrixType::Random(cols, cols),
51 res2 = ColSquareMatrixType::Random(cols, cols);
[all...]
H A Deigen2_basicstuff.cpp18 int cols = m.cols(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
36 c = ei_random<int>(0, cols-1);
68 VERIFY_IS_MUCH_SMALLER_THAN(MatrixType::Zero(rows,cols)(r,c), static_cast<Scalar>(1));
78 if(cols!=1 && rows!=1 && MatrixType::SizeAtCompileTime!=Dynamic)
80 VERIFY_RAISES_ASSERT(m1 = (m2.block(0,0, rows-1, cols
[all...]
H A Deigen2_linearstructure.cpp22 int 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);
35 c = ei_random<int>(0, cols-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,cols), m
[all...]
/external/eigen/Eigen/src/Eigen2Support/
H A DBlock.h43 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
63 return Block<Derived>(derived(), 0, cols() - cCols, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
95 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
116 return Block<Derived, CRows, CCols>(derived(), 0, cols() - CCols);
120 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
/external/lldb/test/pexpect-2.4/examples/
H A Dbd_client.py13 #cols = int(s.recv(4))
15 cols = 80
17 packet_size = cols * rows * 2 # double it for good measure
/external/eigen/Eigen/src/Core/
H A DCommaInitializer.h41 : m_xpr(xpr), m_row(0), m_col(other.cols()), m_currentBlockRows(other.rows())
43 m_xpr.block(0, 0, other.rows(), other.cols()) = other;
53 const_cast<CommaInitializer&>(o).m_col = m_xpr.cols();
60 if (m_col==m_xpr.cols())
68 eigen_assert(m_col<m_xpr.cols()
79 if(other.cols()==0 || other.rows()==0)
81 if (m_col==m_xpr.cols())
89 eigen_assert(m_col<m_xpr.cols()
97 m_xpr.block(m_row, m_col, other.rows(), other.cols()) = other;
98 m_col += other.cols();
[all...]
H A DPlainObjectBase.h38 static EIGEN_ALWAYS_INLINE void run(Index rows, Index cols) argument
43 bool error = (rows == 0 || cols == 0) ? false
44 : (rows > max_index / cols);
136 EIGEN_STRONG_INLINE Index cols() const { return m_storage.cols(); } function in class:Eigen::PlainObjectBase
141 return m_storage.data()[colId + rowId * m_storage.cols()];
154 return m_storage.data()[colId + rowId * m_storage.cols()];
167 return m_storage.data()[colId + rowId * m_storage.cols()];
183 ? colId + rowId * m_storage.cols()
200 ? colId + rowId * m_storage.cols()
483 Map(const Scalar* data, Index rows, Index cols) argument
485 Map(Scalar* data, Index rows, Index cols) argument
496 MapAligned(const Scalar* data, Index rows, Index cols) argument
498 MapAligned(Scalar* data, Index rows, Index cols) argument
514 Map(const Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
517 Map(Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
533 MapAligned(const Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
536 MapAligned(Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
680 run(DenseBase<Derived>& _this, Index rows, Index cols) argument
[all...]
/external/eigen/Eigen/src/LU/
H A DFullPivLU.h80 FullPivLU(Index rows, Index cols);
315 return cols() - rank();
328 return rank() == cols();
353 return isInjective() && (m_lu.rows() == m_lu.cols());
366 eigen_assert(m_lu.rows() == m_lu.cols() && "You can't take the inverse of a non-square matrix!");
368 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
374 inline Index cols() const { return m_lu.cols(); } function in class:Eigen::FullPivLU
394 FullPivLU<MatrixType>::FullPivLU(Index rows, Index cols) argument
395 : m_lu(rows, cols),
429 const Index cols = matrix.cols(); local
556 const Index cols = dec().matrixLU().cols(), dimker = cols - rank(); local
682 const Index rows = dec().rows(), cols = dec().cols(), local
[all...]
/external/compiler-rt/lib/sanitizer_common/scripts/
H A Dgen_dynamic_list.py42 cols = line.split(' ')
43 if (len(cols) == 3 and cols[1] in ('T', 'W')) :
44 functions.append(cols[2])
/external/eigen/blas/
H A DGeneralRank1Update.h22 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);

Completed in 299 milliseconds

1234567891011>>