| /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);
|
| /external/chromium_org/third_party/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
| SkPdfCcittfaxdecodeFilterDictionary_autogen.cpp | 59 int64_t SkPdfCcittfaxdecodeFilterDictionary::Rows(SkPdfNativeDoc* doc) {
60 SkPdfNativeObject* ret = get("Rows", "");
68 return get("Rows", "") != NULL;
|
| /external/skia/experimental/PdfViewer/pdfparser/native/pdfapi/ |
| SkPdfCcittfaxdecodeFilterDictionary_autogen.cpp | 59 int64_t SkPdfCcittfaxdecodeFilterDictionary::Rows(SkPdfNativeDoc* doc) {
60 SkPdfNativeObject* ret = get("Rows", "");
68 return get("Rows", "") != NULL;
|
| /external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
| 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/ |
| 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...] |
| 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...] |
| 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
127 Index rows = m.rows(); local
[all...] |
| main.h | 327 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m);
329 void createRandomPIMatrixOfRank(typename MatrixType::Index desired_rank, typename MatrixType::Index rows, typename MatrixType::Index cols, MatrixType& m)
333 enum { Rows = MatrixType::RowsAtCompileTime, Cols = MatrixType::ColsAtCompileTime };
336 typedef Matrix<Scalar, Rows, Rows> MatrixAType;
341 m.setZero(rows,cols);
348 m = VectorType::Random(rows).normalized() * VectorType::Random(cols).normalized().transpose();
352 MatrixAType a = MatrixAType::Random(rows,rows);
353 MatrixType d = MatrixType::Identity(rows,cols)
[all...] |
| /external/chromium_org/media/base/ |
| video_frame.cc | 652 // Align Y rows at least at 16 byte boundaries. The stride for both
654 // U and V applies to two rows of Y (one byte of UV for 4 bytes of Y), so in
660 // applies to a full two rows of Y. YV12A is the same as YV12, but with an
819 size_t VideoFrame::Rows(size_t plane, VideoFrame::Format format, int height) {
880 int VideoFrame::rows(size_t plane) const { function in class:media::VideoFrame
881 return Rows(plane, format_, coded_size_.height());
925 for (int row = 0; row < rows(plane); ++row) {
|
| /external/eigen/unsupported/Eigen/src/KroneckerProduct/ |
| KroneckerTensorProduct.h | 46 inline Index rows() const { return m_A.rows() * m_B.rows(); } function in class:Eigen::KroneckerProduct
51 return m_A.coeff(row / m_B.rows(), col / m_B.cols()) *
52 m_B.coeff(row % m_B.rows(), col % m_B.cols());
94 inline Index rows() const { return m_A.rows() * m_B.rows(); } function in class:Eigen::KroneckerProductSparse
116 const Index Br = m_B.rows(),
118 for (Index i=0; i < m_A.rows(); ++i
[all...] |
| /external/llvm/lib/DebugInfo/ |
| 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;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| d3dx9effect.h | 48 UINT Rows;
|
| d3d10shader.h | 151 UINT Rows;
|
| d3d11shader.h | 95 UINT 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/pdfium/core/src/fpdfapi/fpdf_parser/ |
| fpdf_parser_decode.cpp | 201 FX_BOOL Rows = 0;
208 Rows = pParams->GetInteger(FX_BSTRC("Rows"));
209 if (Rows > USHRT_MAX) {
210 Rows = 0;
212 if (Columns <= 0 || Rows < 0 || Columns > USHRT_MAX || Rows > USHRT_MAX) {
217 K, EndOfLine, ByteAlign, BlackIs1, Columns, Rows);
|
| /external/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...] |
| /hardware/intel/img/psb_video/src/mrst/ |
| lnc_hostcode.c | [all...] |
| /external/eigen/Eigen/src/Core/ |
| 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);
244 const Index rows = dest.rows(); local
245 for (Index i=0; i<rows; ++i)
347 eigen_assert(m_lhs.rows() == dst.rows() && m_rhs.cols() == dst.cols());
463 actualLhs.rows(), actualLhs.cols()
550 const Index rows = prod.rows(); local
[all...] |
| /external/eigen/Eigen/src/Geometry/ |
| Transform.h | 185 Rows = int(Mode)==(AffineCompact) ? Dim : HDim
191 typedef typename internal::make_proper_matrix_type<Scalar,Rows,HDim,Options>::type MatrixType;
[all...] |
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| MatrixFunction.h | 74 static const int Rows = Traits::RowsAtCompileTime;
81 typedef Matrix<ComplexScalar, Rows, Cols, Options, MaxRows, MaxCols> ComplexMatrix;
239 const Index rows = m_T.rows(); local
242 for (Index i=0; i<rows; ++i) {
254 for (Index j=i+1; j<rows; ++j) {
289 const Index rows = m_T.rows(); local
294 m_eivalToCluster.resize(rows);
297 for (Index i = 0; i < diag.rows(); ++i)
528 Index rows() const { return m_A.rows(); } function in class:Eigen::MatrixFunctionReturnValue
[all...] |
| /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...] |
