| /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.
|
| plugin_exceptions_table_model.h | 32 virtual bool CanRemoveRows(const Rows& rows) const;
33 virtual void RemoveRows(const Rows& rows);
|
| plugin_exceptions_table_model.cc | 29 bool PluginExceptionsTableModel::CanRemoveRows(const Rows& rows) const {
30 return !rows.empty();
33 void PluginExceptionsTableModel::RemoveRows(const Rows& rows) {
36 // Iterate over the rows starting with the highest ones so we can delete
38 for (Rows::const_reverse_iterator it = rows.rbegin();
39 it != rows.rend(); ++it) {
|
| plugin_exceptions_table_model_unittest.cc | 165 RemoveRowsTableModel::Rows rows; local
166 rows.insert(1);
167 table_model_->RemoveRows(rows);
179 RemoveRowsTableModel::Rows rows; local
180 rows.insert(0);
181 table_model_->RemoveRows(rows);
197 rows.clear();
198 rows.insert(0)
[all...] |
| /external/chromium/chrome/browser/geolocation/ |
| geolocation_exceptions_table_model.h | 25 // Return whether the given set of rows can be removed. A parent with setting
28 virtual bool CanRemoveRows(const Rows& rows) const;
35 virtual void RemoveRows(const Rows& rows);
|
| geolocation_exceptions_table_model.cc | 78 const Rows& rows) const {
79 for (Rows::const_iterator i(rows.begin()); i != rows.end(); ++i) {
85 if (!rows.count(j))
90 return !rows.empty();
93 void GeolocationExceptionsTableModel::RemoveRows(const Rows& rows) {
94 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i)
[all...] |
| geolocation_exceptions_table_model_unittest.cc | 65 GeolocationExceptionsTableModel::Rows rows; local
66 rows.insert(0U);
67 EXPECT_TRUE(model_->CanRemoveRows(rows));
76 EXPECT_FALSE(model_->CanRemoveRows(rows));
79 rows.clear();
80 rows.insert(1U);
81 rows.insert(2U);
82 EXPECT_TRUE(model_->CanRemoveRows(rows));
91 GeolocationExceptionsTableModel::Rows rows local
[all...] |
| /external/chromium/chrome/browser/notifications/ |
| notification_exceptions_table_model.h | 24 virtual bool CanRemoveRows(const Rows& rows) const;
25 virtual void RemoveRows(const Rows& rows);
|
| notification_exceptions_table_model.cc | 39 const Rows& rows) const {
40 return !rows.empty();
43 void NotificationExceptionsTableModel::RemoveRows(const Rows& rows) {
45 // This is O(n^2) in rows.size(). Since n is small, that's ok.
46 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i) {
|
| notification_exceptions_table_model_unittest.cc | 109 RemoveRowsTableModel::Rows rows; local
110 rows.insert(0); // allowed.com
111 rows.insert(3); // e-allowed2.com
112 model_->RemoveRows(rows);
119 RemoveRowsTableModel::Rows rows; local
120 rows.insert(0);
121 rows.insert(1);
122 rows.insert(2)
[all...] |
| /external/eigen/Eigen/src/Core/ |
| NumTraits.h | 124 template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols>
125 struct NumTraits<Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> >
127 typedef Array<Scalar, Rows, Cols, Options, MaxRows, MaxCols> ArrayType;
129 typedef Array<RealScalar, Rows, Cols, Options, MaxRows, MaxCols> Real;
131 typedef Array<NonIntegerScalar, Rows, Cols, Options, MaxRows, MaxCols> NonInteger;
|
| BandMatrix.h | 50 using Base::rows;
72 Index len = coeffs().rows();
76 len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i)));
78 else if (i>=rows()-subs())
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols())
214 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrix
278 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrixWrapper
[all...] |
| 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/eigen/test/ |
| 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...] |
| 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...] |
| 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/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).
|
| DWARFDebugLine.cpp | 87 if (!Rows.empty()) {
90 for (std::vector<Row>::const_iterator pos = Rows.begin(),
91 end = Rows.end(); pos != end; ++pos)
505 // Search for instruction address in the rows describing the sequence.
506 // Rows are stored in a vector, so we may use arithmetical operations with
510 RowIter first_row = Rows.begin() + found_seq.FirstRowIndex;
511 RowIter last_row = Rows.begin() + found_seq.LastRowIndex;
551 // Add the rows from the first sequence to the vector, starting with the
560 // first in our range. Rows are stored in a vector, so we may use
564 RowIter first_row = Rows.begin() + cur_seq.FirstRowIndex
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseUtil.h | 94 template<typename T,int Rows,int Cols> struct sparse_eval;
107 template<typename T,int Rows> struct sparse_eval<T,Rows,1> {
114 template<typename T,int Rows,int Cols> struct sparse_eval {
|
| /external/eigen/Eigen/src/Core/util/ |
| XprHelper.h | 105 template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols>
215 enum { Rows = traits<T>::RowsAtCompileTime,
221 Rows,
233 enum { Rows = traits<T>::RowsAtCompileTime,
239 Rows,
|
| /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...] |
| /external/chromium/chrome/browser/ui/gtk/ |
| gtk_tree.h | 44 // Writes all the indexes of selected rows into |out|.
95 // Add all model rows corresponding to the given list store indices to |rows|.
97 RemoveRowsTableModel::Rows* model_rows);
105 // Callback checking whether a row may be selected. We use some rows in the
|
