| /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/llvm/include/llvm/CodeGen/PBQP/ |
| Math.h | 177 Matrix(unsigned Rows, unsigned Cols) :
178 Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
183 Matrix(unsigned Rows, unsigned Cols, PBQPNum InitVal)
184 : Rows(Rows), Cols(Cols), Data(new PBQPNum[Rows * Cols]) {
185 std::fill(Data, Data + (Rows * Cols), InitVal);
190 : Rows(M.Rows), Cols(M.Cols), Data(new PBQPNum[Rows * Cols])
[all...] |
| /external/deqp/framework/common/ |
| tcuMatrix.hpp | 50 template <typename T, int Rows, int Cols>
54 typedef Vector<T, Rows> Element;
60 ROWS = Rows,
66 explicit Matrix (const T src[Rows*Cols]);
67 Matrix (const Vector<T, Rows>& src);
68 Matrix (const Matrix<T, Rows, Cols>& src);
71 Matrix<T, Rows, Cols>& operator= (const Matrix<T, Rows, Cols>& src);
72 Matrix<T, Rows, Cols>& operator*= (const Matrix<T, Rows, Cols>& src)
[all...] |
| /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_;
113 test_db_, AutocompleteActionPredictorTable::Rows());
130 AutocompleteActionPredictorTable::Rows(1, test_db_[0]),
131 AutocompleteActionPredictorTable::Rows());
142 AutocompleteActionPredictorTable::Rows rows_to_add;
147 AutocompleteActionPredictorTable::Rows());
153 AutocompleteActionPredictorTable::Rows(1, test_db_[2]),
154 AutocompleteActionPredictorTable::Rows(1, row1));
167 AutocompleteActionPredictorTable::Rows rows_to_update;
171 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 | 166 // Removes all rows from the database and caches.
169 // Removes rows from the database and caches that contain a URL in |rows|.
170 void DeleteRowsWithURLs(const history::URLRows& rows);
175 // Adds and updates rows in the database and caches.
177 const AutocompleteActionPredictorTable::Rows& rows_to_add,
178 const AutocompleteActionPredictorTable::Rows& rows_to_update);
|
| autocomplete_action_predictor_unittest.cc | 168 AutocompleteActionPredictorTable::Rows(1, row),
169 AutocompleteActionPredictorTable::Rows());
178 AutocompleteActionPredictorTable::Rows(),
179 AutocompleteActionPredictorTable::Rows(1, row));
186 void DeleteRowsWithURLs(const history::URLRows& rows) {
187 predictor_->DeleteRowsWithURLs(rows);
299 history::URLRows rows; local
301 rows.push_back(history::URLRow(test_url_db[i].url));
303 DeleteRowsWithURLs(rows);
|
| /external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
| desktop_region.cc | 50 for (Rows::iterator it = rows_.begin(); it != rows_.end(); ++it) {
59 // Iterate over rows of the tow regions and compare each row.
60 Rows::const_iterator it1 = rows_.begin();
61 Rows::const_iterator it2 = region.rows_.begin();
77 for (Rows::iterator row = rows_.begin(); row != rows_.end(); ++row) {
93 // we iterate over the rows until it reaches |rect.bottom()|.
96 // Iterate over all rows that may intersect with |rect| and add new rows when
98 Rows::iterator row = rows_.upper_bound(top);
107 row, Rows::value_type(bottom, new Row(top, bottom)))
[all...] |
| desktop_region.h | 25 // Internally each region is stored as a set of rows where each row contains one
59 // Type used to store list of rows in the region. The bottom position of row
60 // is used as the key so that rows are always ordered by their position. The
62 typedef std::map<int, Row*> Rows;
80 // |row_span_| matches spans on consecutive rows then they are also merged
84 Rows::const_iterator row_;
85 Rows::const_iterator previous_row_;
156 // the region). If the rows were merged |row| remains a valid iterator to the
158 void MergeWithPrecedingRow(Rows::iterator row);
160 Rows rows_
[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);
24 createRandomPIMatrixOfRank(rank,rows,cols,m1);
48 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
50 int rank = internal::random<int>(1, (std::min)(int(Rows), int(Cols))-1);
51 Matrix<Scalar,Rows,Cols> m1;
52 createRandomPIMatrixOfRank(rank,Rows,Cols,m1);
53 ColPivHouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
56 VERIFY(qr.isInjective() == (rank == Rows));
60 Matrix<Scalar,Rows,Cols> r = qr.matrixQR().template triangularView<Upper>()
[all...] |
| diagonalmatrices.cpp | 16 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
17 typedef Matrix<Scalar, Rows, 1> VectorType;
19 typedef Matrix<Scalar, Rows, Rows> SquareMatrixType;
20 typedef DiagonalMatrix<Scalar, Rows> LeftDiagonalMatrix;
22 typedef Matrix<Scalar, Rows==Dynamic?Dynamic:2*Rows, Cols==Dynamic?Dynamic:2*Cols> BigMatrix;
23 Index rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols)
[all...] |
| permutationmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime,
19 typedef PermutationMatrix<Rows> LeftPermutationType;
20 typedef Matrix<int, Rows, 1> LeftPermutationVectorType;
26 Index rows = m.rows(); local
29 MatrixType m_original = MatrixType::Random(rows,cols);
31 randomPermutationVector(lv, rows);
38 for (int i=0; i<rows; i++)
42 Matrix<Scalar,Rows,Rows> lm(lp)
[all...] |
| qr.cpp | 17 Index rows = m.rows(); local
23 MatrixType a = MatrixType::Random(rows,cols);
35 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
37 Matrix<Scalar,Rows,Cols> m1 = Matrix<Scalar,Rows,Cols>::Random();
38 HouseholderQR<Matrix<Scalar,Rows,Cols> > qr(m1);
40 Matrix<Scalar,Rows,Cols> r = qr.matrixQR();
42 for(int i = 0; i < Rows; i++) for(int j = 0; j < Cols; j++) if(i>j) r(i,j) = Scalar(0);
47 Matrix<Scalar,Rows,Cols2> m3 = m1*m2
[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/deqp/modules/glshared/ |
| glsBuiltinPrecisionTests.cpp | 471 template <typename T, int Rows, int Cols>
472 struct Traits<Matrix<T, Rows, Cols> > :
473 ContainerTraits<Matrix<T, Rows, Cols>, Matrix<typename Traits<T>::IVal, Rows, Cols> >
900 template <typename T, int Rows, int Cols>
901 class ExprP<Matrix<T, Rows, Cols> > : public ContainerExprPBase<Matrix<T, Rows, Cols> > {};
974 template<int Rows, int Cols>
975 ExprP<Vector<float, Rows> > operator* (const ExprP<Vector<float, Cols> >& left,
976 const ExprP<Matrix<float, Rows, Cols> >& right)
[all...] |
| /external/deqp/modules/gles2/functional/ |
| es2fShaderMatrixTests.cpp | 392 template <typename T, int Rows, int Cols>
393 tcu::Matrix<T, Rows, Cols> matrixCompMult (const tcu::Matrix<T, Rows, Cols>& a, const tcu::Matrix<T, Rows, Cols>& b)
395 tcu::Matrix<T, Rows, Cols> retVal;
397 for (int r = 0; r < Rows; ++r)
406 template <typename T, int Rows, int Cols>
407 tcu::Matrix<T, Rows, Cols> negate (const tcu::Matrix<T, Rows, Cols>& mat)
409 tcu::Matrix<T, Rows, Cols> retVal
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| SparseUtil.h | 95 template<typename T,int Rows,int Cols> struct sparse_eval;
108 template<typename T,int Rows> struct sparse_eval<T,Rows,1> {
115 template<typename T,int Rows,int Cols> struct sparse_eval {
|
| /external/deqp/modules/gles3/functional/ |
| es3fShaderMatrixTests.cpp | 623 template <typename T, int Rows, int Cols>
624 tcu::Matrix<T, Rows, Cols> matrixCompMult (const tcu::Matrix<T, Rows, Cols>& a, const tcu::Matrix<T, Rows, Cols>& b)
626 tcu::Matrix<T, Rows, Cols> retVal;
628 for (int r = 0; r < Rows; ++r)
637 template <typename T, int Rows, int Cols>
638 tcu::Matrix<T, Cols, Rows> transpose (const tcu::Matrix<T, Rows, Cols>& mat)
640 tcu::Matrix<T, Cols, Rows> retVal
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugLine.cpp | 180 if (!Rows.empty()) {
184 for (const Row &R : Rows) {
192 Rows.clear();
548 // Search for instruction address in the rows describing the sequence.
549 // Rows are stored in a vector, so we may use arithmetical operations with
553 RowIter first_row = Rows.begin() + found_seq.FirstRowIndex;
554 RowIter last_row = Rows.begin() + found_seq.LastRowIndex;
592 // Add the rows from the first sequence to the vector, starting with the
601 // first in our range. Rows are stored in a vector, so we may use
605 RowIter first_row = Rows.begin() + cur_seq.FirstRowIndex
[all...] |
| DWARFDebugLine.h | 142 // and is described by line table rows [FirstRowIndex, LastRowIndex).
167 Rows.push_back(R);
189 /// Parse prologue and all rows.
198 RowVector Rows;
|
| /external/chromium_org/third_party/skia/samplecode/ |
| SampleWarp.cpp | 143 const int Rows = 16;
145 SkPoint pts[Rows * Cols];
146 patch.evalPatch(pts, Rows, Cols);
157 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
186 const int Rows = 16;
188 SkPoint pts[Rows * Cols];
189 patch.evalPatch(pts, Rows, Cols);
204 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
216 void init(const SkRect& bounds, int rows, int cols,
221 int rows() const { return fRows; function in class:Mesh
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixPower.h | 31 Index rows() const { return m_pow.rows(); } function in class:Eigen::MatrixPowerRetval
74 { eigen_assert(T.rows() == T.cols()); }
80 switch (m_A.rows()) {
100 res = (MatrixType::Identity(IminusT.rows(), IminusT.cols()) + res).template triangularView<Upper>()
103 res += MatrixType::Identity(IminusT.rows(), IminusT.cols());
159 IminusT = MatrixType::Identity(m_A.rows(), m_A.cols()) - T;
298 { eigen_assert(A.rows() == A.cols()); }
320 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixPower
482 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixPowerReturnValue
[all...] |
| /external/eigen/Eigen/src/Core/util/ |
| XprHelper.h | 127 template<typename Scalar, int Rows, int Cols, int Options, int MaxRows, int MaxCols>
237 enum { Rows = traits<T>::RowsAtCompileTime,
243 Rows,
255 enum { Rows = traits<T>::RowsAtCompileTime,
261 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...] |
