| /external/chromium/chrome/browser/ |
| remove_rows_table_model.h | 13 // A table model that also supports removing rows. Used for example for the
17 typedef std::set<size_t> Rows;
19 // Returns whether or not the rows can be removed.
20 virtual bool CanRemoveRows(const Rows& rows) const = 0;
22 // Remove the rows from the table.
23 virtual void RemoveRows(const Rows& rows) = 0;
25 // Removes all the rows.
|
| /external/eigen/test/ |
| diagonalmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
18 typedef Matrix<Scalar, Rows, 1> VectorType;
20 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType;
21 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix;
23 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
24 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols)
[all...] |
| permutationmatrices.cpp | 18 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
20 typedef PermutationMatrix<Rows> LeftPermutationType;
21 typedef Matrix<int, Rows, 1> LeftPermutationVectorType;
27 Index rows = m.rows(); local
30 MatrixType m_original = MatrixType::Random(rows,cols);
32 randomPermutationVector(lv, rows);
39 for (int i=0; i<rows; i++)
43 Matrix<Scalar,Rows,Rows> lm(lp)
[all...] |
| qr.cpp | 17 Index rows = m.rows(); local
24 MatrixType a = MatrixType::Random(rows,cols);
36 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
38 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
39 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
41 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
43 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
48 Matrix<Scalar,Rows,Cols2> m3 = m1*m2
[all...] |
| qr_colpivoting.cpp | 18 Index rows = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE), cols2 = internal::random<Index>(2,EIGEN_TEST_MAX_SIZE); local
19 Index rank = internal::random<Index>(1, (std::min)(rows, cols)-1);
26 createRandomPIMatrixOfRank(rank,rows,cols,m1);
50 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
52 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
53 Matrix<Scalar,Rows,Cols> m1;
54 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
55 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
58 VERIFY(qr.isInjective() == (rank == Rows));
62 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>()
[all...] |
| triangular.cpp | 22 typename MatrixType::Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 m4(rows, cols),
29 r1(rows, cols),
30 r2(rows, cols);
31 VectorType v2 = VectorType::Random(rows);
36 if (rows*cols>1
130 Index rows = m.rows(); local
[all...] |
| main.h | 311 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m)
315 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
318 typedef Matrix<Scalar, Rows, Rows> MatrixAType;
323 m.setZero(rows,cols);
330 m = VectorType::Random(rows).normalized() * VectorType::Random(cols).normalized().transpose();
334 MatrixAType a = MatrixAType::Random(rows,rows);
335 MatrixType d = MatrixType::Identity(rows,cols);
339 const Index diag_size = (std::min)(d.rows(),d.cols())
[all...] |
| /external/eigen/Eigen/src/Core/ |
| GeneralProduct.h | 45 template<int Rows, int Cols, int Depth> struct product_type_selector;
63 Rows = _Lhs::RowsAtCompileTime,
77 rows_select = product_size_category<Rows,MaxRows>::value,
90 EIGEN_DEBUG_VAR(Rows);
273 const Index rows = dest.rows(); local
274 for (Index i=0; i<rows; ++i)
325 eigen_assert(m_lhs.rows() == dst.rows() && m_rhs.cols() == dst.cols());
441 actualLhs.rows(), actualLhs.cols()
528 const Index rows = prod.rows(); local
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugLine.h | 140 // and is described by line table rows [FirstRowIndex, LastRowIndex).
167 void appendRow(const DWARFDebugLine::Row &state) { Rows.push_back(state); }
173 Rows.clear();
198 RowVector Rows;
234 /// Parse a single line table (prologue and all rows).
|
| /external/eigen/Eigen/src/Geometry/ |
| Transform.h | 185 Rows = int(Mode)==(AffineCompact) ? Dim : HDim
191 typedef typename internal::make_proper_matrix_type<Scalar,Rows,HDim,Options>::type MatrixType;
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 74 static const int Rows = Traits::RowsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
238 const Index rows = m_T.rows(); local
241 for (Index i=0; i<rows; ++i) {
253 for (Index j=i+1; j<rows; ++j) {
288 const Index rows = m_T.rows(); local
293 m_eivalToCluster.resize(rows);
296 for (Index i = 0; i < diag.rows(); ++i)
527 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixFunctionReturnValue
[all...] |
| /external/llvm/utils/TableGen/ |
| RegisterInfoEmitter.cpp | 642 SmallVector<SmallVector<CodeGenSubRegIndex*, 4>, 4> Rows;
646 for (unsigned r = 0, re = Rows.size(); r != re; ++r) {
647 if (combine(SubRegIndices[i], Rows[r])) {
653 Found = Rows.size();
654 Rows.resize(Found + 1);
655 Rows.back().resize(SubRegIndices.size());
656 combine(SubRegIndices[i], Rows.back());
661 // Output the row map if there is multiple rows.
662 if (Rows.size() > 1) {
663 OS << " static const " << getMinimalTypeForRange(Rows.size()
[all...] |
