/external/chromium_org/chrome/browser/ |
H A D | remove_rows_table_model.h | 16 typedef std::set<size_t> Rows; typedef in class:RemoveRowsTableModel 19 virtual bool CanRemoveRows(const Rows& rows) const = 0; 22 virtual void RemoveRows(const Rows& rows) = 0;
|
/external/deqp/framework/common/ |
H A D | 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, Col [all...] |
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | 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( [all...] |
/external/chromium_org/chrome/browser/predictors/ |
H A D | autocomplete_action_predictor_table.h | 62 typedef std::vector<Row> Rows; typedef in class:predictors::AutocompleteActionPredictorTable 66 void GetAllRows(Rows* row_buffer); 69 void AddAndUpdateRows(const Rows& rows_to_add, const Rows& rows_to_update);
|
H A D | 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...] |
H A D | 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();
|
H A D | autocomplete_action_predictor.h | 177 const AutocompleteActionPredictorTable::Rows& rows_to_add, 178 const AutocompleteActionPredictorTable::Rows& rows_to_update);
|
/external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
H A D | desktop_region.cc | 50 for (Rows::iterator it = rows_.begin(); it != rows_.end(); ++it) { 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) { 98 Rows::iterator row = rows_.upper_bound(top); 107 row, Rows::value_type(bottom, new Row(top, bottom))); 113 Rows::iterator new_row = rows_.insert( 114 row, Rows::value_type(top, new Row(row->second->top, top))); 123 Rows::iterator new_row = rows_.insert( 124 row, Rows [all...] |
H A D | desktop_region.h | 62 typedef std::map<int, Row*> Rows; typedef in class:webrtc::DesktopRegion 84 Rows::const_iterator row_; 85 Rows::const_iterator previous_row_; 158 void MergeWithPrecedingRow(Rows::iterator row); 160 Rows rows_;
|
/external/eigen/test/ |
H A D | qr_colpivoting.cpp | 48 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; enumerator in enum:__anon21055 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>(); 61 Matrix<Scalar,Rows,Cols> c = qr.householderQ() * r * qr.colsPermutation().inverse(); 65 Matrix<Scalar,Rows,Cols2> m3 = m1*m2;
|
H A D | diagonalmatrices.cpp | 16 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; enumerator in enum:__anon21036 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;
|
H A D | permutationmatrices.cpp | 17 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime, enumerator in enum:__anon21051 19 typedef PermutationMatrix<Rows> LeftPermutationType; 20 typedef Matrix<int, Rows, 1> LeftPermutationVectorType; 42 Matrix<Scalar,Rows,Rows> lm(lp); 58 Matrix<Scalar,Rows,Rows> lm2(lp2);
|
H A D | qr.cpp | 35 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime }; enumerator in enum:__anon21054 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;
|
/external/eigen/Eigen/src/Core/ |
H A D | 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/ |
H A D | 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, Col [all...] |
/external/deqp/modules/gles2/functional/ |
H A D | 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, Col 720 str << "mat" << Cols << "x" << Rows; local [all...] |
/external/eigen/Eigen/src/SparseCore/ |
H A D | 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/ |
H A D | 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> retVa 1339 str << "mat" << Cols << "x" << Rows; local [all...] |
/external/llvm/lib/DebugInfo/ |
H A D | DWARFDebugLine.cpp | 180 if (!Rows.empty()) { 184 for (const Row &R : Rows) { 192 Rows.clear(); 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; 601 // first in our range. Rows are stored in a vector, so we may use 605 RowIter first_row = Rows.begin() + cur_seq.FirstRowIndex; 606 RowIter last_row = Rows.begin() + cur_seq.LastRowIndex; 623 RowIter first_row = Rows [all...] |
H A D | DWARFDebugLine.h | 167 Rows.push_back(R); 198 RowVector Rows; member in struct:llvm::DWARFDebugLine::LineTable
|
/external/chromium_org/third_party/skia/samplecode/ |
H A D | SampleWarp.cpp | 143 const int Rows = 16; local 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; local 188 SkPoint pts[Rows * Cols]; 189 patch.evalPatch(pts, Rows, Cols); 204 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
|
/external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
H A D | MatrixPower.h | 341 template<int Rows, int Cols, int Options, int MaxRows, int MaxCols> 343 Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols>& res, 347 template<int Rows, int Cols, int Options, int MaxRows, int MaxCols> 349 Matrix<RealScalar, Rows, Cols, Options, MaxRows, MaxCols>& res, 427 template<int Rows, int Cols, int Options, int MaxRows, int MaxCols> 429 Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols>& res, 435 template<int Rows, int Cols, int Options, int MaxRows, int MaxCols> 437 Matrix<RealScalar, Rows, Cols, Options, MaxRows, MaxCols>& res,
|
/external/skia/samplecode/ |
H A D | SampleWarp.cpp | 143 const int Rows = 16; local 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; local 188 SkPoint pts[Rows * Cols]; 189 patch.evalPatch(pts, Rows, Cols); 204 SkMeshUtils::Draw(canvas, bm, Rows, Cols, pts, NULL, paint);
|
/external/eigen/Eigen/src/Core/util/ |
H A D | 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/ |
H A D | RegisterInfoEmitter.cpp | 646 SmallVector<SmallVector<CodeGenSubRegIndex*, 4>, 4> Rows; local 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()); 666 if (Rows.size() > 1) { 667 OS << " static const " << getMinimalTypeForRange(Rows.size()) 676 << " Rows[" << Row [all...] |