| /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) {
|
| /external/chromium_org/chrome/browser/ |
| remove_rows_table_model.h | 12 // A table model that also supports removing rows. Used for example for the
16 typedef std::set<size_t> Rows;
18 // Returns whether or not the rows can be removed.
19 virtual bool CanRemoveRows(const Rows& rows) const = 0;
21 // Remove the rows from the table.
22 virtual void RemoveRows(const Rows& rows) = 0;
24 // Removes all the rows.
|
| /external/chromium_org/chrome/browser/predictors/ |
| autocomplete_action_predictor_table.h | 62 typedef std::vector<Row> Rows;
66 void GetAllRows(Rows* row_buffer);
69 void AddAndUpdateRows(const Rows& rows_to_add, const Rows& rows_to_update);
|
| autocomplete_action_predictor_table_unittest.cc | 52 AutocompleteActionPredictorTable::Rows test_db_;
114 test_db_, AutocompleteActionPredictorTable::Rows());
131 AutocompleteActionPredictorTable::Rows(1, test_db_[0]),
132 AutocompleteActionPredictorTable::Rows());
143 AutocompleteActionPredictorTable::Rows rows_to_add;
148 AutocompleteActionPredictorTable::Rows());
154 AutocompleteActionPredictorTable::Rows(1, test_db_[2]),
155 AutocompleteActionPredictorTable::Rows(1, row1));
168 AutocompleteActionPredictorTable::Rows rows_to_update;
172 AutocompleteActionPredictorTable::Rows(),
[all...] |
| autocomplete_action_predictor_table.cc | 93 void AutocompleteActionPredictorTable::GetAllRows(Rows* row_buffer) {
117 AddAndUpdateRows(Rows(1, row), Rows());
126 AddAndUpdateRows(Rows(), Rows(1, row));
130 const Rows& rows_to_add,
131 const Rows& rows_to_update) {
138 for (Rows::const_iterator it = rows_to_add.begin();
156 for (Rows::const_iterator it = rows_to_update.begin();
|
| autocomplete_action_predictor.h | 159 // Removes all rows from the database and caches.
162 // Removes rows from the database and caches that contain a URL in |rows|.
163 void DeleteRowsWithURLs(const history::URLRows& rows);
168 // Adds and updates rows in the database and caches.
170 const AutocompleteActionPredictorTable::Rows& rows_to_add,
171 const AutocompleteActionPredictorTable::Rows& rows_to_update);
|
| /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;
|
| /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...] |
| /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/chromium_org/chrome/test/functional/perf/endure_graphs/ |
| endure_plotter.js | 32 function Rows(data) {
33 this.rows = data.split('\n');
34 this.length = this.rows.length;
43 Rows.prototype.get = function(i) {
44 if (!this.rows[i].length) return null;
45 var row = jsonToJs(this.rows[i]);
256 * @param {Rows} dataRows The |Rows| object containing the plot data.
339 var rows = new Rows(data)
[all...] |
| /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 | 646 SmallVector<SmallVector<CodeGenSubRegIndex*, 4>, 4> Rows;
650 for (unsigned r = 0, re = Rows.size(); r != re; ++r) {
651 if (combine(SubRegIndices[i], Rows[r])) {
657 Found = Rows.size();
658 Rows.resize(Found + 1);
659 Rows.back().resize(SubRegIndices.size());
660 combine(SubRegIndices[i], Rows.back());
665 // Output the row map if there is multiple rows.
666 if (Rows.size() > 1) {
667 OS << " static const " << getMinimalTypeForRange(Rows.size()
[all...] |
