Home
last modified time | relevance | path

Searched refs:Rows (Results 1 – 25 of 79) sorted by relevance

1234

/external/chromium_org/chrome/browser/predictors/
Dautocomplete_action_predictor_table_unittest.cc52 AutocompleteActionPredictorTable::Rows test_db_;
114 test_db_, AutocompleteActionPredictorTable::Rows()); in AddAll()
131 AutocompleteActionPredictorTable::Rows(1, test_db_[0]), in TestGetRow()
132 AutocompleteActionPredictorTable::Rows()); in TestGetRow()
143 AutocompleteActionPredictorTable::Rows rows_to_add; in TestAddAndUpdateRows()
148 AutocompleteActionPredictorTable::Rows()); in TestAddAndUpdateRows()
154 AutocompleteActionPredictorTable::Rows(1, test_db_[2]), in TestAddAndUpdateRows()
155 AutocompleteActionPredictorTable::Rows(1, row1)); in TestAddAndUpdateRows()
168 AutocompleteActionPredictorTable::Rows rows_to_update; in TestAddAndUpdateRows()
172 AutocompleteActionPredictorTable::Rows(), in TestAddAndUpdateRows()
Dautocomplete_action_predictor_table.cc93 void AutocompleteActionPredictorTable::GetAllRows(Rows* row_buffer) { in GetAllRows()
117 AddAndUpdateRows(Rows(1, row), Rows()); in AddRow()
126 AddAndUpdateRows(Rows(), Rows(1, row)); in UpdateRow()
130 const Rows& rows_to_add, in AddAndUpdateRows()
131 const Rows& rows_to_update) { in AddAndUpdateRows()
138 for (Rows::const_iterator it = rows_to_add.begin(); in AddAndUpdateRows()
156 for (Rows::const_iterator it = rows_to_update.begin(); in AddAndUpdateRows()
Dautocomplete_action_predictor_table.h62 typedef std::vector<Row> Rows; typedef
66 void GetAllRows(Rows* row_buffer);
69 void AddAndUpdateRows(const Rows& rows_to_add, const Rows& rows_to_update);
Dautocomplete_action_predictor.h170 const AutocompleteActionPredictorTable::Rows& rows_to_add,
171 const AutocompleteActionPredictorTable::Rows& rows_to_update);
/external/eigen/test/
Dqr_colpivoting.cpp50 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; in qr_fixedsize() enumerator
52 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1); in qr_fixedsize()
53 Matrix<Scalar,Rows,Cols> m1; in qr_fixedsize()
54 createRandomPIMatrixOfRank(rank,Rows,Cols,m1); in qr_fixedsize()
55 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1); in qr_fixedsize()
58 VERIFY(qr.isInjective() == (rank == Rows)); in qr_fixedsize()
62 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>(); in qr_fixedsize()
63 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse(); in qr_fixedsize()
67 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; in qr_fixedsize()
Dqr.cpp36 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; in qr_fixedsize() enumerator
38 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random(); in qr_fixedsize()
39 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1); in qr_fixedsize()
41 Matrix<Scalar,Rows,Cols> r = qr.matrixQR(); in qr_fixedsize()
43 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0); in qr_fixedsize()
48 Matrix<Scalar,Rows,Cols2> m3 = m1*m2; in qr_fixedsize()
Dpermutationmatrices.cpp18 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime, in permutationmatrices() enumerator
20 typedef PermutationMatrix<Rows> LeftPermutationType; in permutationmatrices()
21 typedef Matrix<int, Rows, 1> LeftPermutationVectorType; in permutationmatrices()
43 Matrix<Scalar,Rows,Rows> lm(lp); in permutationmatrices()
59 Matrix<Scalar,Rows,Rows> lm2(lp2); in permutationmatrices()
Ddiagonalmatrices.cpp17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; in diagonalmatrices() enumerator
18 typedef Matrix<Scalar, Rows, 1> VectorType; in diagonalmatrices()
20 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType; in diagonalmatrices()
21 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix; in diagonalmatrices()
23 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix; in diagonalmatrices()
Dtriangular.cpp125 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; in triangular_rect() enumerator
126 typedef Matrix<Scalar, Rows, 1> VectorType; in triangular_rect()
127 typedef Matrix<Scalar, Rows, Rows> RMatrixType; in triangular_rect()
/external/chromium_org/chrome/browser/
Dremove_rows_table_model.h16 typedef std::set<size_t> Rows; typedef
19 virtual bool CanRemoveRows(const Rows& rows) const = 0;
22 virtual void RemoveRows(const Rows& rows) = 0;
/external/chromium/chrome/browser/
Dremove_rows_table_model.h17 typedef std::set<size_t> Rows; typedef
20 virtual bool CanRemoveRows(const Rows& rows) const = 0;
23 virtual void RemoveRows(const Rows& rows) = 0;
Dplugin_exceptions_table_model.h32 virtual bool CanRemoveRows(const Rows& rows) const;
33 virtual void RemoveRows(const Rows& rows);
Dplugin_exceptions_table_model.cc29 bool PluginExceptionsTableModel::CanRemoveRows(const Rows& rows) const { in CanRemoveRows()
33 void PluginExceptionsTableModel::RemoveRows(const Rows& rows) { in RemoveRows()
38 for (Rows::const_reverse_iterator it = rows.rbegin(); in RemoveRows()
/external/eigen/Eigen/src/Core/
DNumTraits.h124 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/llvm/lib/DebugInfo/
DDWARFDebugLine.cpp87 if (!Rows.empty()) { in dump()
90 for (std::vector<Row>::const_iterator pos = Rows.begin(), in dump()
91 end = Rows.end(); pos != end; ++pos) in dump()
510 RowIter first_row = Rows.begin() + found_seq.FirstRowIndex; in lookupAddress()
511 RowIter last_row = Rows.begin() + found_seq.LastRowIndex; in lookupAddress()
564 RowIter first_row = Rows.begin() + cur_seq.FirstRowIndex; in lookupAddressRange()
565 RowIter last_row = Rows.begin() + cur_seq.LastRowIndex; in lookupAddressRange()
582 RowIter first_row = Rows.begin() + cur_seq.FirstRowIndex; in lookupAddressRange()
583 RowIter last_row = Rows.begin() + cur_seq.LastRowIndex; in lookupAddressRange()
DDWARFDebugLine.h167 void appendRow(const DWARFDebugLine::Row &state) { Rows.push_back(state); } in appendRow()
173 Rows.clear(); in clear()
198 RowVector Rows; member
/external/chromium/chrome/browser/geolocation/
Dgeolocation_exceptions_table_model.h28 virtual bool CanRemoveRows(const Rows& rows) const;
35 virtual void RemoveRows(const Rows& rows);
Dgeolocation_exceptions_table_model.cc78 const Rows& rows) const { in CanRemoveRows()
79 for (Rows::const_iterator i(rows.begin()); i != rows.end(); ++i) { in CanRemoveRows()
93 void GeolocationExceptionsTableModel::RemoveRows(const Rows& rows) { in RemoveRows()
94 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i) { in RemoveRows()
/external/chromium/chrome/browser/notifications/
Dnotification_exceptions_table_model.h24 virtual bool CanRemoveRows(const Rows& rows) const;
25 virtual void RemoveRows(const Rows& rows);
Dnotification_exceptions_table_model.cc39 const Rows& rows) const { in CanRemoveRows()
43 void NotificationExceptionsTableModel::RemoveRows(const Rows& rows) { in RemoveRows()
46 for (Rows::const_reverse_iterator i(rows.rbegin()); i != rows.rend(); ++i) { in RemoveRows()
Dnotification_exceptions_table_model_unittest.cc109 RemoveRowsTableModel::Rows rows; in TEST_F()
119 RemoveRowsTableModel::Rows rows; in TEST_F()
/external/chromium_org/chrome/test/functional/perf/endure_graphs/
Dendure_plotter.js32 function Rows(data) { class
43 Rows.prototype.get = function(i) {
339 var rows = new Rows(data);
473 graphDataOtherRows = new Rows(data);
486 eventRows = new Rows(data);
/external/eigen/Eigen/src/SparseCore/
DSparseUtil.h94 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/llvm/utils/TableGen/
DRegisterInfoEmitter.cpp646 SmallVector<SmallVector<CodeGenSubRegIndex*, 4>, 4> Rows; in emitComposeSubRegIndices() local
650 for (unsigned r = 0, re = Rows.size(); r != re; ++r) { in emitComposeSubRegIndices()
651 if (combine(SubRegIndices[i], Rows[r])) { in emitComposeSubRegIndices()
657 Found = Rows.size(); in emitComposeSubRegIndices()
658 Rows.resize(Found + 1); in emitComposeSubRegIndices()
659 Rows.back().resize(SubRegIndices.size()); in emitComposeSubRegIndices()
660 combine(SubRegIndices[i], Rows.back()); in emitComposeSubRegIndices()
666 if (Rows.size() > 1) { in emitComposeSubRegIndices()
667 OS << " static const " << getMinimalTypeForRange(Rows.size()) in emitComposeSubRegIndices()
676 << " Rows[" << Rows.size() << "][" << SubRegIndices.size() << "] = {\n"; in emitComposeSubRegIndices()
[all …]
/external/eigen/Eigen/src/Core/util/
DXprHelper.h105 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,

1234