Searched defs:rows (Results 276 - 300 of 469) sorted by relevance

<<111213141516171819

/external/eigen/unsupported/Eigen/src/IterativeSolvers/
H A DIncompleteCholesky.h49 Index rows() const { return m_L.rows(); } function in class:Eigen::IncompleteCholesky
95 if (m_perm.rows() == b.rows())
102 if (m_perm.rows() == b.rows())
111 eigen_assert(cols()==b.rows()
112 && "IncompleteLLT::solve(): invalid number of rows of the right hand side matrix b");
141 if (m_perm.rows() == mat.rows() ) // T
[all...]
/external/eigen/unsupported/Eigen/src/KroneckerProduct/
H A DKroneckerTensorProduct.h46 inline Index rows() const { return m_A.rows() * m_B.rows(); } function in class:Eigen::KroneckerProduct
51 return m_A.coeff(row / m_B.rows(), col / m_B.cols()) *
52 m_B.coeff(row % m_B.rows(), col % m_B.cols());
94 inline Index rows() const { return m_A.rows() * m_B.rows(); } function in class:Eigen::KroneckerProductSparse
116 const Index Br = m_B.rows(),
118 for (Index i=0; i < m_A.rows();
[all...]
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixExponential.h165 m_U(M.rows(),M.cols()),
166 m_V(M.rows(),M.cols()),
167 m_tmp1(M.rows(),M.cols()),
168 m_tmp2(M.rows(),M.cols()),
169 m_Id(MatrixType::Identity(M.rows(), M.cols())),
425 Index rows() const { return m_src.rows(); } function in struct:Eigen::MatrixExponentialReturnValue
445 eigen_assert(rows() == cols());
H A DMatrixLogarithm.h85 MatrixType result(A.rows(), A.rows());
86 if (A.rows() == 1)
88 else if (A.rows() == 2)
140 RealScalar normTminusI = (T - MatrixType::Identity(T.rows(), T.rows())).cwiseAbs().colwise().sum().maxCoeff();
241 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows());
242 result.setZero(T.rows(), T.rows());
456 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixLogarithmReturnValue
[all...]
H A DMatrixSquareRoot.h42 eigen_assert(A.rows() == A.cols());
82 result.resize(m_A.rows(), m_A.cols());
94 const Index size = m_A.rows();
113 const Index size = m_A.rows();
262 eigen_assert(A.rows() == A.cols());
288 result.resize(m_A.rows(), m_A.cols());
290 for (Index i = 0; i < m_A.rows(); i++) {
347 eigen_assert(A.rows() == A.cols());
358 MatrixType sqrtT = MatrixType::Zero(m_A.rows(), m_A.cols());
380 eigen_assert(A.rows()
440 Index rows() const { return m_src.rows(); } function in class:Eigen::MatrixSquareRootReturnValue
[all...]
/external/eigen/unsupported/Eigen/src/SVD/
H A DSVDBase.h160 inline Index rows() const { return m_rows; } function in class:Eigen::SVDBase
166 bool allocate(Index rows, Index cols, unsigned int computationOptions) ;
194 bool SVDBase<MatrixType>::allocate(Index rows, Index cols, unsigned int computationOptions) argument
196 eigen_assert(rows >= 0 && cols >= 0);
199 rows == m_rows &&
206 m_rows = rows;
/external/eigen/unsupported/Eigen/src/Skyline/
H A DSkylineInplaceLU.h37 : /*m_matrix(matrix.rows(), matrix.cols()),*/ m_flags(flags), m_status(0), m_lu(matrix) {
121 const size_t rows = m_lu.rows(); local
124 eigen_assert(rows == cols && "We do not (yet) support rectangular LU.");
127 for (Index row = 0; row < rows; row++) {
138 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
157 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
170 for (Index rrow = row + 1; rrow < m_lu.rows(); rrow++) {
185 const size_t rows = m_lu.rows(); local
308 const size_t rows = m_lu.rows(); local
[all...]
H A DSkylineMatrix.h74 inline Index rows() const { function in class:Eigen::SkylineMatrix
456 const Index stop = m_rowStartIndex[rows()];
464 for (Index innerIdx = rows(); innerIdx > outer; innerIdx--) {
486 const Index stop = m_rowStartIndex[rows()];
536 if (rows() > cols())
537 m_data.resize(cols(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()] + 1);
539 m_data.resize(rows(), cols(), rows(), m_colStartIndex[cols()] + 1, m_rowStartIndex[rows()]
[all...]
H A DSkylineProduct.h78 eigen_assert(lhs.cols() == rhs.rows());
97 EIGEN_STRONG_INLINE Index rows() const { function in class:Eigen::internal::SkylineProduct
98 return m_lhs.rows();
139 for (Index row = 0; row < lhs.rows(); row++) {
144 for (Index row = 0; row < lhs.rows(); row++) {
202 for (Index row = 0; row < lhs.rows(); row++) {
208 for (Index row = 0; row < lhs.rows(); row++) {
/external/eigen/unsupported/Eigen/src/SparseExtra/
H A DDynamicSparseMatrix.h25 * nonzero and outer_size is the number of columns if the matrix is column-major and the number of rows
80 inline Index rows() const { return IsRowMajor ? outerSize() : m_innerSize; } function in class:Eigen::DynamicSparseMatrix
197 void resize(Index rows, Index cols)
199 const Index outerSize = IsRowMajor ? rows : cols;
200 m_innerSize = IsRowMajor ? cols : rows;
208 void resizeAndKeepData(Index rows, Index cols)
210 const Index outerSize = IsRowMajor ? rows : cols;
211 const Index innerSize = IsRowMajor ? cols : rows;
233 EIGEN_DEPRECATED inline DynamicSparseMatrix(Index rows, Index cols)
236 resize(rows, col
[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/libvpx/libvpx/vp9/common/
H A Dvp9_idct.h90 transform_1d cols, rows; // vertical and horizontal member in struct:__anon24915
/external/libvpx/libvpx/vp9/decoder/
H A Dvp9_dthread.c140 // Number of superblock rows and cols
168 // Initialize cur_sb_col to -1 for all SB rows.
208 // Wait till all rows are finished
229 void vp9_loop_filter_alloc(VP9_COMMON *cm, VP9LfSync *lf_sync, int rows, argument
235 vpx_malloc(sizeof(*lf_sync->mutex_) * rows));
236 for (i = 0; i < rows; ++i) {
241 vpx_malloc(sizeof(*lf_sync->cond_) * rows));
242 for (i = 0; i < rows; ++i) {
248 vpx_malloc(sizeof(*lf_sync->cur_sb_col) * rows));
255 void vp9_loop_filter_dealloc(VP9LfSync *lf_sync, int rows) { argument
[all...]
/external/libvterm/src/
H A Dvterm.c30 VTerm *vterm_new(int rows, int cols) argument
32 return vterm_new_with_allocator(rows, cols, &default_allocator, NULL);
35 VTerm *vterm_new_with_allocator(int rows, int cols, VTermAllocatorFunctions *funcs, void *allocdata) argument
43 vt->rows = rows;
86 *rowsp = vt->rows;
91 void vterm_set_size(VTerm *vt, int rows, int cols) argument
93 vt->rows = rows;
97 (*vt->parser_callbacks->resize)(rows, col
[all...]
/external/lldb/source/Plugins/SymbolFile/DWARF/
H A DDWARFDebugLine.h171 rows()
179 rows.clear();
186 Row::collection rows; member in struct:DWARFDebugLine::LineTable
/external/mesa3d/src/gallium/state_trackers/glx/xlib/
H A Dglx_usefont.c166 unsigned int rows, pages; local
170 rows = fs->max_byte1 - fs->min_byte1 + 1;
173 if (rows == 1) {
190 if (rows == 1) {
257 rows = fs->max_byte1 - fs->min_byte1 + 1;
258 unsigned int first_char, last_char, pages, rows;
/external/mesa3d/src/glx/
H A Dxfont.c172 unsigned int rows, pages; local
176 rows = fs->max_byte1 - fs->min_byte1 + 1;
179 if (rows == 1) {
196 if (rows == 1) {
260 rows = fs->max_byte1 - fs->min_byte1 + 1;
261 unsigned int first_char, last_char, pages, rows;
/external/mesa3d/src/mesa/drivers/x11/
H A Dxfonts.c173 unsigned int rows, pages; local
177 rows = fs->max_byte1 - fs->min_byte1 + 1;
180 if (rows == 1) {
197 if (rows == 1) {
263 rows = fs->max_byte1 - fs->min_byte1 + 1;
264 unsigned int first_char, last_char, pages, rows;
/external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/
H A DShadowAbstractCursor.java25 protected Map<Integer, Map<String, Object>> rows = new HashMap<Integer, Map<String, Object>>(); field in class:ShadowAbstractCursor
76 currentRow = rows.get(currentRowNumber);
/external/valgrind/main/drd/tests/
H A Domp_matinv.c41 /** Allocate memory for a matrix with the specified number of rows and
44 static elem_t* new_matrix(const int rows, const int cols) argument
46 assert(rows > 0);
48 return malloc(rows * cols * sizeof(elem_t));
58 static void init_matrix(elem_t* const a, const int rows, const int cols) argument
61 for (i = 0; i < rows; i++)
63 for (j = 0; j < rows; j++)
72 const elem_t* const a, const int rows, const int cols)
76 for (i = 0; i < rows; i++)
154 * has at least as many columns as rows, th
71 print_matrix(const char* const label, const elem_t* const a, const int rows, const int cols) argument
158 gj(elem_t* const a, const int rows, const int cols) argument
[all...]
/external/ceres-solver/internal/ceres/
H A Dcompressed_row_sparse_matrix.cc47 // duplicates in the pair of arrays rows and cols, i.e., there is no
50 // rows[i] == rows[j] && cols[i] == cols[j]
54 RowColLessThan(const int* rows, const int* cols) argument
55 : rows(rows), cols(cols) {
59 if (rows[x] == rows[y]) {
62 return (rows[x] < rows[
65 const int* rows; member in struct:ceres::internal::__anon1759::RowColLessThan
329 int* rows = matrix->mutable_rows(); local
[all...]
H A Dcompressed_row_sparse_matrix_test.cc223 EXPECT_EQ(crsm->num_rows() + 1, crs_matrix.rows.size());
228 EXPECT_EQ(crsm->rows()[i], crs_matrix.rows[i]);
283 int* rows = matrix_->mutable_rows(); local
287 rows[0] = 0;
291 rows[1] = 1;
295 rows[2] = 2;
301 rows[3] = 4;
309 rows[4] = 7;
350 int* rows local
437 vector<int> rows; local
[all...]
H A Dcovariance_test.cc107 const int* rows = crsm->rows(); local
109 EXPECT_EQ(rows[r], expected_rows[r])
111 << rows[r] << " "
352 << "rows: " << row_begin << " " << row_end << " "
H A Dprogram.cc392 int* rows = tsm->mutable_rows(); local
411 rows = tsm->mutable_rows();
417 rows[num_nonzeros] = r;
/external/chromium_org/chrome/browser/history/
H A Dexpire_history_backend_unittest.cc158 virtual void NotifySyncURLsModified(URLRows* rows) OVERRIDE {}
161 URLRows* rows) OVERRIDE {}
330 const history::URLRows& rows(details->rows);
332 rows.begin(), rows.end(), history::URLRow::URLRowHasURL(row.url()));
333 if (it_row != rows.end()) {
342 const history::URLRows& rows = local
346 std::find_if(rows.begin(), rows
357 const history::URLRows& rows = local
524 URLRow rows[3]; local
[all...]

Completed in 6323 milliseconds

<<111213141516171819