Searched refs:rows (Results 126 - 150 of 989) sorted by relevance

1234567891011>>

/external/eigen/test/
H A Dlinearstructure.cpp21 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols);
33 Index r = internal::random<Index>(0, rows-1),
65 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
66 VERIFY_IS_APPROX(m1.cwiseProduct(m1.block(0,0,rows,cols)), m1.cwiseProduct(m1));
67 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1);
68 VERIFY_IS_APPROX(m1.block(0,0,rows,col
[all...]
H A Dproduct_extra.cpp21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m2 = MatrixType::Random(rows, cols),
26 m3(rows, cols),
27 mzero = MatrixType::Zero(rows, cols),
28 identity = MatrixType::Identity(rows, rows),
29 square = MatrixType::Random(rows, rows),
[all...]
H A Dblock.cpp43 Index rows = m.rows(); local
46 MatrixType m1 = MatrixType::Random(rows, cols),
48 m2 = MatrixType::Random(rows, cols),
49 m3(rows, cols),
50 ones = MatrixType::Ones(rows, cols);
51 VectorType v1 = VectorType::Random(rows);
55 Index r1 = internal::random<Index>(0,rows-1);
56 Index r2 = internal::random<Index>(r1,rows-1);
82 VectorType bc1(m1.block(0,c1,rows,
183 Index rows = m.rows(); local
217 Index rows = m.rows(); local
[all...]
/external/chromium_org/third_party/libwebp/dsp/
H A Dneon.h50 static WEBP_INLINE int32x4x4_t Transpose4x4(const int32x4x4_t rows) { argument
53 row01.val[0] = vreinterpretq_u64_s32(rows.val[0]);
54 row01.val[1] = vreinterpretq_u64_s32(rows.val[1]);
55 row23.val[0] = vreinterpretq_u64_s32(rows.val[2]);
56 row23.val[1] = vreinterpretq_u64_s32(rows.val[3]);
/external/webp/src/dsp/
H A Dneon.h50 static WEBP_INLINE int32x4x4_t Transpose4x4(const int32x4x4_t rows) { argument
53 row01.val[0] = vreinterpretq_u64_s32(rows.val[0]);
54 row01.val[1] = vreinterpretq_u64_s32(rows.val[1]);
55 row23.val[0] = vreinterpretq_u64_s32(rows.val[2]);
56 row23.val[1] = vreinterpretq_u64_s32(rows.val[3]);
/external/eigen/Eigen/src/LU/
H A DPartialPivLU.h119 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
170 inline Index rows() const { return m_lu.rows(); } function in class:Eigen::PartialPivLU
203 : m_lu(matrix.rows(), matrix.rows()),
204 m_p(matrix.rows()),
205 m_rowsTranspositions(matrix.rows()),
241 const Index rows local
298 blocked_lu(Index rows, Index cols, Scalar* lu_data, Index luStride, PivIndex* row_transpositions, PivIndex& nb_transpositions, Index maxBlockSize=256) argument
[all...]
H A DFullPivLU.h80 FullPivLU(Index rows, Index cols);
199 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
341 return rank() == rows();
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()));
373 inline Index rows() const { return m_lu.rows(); } function in class:Eigen::FullPivLU
394 FullPivLU<MatrixType>::FullPivLU(Index rows, Inde argument
428 const Index rows = matrix.rows(); local
682 const Index rows = dec().rows(), cols = dec().cols(), local
[all...]
/external/valgrind/main/drd/tests/
H A Dmatinv.c35 int rows; member in struct:gj_threadinfo
53 /** Allocate memory for a matrix with the specified number of rows and
56 static elem_t* new_matrix(const int rows, const int cols) argument
58 assert(rows > 0);
60 return malloc(rows * cols * sizeof(elem_t));
70 static void init_matrix(elem_t* const a, const int rows, const int cols) argument
73 for (i = 0; i < rows; i++)
75 for (j = 0; j < rows; j++)
84 const elem_t* const a, const int rows, const int cols)
88 for (i = 0; i < rows;
83 print_matrix(const char* const label, const elem_t* const a, const int rows, const int cols) argument
174 const int rows = p->rows; local
223 gj(elem_t* const a, const int rows, const int cols) argument
[all...]
/external/eigen/Eigen/src/IterativeLinearSolvers/
H A DIterativeSolverBase.h115 Index rows() const { return mp_matrix ? mp_matrix->rows() : 0; } function in class:Eigen::IterativeSolverBase
170 eigen_assert(rows()==b.rows()
171 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b");
184 eigen_assert(rows()==b.rows()
185 && "IterativeSolverBase::solve(): invalid number of rows of the right hand side matrix b");
200 eigen_assert(rows()==b.rows());
[all...]
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineMatrixBase.h35 /**< The number of rows at compile-time. This is just a copy of the value provided
38 * \sa MatrixBase::rows(), MatrixBase::cols(), ColsAtCompileTime, SizeAtCompileTime */
44 * \sa MatrixBase::rows(), MatrixBase::cols(), RowsAtCompileTime, SizeAtCompileTime */
50 * rows times the number of columns, or to \a Dynamic if this is not
60 /**< This is set to true if either the number of rows or the number of
104 /** \returns the number of rows. \sa cols(), RowsAtCompileTime */
105 inline Index rows() const { function in class:Eigen::SkylineMatrixBase
106 return derived().rows();
109 /** \returns the number of columns. \sa rows(), ColsAtCompileTime*/
114 /** \returns the number of coefficients, which is \a rows()*col
[all...]
/external/ceres-solver/internal/ceres/
H A Dtriplet_sparse_matrix_test.cc78 EXPECT_EQ(m.rows()[0], 0);
79 EXPECT_EQ(m.rows()[1], 1);
119 EXPECT_EQ(cpy.rows()[0], 0);
120 EXPECT_EQ(cpy.rows()[1], 1);
165 EXPECT_EQ(cpy.rows()[0], 0);
166 EXPECT_EQ(cpy.rows()[1], 1);
215 EXPECT_EQ(m.rows()[0], 0);
216 EXPECT_EQ(m.rows()[1], 1);
217 EXPECT_EQ(m.rows()[2], 2);
218 EXPECT_EQ(m.rows()[
[all...]
H A Dblock_structure.h82 vector<CompressedRow> rows; member in struct:ceres::internal::CompressedRowBlockStructure
86 vector<Block> rows; member in struct:ceres::internal::CompressedColumnBlockStructure
/external/opencv/cv/src/
H A Dcvkdtree.cpp91 assert(results->rows == d->rows);
92 assert(results->rows == dist->rows);
96 for (int j = 0; j < d->rows; ++j) {
120 int rn = results->rows * results->cols;
141 std::vector<int> tmp(mat->rows);
174 assert(bounds_min->rows * bounds_min->cols == dims());
175 assert(bounds_max->rows * bounds_max->cols == dims());
218 if (results->rows !
[all...]
/external/eigen/Eigen/src/SVD/
H A DJacobiSVD.h79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
82 ::new (&m_qr) QRType(svd.rows(), svd.cols());
84 if (svd.m_computeFullU) m_workspace.resize(svd.rows());
89 if(matrix.rows() > matrix.cols())
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());
135 if(matrix.cols() > matrix.rows())
551 JacobiSVD(Index rows, Index cols, unsigned int computationOptions = 0) argument
740 inline Index rows() const { return m_rows; } function in class:Eigen::JacobiSVD
768 allocate(Index rows, Index cols, unsigned int computationOptions) argument
[all...]
/external/chromium_org/components/history/core/browser/
H A Durl_database_unittest.cc300 // We should get 2 rows for |keyword|.
301 std::vector<KeywordSearchTermRow> rows; local
302 ASSERT_TRUE(GetKeywordSearchTermRows(keyword, &rows));
303 ASSERT_EQ(2u, rows.size());
304 if (rows[0].url_id == url_id1) {
305 EXPECT_EQ(keyword, rows[0].term);
306 EXPECT_EQ(keyword, rows[1].term);
307 EXPECT_EQ(url_id2, rows[1].url_id);
309 EXPECT_EQ(keyword, rows[0].term);
310 EXPECT_EQ(url_id1, rows[
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_linear.c51 ptr = (char*)src_ptr + src_stride * t->rows * y + bytes * x;
52 for (z = 0; z < t->rows; z++) {
73 ptr = (char*)dst_ptr + dst_stride * t->rows * y + bytes * x;
74 for (z = 0; z < t->rows; z++) {
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_linear.c51 ptr = (char*)src_ptr + src_stride * t->rows * y + bytes * x;
52 for (z = 0; z < t->rows; z++) {
73 ptr = (char*)dst_ptr + dst_stride * t->rows * y + bytes * x;
74 for (z = 0; z < t->rows; z++) {
94 t->rows = t->tile.height / t->block.height;
95 t->tile.size = t->cols * t->rows * t->block.size;
/external/eigen/unsupported/Eigen/src/SVD/
H A DJacobiSVD.h79 if (svd.rows() != m_qr.rows() || svd.cols() != m_qr.cols())
82 ::new (&m_qr) QRType(svd.rows(), svd.cols());
84 if (svd.m_computeFullU) m_workspace.resize(svd.rows());
89 if(matrix.rows() > matrix.cols())
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());
135 if(matrix.cols() > matrix.rows())
540 JacobiSVD(Index rows, Index cols, unsigned int computationOptions = 0) argument
621 allocate(Index rows, Index cols, unsigned int computationOptions) argument
[all...]
/external/chromium_org/third_party/skia/tools/bug_chomper/res/third_party/
H A Djquery.tablednd.js2 * TableDnD plug-in for JQuery, allows you to drag and drop table rows
25 * and the row that was dropped. You can work out the new order of the rows by using
26 * table.rows.
41 * Add class="nodrop" to any rows for which you don't want to allow dropping, and class="nodrag" to any rows
46 * an ID as must all the rows.
86 // Now make the rows draggable
100 /** This function makes all the rows on the table draggable apart from those marked as "NoDrag" */
102 // Now initialise the rows
103 var rows
298 var rows = jQuery.tableDnD.currentTable.rows; variable
[all...]
/external/eigen/bench/
H A Dsparse_trisolver.cpp40 void fillMatrix(float density, int rows, int cols, EigenSparseTriMatrix& dst) argument
42 dst.startFill(rows*cols*density);
58 int rows = SIZE; local
63 EigenSparseTriMatrix sm1(rows,cols);
72 EigenSparseTriMatrix sm1(rows, cols);
73 fillMatrix(density, rows, cols, sm1);
81 DenseMatrix m1(rows,cols);
82 Matrix<Scalar,Dynamic,Dynamic,Dynamic,Dynamic,RowMajorBit> m2(rows,cols);
138 GmmSparse m1(rows,cols);
163 MtlSparse m1(rows,col
[all...]
/external/eigen/test/eigen2/
H A Deigen2_sparse_solvers.cpp17 Matrix<Scalar,Dynamic,Dynamic> aux(refMat.rows(),refMat.cols());
27 for (int i=j ; i<sparseMat.rows(); ++i)
33 template<typename Scalar> void sparse_solvers(int rows, int cols) argument
35 double density = std::max(8./(rows*cols), 0.01);
40 DenseVector vec1 = DenseVector::Random(rows);
48 SparseMatrix<Scalar> m2(rows, cols);
49 DenseMatrix refMat2 = DenseMatrix::Zero(rows, cols);
75 SparseMatrix<Scalar> m2(rows, cols);
76 DenseMatrix refMat2(rows, cols);
116 SparseMatrix<Scalar> m2(rows, col
[all...]
/external/skia/tools/bug_chomper/res/third_party/
H A Djquery.tablednd.js2 * TableDnD plug-in for JQuery, allows you to drag and drop table rows
25 * and the row that was dropped. You can work out the new order of the rows by using
26 * table.rows.
41 * Add class="nodrop" to any rows for which you don't want to allow dropping, and class="nodrag" to any rows
46 * an ID as must all the rows.
86 // Now make the rows draggable
100 /** This function makes all the rows on the table draggable apart from those marked as "NoDrag" */
102 // Now initialise the rows
103 var rows
298 var rows = jQuery.tableDnD.currentTable.rows; variable
[all...]
/external/chromium_org/third_party/icu/source/common/
H A Dpropsvec.c32 int32_t rows; member in struct:UPropsVectors
68 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
70 /* set the all-Unicode row and the special-value rows */
72 uprv_memset(row, 0, pv->rows*columns*4);
98 limit=pv->rows;
184 /* find the rows whose ranges overlap with the input range */
186 /* find the first and last rows, always successful */
192 * input range (only possible for the first and last rows)
198 /* split first/last rows if necessary */
200 int32_t count, rows; local
336 int32_t i, columns, valueColumns, rows, count; local
[all...]
/external/icu/icu4c/source/common/
H A Dpropsvec.c32 int32_t rows; member in struct:UPropsVectors
68 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
70 /* set the all-Unicode row and the special-value rows */
72 uprv_memset(row, 0, pv->rows*columns*4);
98 limit=pv->rows;
184 /* find the rows whose ranges overlap with the input range */
186 /* find the first and last rows, always successful */
192 * input range (only possible for the first and last rows)
198 /* split first/last rows if necessary */
200 int32_t count, rows; local
336 int32_t i, columns, valueColumns, rows, count; local
[all...]
/external/chromium_org/chrome/browser/thumbnails/
H A Dcontent_analysis.h39 std::vector<float>* rows,
66 // Shrinks the source |bitmap| by removing rows and columns where |rows| and
70 const std::vector<bool>& rows,

Completed in 2826 milliseconds

1234567891011>>