Searched refs:rows (Results 76 - 100 of 989) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/QR/
H A DHouseholderQR.h76 HouseholderQR(Index rows, Index cols) argument
77 : m_qr(rows, cols),
78 m_hCoeffs((std::min)(rows,cols)),
88 * HouseholderQR<MatrixType> qr(matrix.rows(), matrix.cols());
95 : m_qr(matrix.rows(), matrix.cols()),
96 m_hCoeffs((std::min)(matrix.rows(),matrix.cols())),
182 inline Index rows() const { return m_qr.rows(); } function in class:Eigen::HouseholderQR
203 eigen_assert(m_qr.rows() == m_qr.cols() && "You can't take the determinant of a non-square matrix!");
211 eigen_assert(m_qr.rows()
224 Index rows = mat.rows(); local
263 Index rows = mat.rows(); local
313 const Index rows = dec().rows(), cols = dec().cols(); local
346 Index rows = matrix.rows(); local
[all...]
/external/ceres-solver/internal/ceres/
H A Dpartitioned_matrix_view_impl.h63 for (int r = 0; r < bs->rows.size(); ++r) {
64 const vector<Cell>& cells = bs->rows[r].cells;
106 const Cell& cell = bs->rows[r].cells[0];
107 const int row_block_pos = bs->rows[r].block.position;
108 const int row_block_size = bs->rows[r].block.size;
132 const int row_block_pos = bs->rows[r].block.position;
133 const int row_block_size = bs->rows[r].block.size;
134 const vector<Cell>& cells = bs->rows[r].cells;
146 for (int r = num_row_blocks_e_; r < bs->rows.size(); ++r) {
147 const int row_block_pos = bs->rows[
[all...]
H A Ddense_qr_solver.cc89 // rhs = [b;0] to account for the additional rows in the lhs.
90 if (rhs_.rows() != lhs_.rows()) {
91 rhs_.resize(lhs_.rows());
96 if (work_.rows() == 1) {
98 LAPACK::EstimateWorkSizeForQR(lhs_.rows(), lhs_.cols());
106 summary.termination_type = LAPACK::SolveInPlaceUsingQR(lhs_.rows(),
109 work_.rows(),
138 // rhs = [b;0] to account for the additional rows in the lhs.
141 if (rhs_.rows() !
[all...]
/external/eigen/bench/
H A DbenchEigenSolver.cpp36 int rows = m.rows(); local
39 int stdRepeats = std::max(1,int((REPEAT*1000)/(rows*rows*sqrt(rows))));
45 MatrixType a = MatrixType::Random(rows,cols);
51 int r = internal::random<int>(0,covMat.rows()-1);
85 std::cout << covMat.rows() << " \t"
95 gmm::dense_matrix<Scalar> gmmCovMat(covMat.rows(),covMat.cols());
96 gmm::dense_matrix<Scalar> eigvect(covMat.rows(),covMa
[all...]
H A Dbench_reverse.cpp20 int rows = m.rows(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
31 int r = internal::random<int>(0,rows-1);
50 std::cout << rows << " x " << cols << " \t"
H A Dsparse_randomsetter.cpp47 int rows = sm1.rows(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
67 int rows = 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
[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,
32 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
40 int rows = size; local
51 rows = atoi(argv[i]+1);
76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
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, col
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_linear.h63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
/external/chromium_org/third_party/mesa/src/src/glsl/tests/
H A Dcopy_constant_to_storage_tests.cpp40 void int_test(unsigned rows);
41 void uint_test(unsigned rows);
42 void bool_test(unsigned rows);
44 void float_test(unsigned columns, unsigned rows);
67 copy_constant_to_storage::int_test(unsigned rows) argument
70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val);
86 copy_constant_to_storage::uint_test(unsigned rows) argument
89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val);
105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows) argument
108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, va
124 bool_test(unsigned rows) argument
[all...]
/external/eigen/test/
H A Dconservative_resize.cpp40 const Index rows = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
50 const Index rows = 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) );
77 m.conservativeResize(m.rows(),
[all...]
H A Deigensolver_complex.cpp17 by checking that the k-th power sums are equal for k = 1, ..., vec1.rows() */
25 VERIFY(vec1.rows() == vec2.rows());
26 for (int k = 1; k <= vec1.rows(); ++k)
39 Index rows = m.rows(); local
45 MatrixType a = MatrixType::Random(rows,cols);
60 ei2.setMaxIterations(ComplexSchur<MatrixType>::m_maxIterationsPerRow * rows).compute(a);
64 if (rows > 2) {
75 MatrixType z = MatrixType::Zero(rows,col
[all...]
H A Dcwiseop.cpp72 Index rows = m.rows(); 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),
83 ::Identity(rows, rows);
[all...]
H A Deigensolver_generalized_real.cpp20 Index rows = m.rows(); 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 Ddiagonalmatrices.cpp23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols);
28 VectorType v1 = VectorType::Random(rows),
29 v2 = VectorType::Random(rows);
50 sq_m1.block(0,0,rows,rows) = ldm1;
55 Index i = internal::random<Index>(0, rows-1);
69 big.setZero(2*rows,
[all...]
H A Deigen2support.cpp19 Index rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
43 VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
44 VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
H A Dswap.cpp31 typename MatrixType::Index rows = m.rows(); 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/eigen/test/eigen2/
H A Deigen2_cholesky.cpp24 int rows = m.rows(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
33 VectorType vecB = VectorType::Random(rows), vecX(rows);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
52 VectorType vecX(rows), _vecX, _vecB;
91 if (rows>
[all...]
H A Deigen2_lu.cpp17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
20 int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
23 j = Eigen::ei_random<int>(0,m.rows()-1);
41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local
42 int rank = ei_random<int>(1, std::min(rows, cols)-1);
44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
45 m1 = MatrixType::Random(rows,cols);
46 if(rows <= cols)
47 for(int i = rank; i < rows;
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_linear.h63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
/external/mesa3d/src/glsl/tests/
H A Dcopy_constant_to_storage_tests.cpp40 void int_test(unsigned rows);
41 void uint_test(unsigned rows);
42 void bool_test(unsigned rows);
44 void float_test(unsigned columns, unsigned rows);
67 copy_constant_to_storage::int_test(unsigned rows) argument
70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val);
86 copy_constant_to_storage::uint_test(unsigned rows) argument
89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val);
105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows) argument
108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, va
124 bool_test(unsigned rows) argument
[all...]
/external/chromium_org/third_party/libvpx/source/libvpx/vp9/decoder/
H A Dvp9_dthread.h41 int rows; member in struct:VP9LfSyncData
45 void vp9_loop_filter_alloc(VP9LfSync *lf_sync, VP9_COMMON *cm, int rows,
/external/chromium_org/third_party/markdown/extensions/
H A Dtables.py59 rows = block.split('\n')
60 return (len(rows) > 2 and '|' in rows[0] and
61 '|' in rows[1] and '-' in rows[1] and
62 rows[1].strip()[0] in ['|', ':', '-'])
69 rows = block[2:]
90 for row in rows:
/external/eigen/Eigen/src/Core/products/
H A DParallelizer.h86 void parallelize_gemm(const Functor& func, Index rows, Index cols, bool transpose) argument
96 func(0,rows, 0,cols);
108 return func(0,rows, 0,cols);
110 Index size = transpose ? cols : rows;
120 return func(0,rows, 0,cols);
126 std::swap(rows,cols);
129 Index blockRows = (rows / threads) & ~Index(0x7);
137 Index actualBlockRows = (i+1==threads) ? rows-r0 : blockRows;
/external/eigen/Eigen/src/Eigen2Support/
H A DBlock.h20 * \param cRows the number of rows in the corner
45 return Block<Derived>(derived(), rows() - cRows, 0, cRows, cCols);
47 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
65 return Block<Derived>(derived(), rows() - cRows, 0, cRows, cCols);
67 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
76 * The template parameters CRows and CCols arethe number of rows and columns in the corner.
97 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, 0);
99 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, cols() - CCols);
118 return Block<Derived, CRows, CCols>(derived(), rows() - CRows, 0);
120 return Block<Derived, CRows, CCols>(derived(), rows()
[all...]
/external/eigen/doc/examples/
H A DTutorial_simple_example_dynamic_size.cpp12 for (int i=0; i<m.rows(); ++i) // loop over rows
13 m(i,j) = i+j*m.rows(); // to access matrix coefficients,

Completed in 4581 milliseconds

1234567891011>>