Searched defs:rows (Results 201 - 225 of 316) sorted by relevance

1234567891011>>

/external/eigen/Eigen/src/SparseCore/
H A DSparseDenseProduct.h99 EIGEN_STRONG_INLINE Index rows() const { return Tr ? m_rhs.rows() : m_lhs.rows(); } function in class:Eigen::SparseDenseOuterProduct
H A DSparseProduct.h122 EIGEN_STRONG_INLINE Index rows() const { return m_lhs.rows(); } function in class:Eigen::SparseSparseProduct
131 eigen_assert(m_lhs.cols() == m_rhs.rows());
/external/eigen/bench/
H A Dsparse_setter.cpp63 int rows = SIZE; local
78 Vector2i ij(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1));
103 coords.push_back(Vector2i(internal::random<int>(0,rows-1),j));
/external/eigen/blas/
H A Dcommon.h98 matrix(T* data, int rows, int cols, int stride) argument
100 return Map<Matrix<T,Dynamic,Dynamic,ColMajor>, 0, OuterStride<> >(data, rows, cols, OuterStride<>(stride));
/external/eigen/test/
H A Djacobisvd.cpp21 Index rows = m.rows(); local
36 MatrixType sigma = MatrixType::Zero(rows,cols);
52 Index rows = m.rows(); local
54 Index diagSize = (std::min)(rows, cols);
74 Index rows = m.rows(); local
85 RhsType rhs = RhsType::Random(rows, internal::random<Index>(1, cols));
95 if (QRPreconditioner == NoQRPreconditioner && m.rows() !
143 Index rows = m.rows(); local
[all...]
/external/eigen/unsupported/Eigen/src/MatrixFunctions/
H A DMatrixExponential.h170 m_U(M.rows(),M.cols()),
171 m_V(M.rows(),M.cols()),
172 m_tmp1(M.rows(),M.cols()),
173 m_tmp2(M.rows(),M.cols()),
174 m_Id(MatrixType::Identity(M.rows(), M.cols())),
428 Index rows() const { return m_src.rows(); } function in struct:Eigen::MatrixExponentialReturnValue
448 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)
151 RealScalar normTminusI = (T - MatrixType::Identity(T.rows(), T.rows())).cwiseAbs().colwise().sum().maxCoeff();
250 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows());
251 result.setZero(T.rows(), T.rows());
465 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixLogarithmReturnValue
[all...]
H A DMatrixSquareRoot.h42 eigen_assert(A.rows() == A.cols());
88 MatrixType sqrtT = MatrixType::Zero(m_A.rows(), m_A.rows());
102 const Index size = m_A.rows();
121 const Index size = m_A.rows();
270 eigen_assert(A.rows() == A.cols());
299 result.resize(m_A.rows(), m_A.cols());
301 for (Index i = 0; i < m_A.rows(); i++) {
363 eigen_assert(A.rows() == A.cols());
375 MatrixType sqrtT = MatrixType::Zero(m_A.rows(), m_
458 Index rows() const { return m_src.rows(); } function in class:Eigen::MatrixSquareRootReturnValue
[all...]
/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/icu4c/common/
H A Dpropsvec.c31 int32_t rows; member in struct:UPropsVectors
67 pv->rows=2+(UPVEC_MAX_CP-UPVEC_FIRST_SPECIAL_CP);
69 /* set the all-Unicode row and the special-value rows */
71 uprv_memset(row, 0, pv->rows*columns*4);
94 int32_t columns, i, start, limit, prevRow, rows; local
97 rows=limit=pv->rows;
183 /* find the rows whose ranges overlap with the input range */
185 /* find the first and last rows, always successful */
191 * input range (only possible for the first and last rows)
199 int32_t count, rows; local
335 int32_t i, columns, valueColumns, rows, count; local
[all...]
/external/libvpx/vpx/
H A Dvp8cx.h191 unsigned int rows; /**< number of rows */ member in struct:vpx_roi_map
208 unsigned int rows; /**< number of rows */ member in struct:vpx_active_map
/external/linux-tools-perf/util/ui/
H A Dbrowser.c130 int cols, rows; local
131 newtGetScreenSize(&cols, &rows);
134 self->height = rows - 2;
/external/mesa3d/src/glsl/
H A Dglsl_types.cpp279 glsl_type::get_instance(unsigned base_type, unsigned rows, unsigned columns) argument
284 if ((rows < 1) || (rows > 4) || (columns < 1) || (columns > 4))
292 return uint_type + (rows - 1);
294 return int_type + (rows - 1);
296 return float_type + (rows - 1);
298 return bool_type + (rows - 1);
303 if ((base_type != GLSL_TYPE_FLOAT) || (rows == 1))
317 switch (IDX(columns, rows)) {
/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/webkit/Source/WebCore/accessibility/
H A DAccessibilityTable.cpp202 // For the first 5 rows, cache the background color so we can check if this table has zebra-striped rows.
300 // go through all the available sections to pull out the rows
330 // can cause us to mess rows if we just check the first column
383 AccessibilityObject::AccessibilityChildrenVector& AccessibilityTable::rows() function in class:WebCore::AccessibilityTable
480 // first try rows
506 // we didn't find anything between the rows we should have
/external/webkit/Source/WebCore/platform/graphics/haiku/
H A DImageBufferHaiku.cpp110 unsigned rows = m_size.height(); local
112 for (unsigned y = 0; y < rows; y++) {
131 unsigned rows, unsigned columns)
133 for (unsigned y = 0; y < rows; y++) {
152 unsigned rows, unsigned columns,
157 for (unsigned y = 0; y < rows; y++) {
175 rows, columns);
181 unsigned rows, unsigned columns,
186 for (unsigned y = 0; y < rows; y++) {
211 rows, column
129 convertFromData(const uint8* sourceRows, unsigned sourceBytesPerRow, uint8* destRows, unsigned destBytesPerRow, unsigned rows, unsigned columns) argument
150 convertFromInternalData(const uint8* sourceRows, unsigned sourceBytesPerRow, uint8* destRows, unsigned destBytesPerRow, unsigned rows, unsigned columns, bool premultiplied) argument
179 convertToInternalData(const uint8* sourceRows, unsigned sourceBytesPerRow, uint8* destRows, unsigned destBytesPerRow, unsigned rows, unsigned columns, bool premultiplied) argument
249 unsigned rows = sourceRect.IntegerHeight() + 1; local
299 unsigned rows = sourceRect.height(); local
[all...]
/external/chromium/chrome/browser/importer/
H A Dmork_reader.cc461 // Columns for entry (non-meta) history rows
498 std::vector<history::URLRow>* rows) {
540 rows->push_back(row);
579 std::vector<history::URLRow> rows; local
581 AddToHistory(i->second, data, &rows);
582 if (!rows.empty())
583 bridge->SetHistoryItems(rows, history::SOURCE_FIREFOX_IMPORTED);
496 AddToHistory(MorkReader::ColumnDataList* column_values, const TableReadClosure& data, std::vector<history::URLRow>* rows) argument
/external/eigen/Eigen/src/Cholesky/
H A DLDLT.h93 : m_matrix(matrix.rows(), matrix.cols()),
94 m_transpositions(matrix.rows()),
95 m_temporary(matrix.rows()),
179 eigen_assert(m_matrix.rows()==b.rows()
180 && "LDLT::solve(): invalid number of rows of the right hand side matrix b");
213 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::LDLT
254 eigen_assert(mat.rows()==mat.cols());
255 const Index size = mat.rows();
[all...]
H A DLLT.h90 : m_matrix(matrix.rows(), matrix.cols()),
125 eigen_assert(m_matrix.rows()==b.rows()
126 && "LLT::solve(): invalid number of rows of the right hand side matrix b");
170 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::LLT
203 eigen_assert(mat.rows()==n && vec.size()==n);
268 eigen_assert(mat.rows()==mat.cols());
269 const Index size = mat.rows();
293 eigen_assert(m.rows()
[all...]
/external/eigen/Eigen/src/CholmodSupport/
H A DCholmodSupport.h57 res.nrow = mat.rows();;
122 res.nrow = mat.rows();
188 inline Index rows() const { return m_cholmodFactor->n; } function in class:Eigen::CholmodBase
221 eigen_assert(rows()==b.rows()
222 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
235 eigen_assert(rows()==b.rows()
236 && "CholmodDecomposition::solve(): invalid number of rows of the right hand side matrix b");
289 eigen_assert(size==b.rows());
[all...]
/external/eigen/Eigen/src/Core/
H A DPermutationMatrix.h107 /** \returns the number of rows */
108 inline Index rows() const { return indices().size(); } function in class:Eigen::PermutationBase
121 for (int i=0; i<rows();++i)
218 for (int i=0; i<rows();++i) indices().coeffRef(other.indices().coeff(i)) = i;
223 eigen_assert(lhs.cols() == rhs.rows());
224 for (int i=0; i<rows();++i) indices().coeffRef(i) = lhs.indices().coeff(rhs.indices().coeff(i));
263 * \param SizeAtCompileTime the number of rows/cols, or Dynamic
264 * \param MaxSizeAtCompileTime the maximum number of rows/cols, or Dynamic. This optional parameter defaults to SizeAtCompileTime. Most of the time, you should not have to specify it.
518 /** \returns the matrix with the permutation applied to the rows.
549 inline int rows() cons function in struct:Eigen::internal::permut_matrix_product_retval
637 inline int rows() const { return m_permutation.rows(); } function in class:Eigen::Transpose
[all...]
H A DPlainObjectBase.h25 EIGEN_ALWAYS_INLINE void check_rows_cols_for_overflow(Index rows, Index cols) argument
30 bool error = (rows < 0 || cols < 0) ? true
31 : (rows == 0 || cols == 0) ? false
32 : (rows > max_index / cols);
119 EIGEN_STRONG_INLINE Index rows() const { return m_storage.rows(); } function in class:Eigen::PlainObjectBase
127 return m_storage.data()[row + col * m_storage.rows()];
140 return m_storage.data()[row + col * m_storage.rows()];
153 return m_storage.data()[row + col * m_storage.rows()];
168 : row + col * m_storage.rows()));
219 resize(Index rows, Index cols) argument
281 resize(Index rows, NoChange_t) argument
321 conservativeResize(Index rows, Index cols) argument
333 conservativeResize(Index rows, NoChange_t) argument
419 PlainObjectBase(Index size, Index rows, Index cols) argument
462 Map(const Scalar* data, Index rows, Index cols) argument
464 Map(Scalar* data, Index rows, Index cols) argument
475 MapAligned(const Scalar* data, Index rows, Index cols) argument
477 MapAligned(Scalar* data, Index rows, Index cols) argument
493 Map(const Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
496 Map(Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
512 MapAligned(const Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
515 MapAligned(Scalar* data, Index rows, Index cols, const Stride<Outer, Inner>& stride) argument
603 _init2(Index rows, Index cols, typename internal::enable_if<Base::SizeAtCompileTime!=2,T0>::type* = 0) argument
660 run(DenseBase<Derived>& _this, Index rows, Index cols) argument
[all...]

Completed in 808 milliseconds

1234567891011>>