| /external/chromium_org/third_party/WebKit/PerformanceTests/Layout/ |
| floats_100_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_20_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_20_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_2_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_2_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_50_100.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| floats_50_100_nested.html | 4 <title>Floats layout performance tester with 2 columns and 100 rows</title>
|
| /external/chromium_org/third_party/skia/src/utils/ |
| SkBoundaryPatch.cpp | 46 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) {
47 if (rows < 2 || cols < 2) {
51 const SkScalar invR = SkScalarInvert(SkIntToScalar(rows - 1));
56 for (int x = 0; x < rows; x++) {
|
| /external/eigen/test/ |
| selfadjoint.cpp | 21 Index rows = m.rows(); local
24 MatrixType m1 = MatrixType::Random(rows, cols),
25 m3(rows, cols);
|
| map.cpp | 52 Index rows = m.rows(), cols = m.cols(), size = rows*cols; local
62 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
63 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>(array1, rows, cols);
64 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
65 MatrixType ma1 = Map<MatrixType>(array1, rows, cols)
[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);
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...] |
| /external/skia/src/utils/ |
| SkBoundaryPatch.cpp | 46 bool SkBoundaryPatch::evalPatch(SkPoint verts[], int rows, int cols) {
47 if (rows < 2 || cols < 2) {
51 const SkScalar invR = SkScalarInvert(SkIntToScalar(rows - 1));
56 for (int x = 0; x < rows; x++) {
|
| /cts/tools/signature-tools/templates/ |
| PackageOverviewPage.st | 22 $Table(name="Removed Classes and Interfaces", rows=removed_classes:{$it.from:{<tt>$it.name$</tt>}$}:SimpleTableRow())$
28 $Table(name="Added Classes and Interfaces", rows=added_classes:{$it.to:ClassReferenceLink()$}:SimpleTableRow())$
33 $Table(name="Changed Classes and Interfaces", rows=changed_classes:{$it.to:ClassChangedLink()$}:SimpleTableRow())$
|
| /external/chromium/chrome/browser/ |
| plugin_exceptions_table_model_unittest.cc | 165 RemoveRowsTableModel::Rows rows; local
166 rows.insert(1);
167 table_model_->RemoveRows(rows);
179 RemoveRowsTableModel::Rows rows; local
180 rows.insert(0);
181 table_model_->RemoveRows(rows);
197 rows.clear();
198 rows.insert(0)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/glsl/tests/ |
| copy_constant_to_storage_tests.cpp | 40 void int_test(unsigned rows);
41 void uint_test(unsigned rows);
42 void bool_test(unsigned rows);
44 void float_test(unsigned columns, unsigned rows);
67 copy_constant_to_storage::int_test(unsigned rows)
70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val);
86 copy_constant_to_storage::uint_test(unsigned rows)
89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val);
105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows)
108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, val)
[all...] |
| /external/eigen/Eigen/src/plugins/ |
| BlockMethods.h | 25 /** \internal expression type of a block of whole rows */
31 /** \internal expression type of a block of whole rows */
42 * \param blockRows the number of rows in the block
70 * \param cRows the number of rows in the corner
91 * The template parameters CRows and CCols are the number of rows and columns in the corner.
116 * \param cRows the number of rows in the corner
137 * The template parameters CRows and CCols are the number of rows and columns in the corner.
161 * \param cRows the number of rows in the corner
171 return Block<Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols);
177 return Block<const Derived>(derived(), rows() - cRows, cols() - cCols, cRows, cCols)
[all...] |
| /external/eigen/test/eigen2/ |
| eigen2_map.cpp | 42 int rows = m.rows(), cols = m.cols(), size = rows*cols; local
52 Map<MatrixType, Aligned>(array1, rows, cols) = MatrixType::Ones(rows,cols);
53 Map<MatrixType>(array2, rows, cols) = Map<MatrixType>((const Scalar*)array1, rows, cols); // test non-const-correctness support in eigen2
54 Map<MatrixType>(array3unaligned, rows, cols) = Map<MatrixType>(array1, rows, cols);
55 MatrixType ma1 = Map<MatrixType>(array1, rows, cols)
[all...] |
| gsl_helper.h | 28 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_alloc(rows,cols); }
63 static Matrix createMatrix(int rows, int cols) { return gsl_matrix_complex_alloc(rows,cols); }
100 res = gsl_matrix_alloc(m.rows(), m.cols());
101 for (int i=0 ; i<m.rows() ; ++i)
110 for (int i=0 ; i<res.rows() ; ++i)
128 for (int i=0 ; i<res.rows() ; ++i)
135 res = gsl_matrix_complex_alloc(m.rows(), m.cols());
136 for (int i=0 ; i<m.rows() ; ++i
[all...] |
| /external/mesa3d/src/glsl/tests/ |
| copy_constant_to_storage_tests.cpp | 40 void int_test(unsigned rows);
41 void uint_test(unsigned rows);
42 void bool_test(unsigned rows);
44 void float_test(unsigned columns, unsigned rows);
67 copy_constant_to_storage::int_test(unsigned rows)
70 generate_data(mem_ctx, GLSL_TYPE_INT, 1, rows, val);
86 copy_constant_to_storage::uint_test(unsigned rows)
89 generate_data(mem_ctx, GLSL_TYPE_UINT, 1, rows, val);
105 copy_constant_to_storage::float_test(unsigned columns, unsigned rows)
108 generate_data(mem_ctx, GLSL_TYPE_FLOAT, columns, rows, val)
[all...] |
| /external/chromium_org/media/base/ |
| video_util.cc | 34 void CopyPlane(size_t plane, const uint8* source, int stride, int rows,
43 int rows_to_copy = std::min(frame->rows(plane), rows);
53 void CopyYPlane(const uint8* source, int stride, int rows, VideoFrame* frame) {
54 CopyPlane(VideoFrame::kYPlane, source, stride, rows, frame);
57 void CopyUPlane(const uint8* source, int stride, int rows, VideoFrame* frame) {
58 CopyPlane(VideoFrame::kUPlane, source, stride, rows, frame);
61 void CopyVPlane(const uint8* source, int stride, int rows, VideoFrame* frame) {
62 CopyPlane(VideoFrame::kVPlane, source, stride, rows, frame);
65 void CopyAPlane(const uint8* source, int stride, int rows, VideoFrame* frame)
104 const int rows = frame->rows(plane); local
[all...] |
| /external/eigen/Eigen/src/SparseCore/ |
| ConservativeSparseSparseProduct.h | 24 Index rows = lhs.innerSize(); local
28 std::vector<bool> mask(rows,false);
29 Matrix<Scalar,Dynamic,1> values(rows);
30 Matrix<Index,Dynamic,1> indices(rows);
79 int t200 = rows/(log2(200)*1.39);
80 int t = (rows*100)/139;
103 for(int i=0; i<rows; ++i)
139 ColMajorMatrix resCol(lhs.rows(),rhs.cols());
154 RowMajorMatrix resRow(lhs.rows(), rhs.cols());
167 RowMajorMatrix resRow(lhs.rows(), rhs.cols())
[all...] |
| /external/eigen/Eigen/src/Core/ |
| BandMatrix.h | 50 using Base::rows;
72 Index len = coeffs().rows();
76 len = (std::min)(rows(),std::max<Index>(0,coeffs().rows() - (supers()-i)));
78 else if (i>=rows()-subs())
79 len = std::max<Index>(0,coeffs().rows() - (i + 1 - rows() + subs()));
85 { return Block<CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
89 { return Block<const CoefficientsType,1,SizeAtCompileTime>(coeffs(),supers(),0,1,(std::min)(rows(),cols())); }
136 dst.resize(rows(),cols())
214 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrix
278 inline Index rows() const { return m_rows.value(); } function in class:Eigen::internal::BandMatrixWrapper
[all...] |
| /external/eigen/Eigen/src/LU/ |
| PartialPivLU.h | 119 * b.rows()==A.rows(), where A is the matrix of which *this is the LU decomposition.
150 (*this, MatrixType::Identity(m_lu.rows(), m_lu.cols()));
170 inline Index rows() const { return m_lu.rows(); } function in class:Eigen::PartialPivLU
203 : m_lu(matrix.rows(), matrix.rows()),
204 m_p(matrix.rows()),
205 m_rowsTranspositions(matrix.rows()),
241 const Index rows = lu.rows() local
[all...] |
| /external/ceres-solver/internal/ceres/ |
| normal_prior.cc | 44 CHECK_GT(b_.rows(), 0);
45 CHECK_GT(A_.rows(), 0);
46 CHECK_EQ(b_.rows(), A.cols());
47 set_num_residuals(A_.rows());
48 mutable_parameter_block_sizes()->push_back(b_.rows());
|
| /external/eigen/Eigen/src/misc/ |
| Image.h | 27 // dimension is the number of rows of the original matrix
31 MatrixType::MaxColsAtCompileTime // so it has the same number of rows and at most as many columns.
49 inline Index rows() const { return m_dec.rows(); } function in struct:Eigen::internal::image_retval_base
77 using Base::rows; \
|
