| /external/chromium_org/chrome/browser/ui/cocoa/ |
| D | table_row_nsimage_cache_unittest.mm | 16 std::vector<SkBitmap>* rows() {
48 std::vector<SkBitmap>* rows = table.rows();
49 rows->push_back(MakeImage(10, 10));
50 rows->push_back(MakeImage(20, 20));
51 rows->push_back(MakeImage(30, 30));
58 COMPARE_SK_NS_IMG_SIZES(rows->at(0), image0);
59 COMPARE_SK_NS_IMG_SIZES(rows->at(1), image1);
60 COMPARE_SK_NS_IMG_SIZES(rows->at(2), image2);
62 rows->clear();
64 rows->push_back(MakeImage(15, 15));
[all …]
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| D | table_row_nsimage_cache_unittest.mm | 15 std::vector<SkBitmap>* rows() {
47 std::vector<SkBitmap>* rows = table.rows();
48 rows->push_back(MakeImage(10, 10));
49 rows->push_back(MakeImage(20, 20));
50 rows->push_back(MakeImage(30, 30));
57 COMPARE_SK_NS_IMG_SIZES(rows->at(0), image0);
58 COMPARE_SK_NS_IMG_SIZES(rows->at(1), image1);
59 COMPARE_SK_NS_IMG_SIZES(rows->at(2), image2);
61 rows->clear();
63 rows->push_back(MakeImage(15, 15));
[all …]
|
| /external/eigen/test/ |
| D | sparse_basic.cpp | 17 const Index rows = ref.rows(); in sparse_basic() local
22 double density = (std::max)(8./(rows*cols), 0.01); in sparse_basic()
27 SparseMatrixType m(rows, cols); in sparse_basic()
28 DenseMatrix refMat = DenseMatrix::Zero(rows, cols); in sparse_basic()
29 DenseVector vec1 = DenseVector::Random(rows); in sparse_basic()
95 DenseMatrix m1(rows,cols); in sparse_basic()
97 SparseMatrixType m2(rows,cols); in sparse_basic()
102 for (int k=0; k<rows/2; ++k) in sparse_basic()
104 int i = internal::random<int>(0,rows-1); in sparse_basic()
115 DenseMatrix m1(rows,cols); in sparse_basic()
[all …]
|
| D | sparse_product.cpp | 25 int r = internal::random(0,m2.rows()-1); in run()
40 const Index rows = internal::random<int>(1,n); in sparse_product() local
46 double density = (std::max)(8./(rows*cols), 0.01); in sparse_product()
55 DenseMatrix refMat2 = DenseMatrix::Zero(rows, depth); in sparse_product()
56 DenseMatrix refMat2t = DenseMatrix::Zero(depth, rows); in sparse_product()
59 DenseMatrix refMat4 = DenseMatrix::Zero(rows, cols); in sparse_product()
60 DenseMatrix refMat4t = DenseMatrix::Zero(cols, rows); in sparse_product()
62 DenseMatrix refMat6 = DenseMatrix::Random(rows, rows); in sparse_product()
63 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows); in sparse_product()
65 SparseMatrixType m2 (rows, depth); in sparse_product()
[all …]
|
| D | array_reverse.cpp | 22 Index rows = m.rows(); in reverse() local
27 MatrixType m1 = MatrixType::Random(rows, cols); in reverse()
28 VectorType v1 = VectorType::Random(rows); in reverse()
32 for ( int i = 0; i < rows; i++ ) { in reverse()
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j)); in reverse()
40 for ( int i = 0; i < rows; i++ ) { in reverse()
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j)); in reverse()
48 for ( int i = 0; i < rows; i++ ) { in reverse()
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j)); in reverse()
56 for ( int i = 0; i < rows; i++ ) { in reverse()
[all …]
|
| D | corners.cpp | 19 Index rows = m.rows(); in corners() local
22 Index r = internal::random<Index>(1,rows); in corners()
25 MatrixType matrix = MatrixType::Random(rows,cols); in corners()
26 const MatrixType const_matrix = MatrixType::Random(rows,cols); in corners()
30 COMPARE_CORNER(bottomLeftCorner(r,c), block(rows-r,0,r,c)); in corners()
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c)); in corners()
33 Index sr = internal::random<Index>(1,rows) - 1; in corners()
34 Index nr = internal::random<Index>(1,rows-sr); in corners()
40 COMPARE_CORNER(bottomRows(r), block(rows-r,0,r,cols)); in corners()
41 COMPARE_CORNER(leftCols(c), block(0,0,rows,c)); in corners()
[all …]
|
| D | array.cpp | 20 Index rows = m.rows(); in array() local
23 ArrayType m1 = ArrayType::Random(rows, cols), in array()
24 m2 = ArrayType::Random(rows, cols), in array()
25 m3(rows, cols); in array()
27 ColVectorType cv1 = ColVectorType::Random(rows); in array()
35 VERIFY_IS_APPROX(m1 + s1, ArrayType::Constant(rows,cols,s1) + m1); in array()
37 VERIFY_IS_APPROX(m1 - s1, m1 - ArrayType::Constant(rows,cols,s1)); in array()
38 VERIFY_IS_APPROX(s1 - m1, ArrayType::Constant(rows,cols,s1) - m1); in array()
39 VERIFY_IS_APPROX((m1*Scalar(2)) - s2, (m1+m1) - ArrayType::Constant(rows,cols,s2) ); in array()
49 …ArrayType::Map(m1.data(), m1.rows(), m1.cols()) -= ArrayType::Map(m2.data(), m2.rows(), m2.cols()); in array()
[all …]
|
| D | householder.cpp | 21 Index rows = m.rows(); in householder() local
36 …E_MAX(MatrixType::RowsAtCompileTime,MatrixType::ColsAtCompileTime), 1> _tmp((std::max)(rows,cols)); in householder()
43 VectorType v1 = VectorType::Random(rows), v2; in householder()
48 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(v1.tail(rows-1).norm(), v1.norm()); in householder()
49 v1 = VectorType::Random(rows); in householder()
54 MatrixType m1(rows, cols), in householder()
55 m2(rows, cols); in householder()
57 v1 = VectorType::Random(rows); in householder()
58 if(even) v1.tail(rows-1).setZero(); in householder()
64 if(rows>=2) VERIFY_IS_MUCH_SMALLER_THAN(m1.block(1,0,rows-1,cols).norm(), m1.norm()); in householder()
[all …]
|
| D | mapstaticmethods.cpp | 72 int rows = m.rows(), cols = m.cols(); in run() local
76 PlainObjectType::Map(ptr, rows, cols).setZero(); in run()
77 PlainObjectType::MapAligned(ptr, rows, cols).setZero(); in run()
78 PlainObjectType::Map(const_ptr, rows, cols).sum(); in run()
79 PlainObjectType::MapAligned(const_ptr, rows, cols).sum(); in run()
81 PlainObjectType::Map(ptr, rows, cols, InnerStride<>(i)).setZero(); in run()
82 PlainObjectType::MapAligned(ptr, rows, cols, InnerStride<>(i)).setZero(); in run()
83 PlainObjectType::Map(const_ptr, rows, cols, InnerStride<>(i)).sum(); in run()
84 PlainObjectType::MapAligned(const_ptr, rows, cols, InnerStride<>(i)).sum(); in run()
86 PlainObjectType::Map(ptr, rows, cols, InnerStride<2>()).setZero(); in run()
[all …]
|
| /external/eigen/test/eigen2/ |
| D | eigen2_sparse_product.cpp | 14 const int rows = ref.rows(); in sparse_product() local
19 double density = std::max(8./(rows*cols), 0.01); in sparse_product()
25 DenseMatrix refMat2 = DenseMatrix::Zero(rows, rows); in sparse_product()
26 DenseMatrix refMat3 = DenseMatrix::Zero(rows, rows); in sparse_product()
27 DenseMatrix refMat4 = DenseMatrix::Zero(rows, rows); in sparse_product()
28 DenseMatrix dm4 = DenseMatrix::Zero(rows, rows); in sparse_product()
29 SparseMatrixType m2(rows, rows); in sparse_product()
30 SparseMatrixType m3(rows, rows); in sparse_product()
31 SparseMatrixType m4(rows, rows); in sparse_product()
58 DenseMatrix refM2 = DenseMatrix::Zero(rows, rows); in sparse_product()
[all …]
|
| D | eigen2_sparse_basic.cpp | 48 const int rows = ref.rows(); in sparse_basic() local
53 double density = std::max(8./(rows*cols), 0.01); in sparse_basic()
58 SparseMatrixType m(rows, cols); in sparse_basic()
59 DenseMatrix refMat = DenseMatrix::Zero(rows, cols); in sparse_basic()
60 DenseVector vec1 = DenseVector::Random(rows); in sparse_basic()
167 DenseMatrix m1(rows,cols); in sparse_basic()
169 SparseMatrixType m2(rows,cols); in sparse_basic()
173 for (int k=0; k<rows/2; ++k) in sparse_basic()
175 int i = ei_random<int>(0,rows-1); in sparse_basic()
202 DenseMatrix refM1 = DenseMatrix::Zero(rows, rows); in sparse_basic()
[all …]
|
| D | eigen2_basicstuff.cpp | 17 int rows = m.rows(); in basicStuff() local
22 MatrixType m1 = MatrixType::Random(rows, cols), in basicStuff()
23 m2 = MatrixType::Random(rows, cols), in basicStuff()
24 m3(rows, cols), in basicStuff()
25 mzero = MatrixType::Zero(rows, cols), in basicStuff()
27 ::Identity(rows, rows), in basicStuff()
28 …= Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows); in basicStuff()
29 VectorType v1 = VectorType::Random(rows), in basicStuff()
30 v2 = VectorType::Random(rows), in basicStuff()
31 vzero = VectorType::Zero(rows); in basicStuff()
[all …]
|
| D | eigen2_nomalloc.cpp | 30 int rows = m.rows(); in nomalloc() local
33 MatrixType m1 = MatrixType::Random(rows, cols), in nomalloc()
34 m2 = MatrixType::Random(rows, cols), in nomalloc()
35 m3(rows, cols), in nomalloc()
36 mzero = MatrixType::Zero(rows, cols), in nomalloc()
38 ::Identity(rows, rows), in nomalloc()
40 ::Random(rows, rows); in nomalloc()
41 VectorType v1 = VectorType::Random(rows), in nomalloc()
42 v2 = VectorType::Random(rows), in nomalloc()
43 vzero = VectorType::Zero(rows); in nomalloc()
[all …]
|
| D | eigen2_svd.cpp | 18 int rows = m.rows(); in svd() local
23 MatrixType a = MatrixType::Random(rows,cols); in svd()
25 Matrix<Scalar, MatrixType::RowsAtCompileTime, 1>::Random(rows,1); in svd()
34 MatrixType sigma = MatrixType::Zero(rows,cols); in svd()
35 MatrixType matU = MatrixType::Zero(rows,rows); in svd()
37 matU.block(0,0,rows,cols) = svd.matrixU(); in svd()
42 if (rows==cols) in svd()
46 MatrixType a1 = MatrixType::Random(rows,cols); in svd()
55 if(rows==cols) in svd()
60 …VERIFY_IS_APPROX(unitary * unitary.adjoint(), MatrixType::Identity(unitary.rows(),unitary.rows())); in svd()
[all …]
|
| D | eigen2_submatrices.cpp | 21 int rows = m1.rows(); in CheckMinor() local
25 VERIFY_IS_APPROX(mi, m1.block(1,1,rows-1,cols-1)); in CheckMinor()
48 int rows = m.rows(); in submatrices() local
51 MatrixType m1 = MatrixType::Random(rows, cols), in submatrices()
52 m2 = MatrixType::Random(rows, cols), in submatrices()
53 m3(rows, cols), in submatrices()
54 mzero = MatrixType::Zero(rows, cols), in submatrices()
55 ones = MatrixType::Ones(rows, cols), in submatrices()
57 ::Identity(rows, rows), in submatrices()
59 ::Random(rows, rows); in submatrices()
[all …]
|
| D | product.h | 36 int rows = m.rows(); in product() local
41 MatrixType m1 = MatrixType::Random(rows, cols), in product()
42 m2 = MatrixType::Random(rows, cols), in product()
43 m3(rows, cols), in product()
44 mzero = MatrixType::Zero(rows, cols); in product()
46 identity = RowSquareMatrixType::Identity(rows, rows), in product()
47 square = RowSquareMatrixType::Random(rows, rows), in product()
48 res = RowSquareMatrixType::Random(rows, rows); in product()
52 RowVectorType v1 = RowVectorType::Random(rows), in product()
53 v2 = RowVectorType::Random(rows), in product()
[all …]
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Math.h | 116 Matrix(unsigned rows, unsigned cols) : in Matrix() argument
117 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix()
122 Matrix(unsigned rows, unsigned cols, PBQPNum initVal) : in Matrix() argument
123 rows(rows), cols(cols), data(new PBQPNum[rows * cols]) { in Matrix()
124 std::fill(data, data + (rows * cols), initVal); in Matrix()
129 rows(m.rows), cols(m.cols), data(new PBQPNum[rows * cols]) { in Matrix()
130 std::copy(m.data, m.data + (rows * cols), data); in Matrix()
139 rows = m.rows; cols = m.cols;
140 data = new PBQPNum[rows * cols];
141 std::copy(m.data, m.data + (rows * cols), data);
[all …]
|
| /external/eigen/unsupported/Eigen/src/MatrixFunctions/ |
| D | MatrixLogarithm.h | 85 MatrixType result(A.rows(), A.rows()); in compute()
86 if (A.rows() == 1) in compute()
88 else if (A.rows() == 2) in compute()
151 …RealScalar normTminusI = (T - MatrixType::Identity(T.rows(), T.rows())).cwiseAbs().colwise().sum()… in computeBig()
250 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows()); in computePade3()
251 result.setZero(T.rows(), T.rows()); in computePade3()
253 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI) in computePade3()
266 MatrixType TminusI = T - MatrixType::Identity(T.rows(), T.rows()); in computePade4()
267 result.setZero(T.rows(), T.rows()); in computePade4()
269 result += weights[k] * (MatrixType::Identity(T.rows(), T.rows()) + nodes[k] * TminusI) in computePade4()
[all …]
|
| /external/ceres-solver/internal/ceres/ |
| D | incomplete_lq_factorization_test.cc | 48 EXPECT_EQ(expected.rows()[i], actual.rows()[i]); in ExpectMatricesAreEqual()
84 int* rows = matrix.mutable_rows(); in TEST() local
90 rows[i] = idx; in TEST()
100 rows[10] = idx; in TEST()
148 for (int idx = matrix.rows()[1]; idx < matrix.rows()[2]; ++idx) { in TEST()
149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]); in TEST()
150 EXPECT_EQ(matrix.values()[idx], dense_vector(idx - matrix.rows()[1])); in TEST()
159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0); in TEST()
160 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 1], 3); in TEST()
161 EXPECT_EQ(matrix.cols()[matrix.rows()[2] + 2], 5); in TEST()
[all …]
|
| D | block_sparse_matrix.cc | 63 for (int i = 0; i < block_structure_->rows.size(); ++i) { in BlockSparseMatrix()
64 int row_block_size = block_structure_->rows[i].block.size; in BlockSparseMatrix()
67 const vector<Cell>& cells = block_structure_->rows[i].cells; in BlockSparseMatrix()
92 for (int i = 0; i < block_structure_->rows.size(); ++i) { in RightMultiply()
93 int row_block_pos = block_structure_->rows[i].block.position; in RightMultiply()
94 int row_block_size = block_structure_->rows[i].block.size; in RightMultiply()
95 const vector<Cell>& cells = block_structure_->rows[i].cells; in RightMultiply()
112 for (int i = 0; i < block_structure_->rows.size(); ++i) { in LeftMultiply()
113 int row_block_pos = block_structure_->rows[i].block.position; in LeftMultiply()
114 int row_block_size = block_structure_->rows[i].block.size; in LeftMultiply()
[all …]
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| D | eqp.test | 41 0 0 1 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~10 rows)}
42 0 0 1 {SEARCH TABLE t1 USING INDEX i2 (b=?) (~10 rows)}
43 0 1 0 {SCAN TABLE t2 (~1000000 rows)}
48 0 0 0 {SCAN TABLE t2 (~1000000 rows)}
49 0 1 1 {SEARCH TABLE t1 USING INDEX i1 (a=?) (~10 rows)}
50 0 1 1 {SEARCH TABLE t1 USING INDEX i2 (b=?) (~10 rows)}
55 0 0 0 {SCAN TABLE t1 USING COVERING INDEX i1 (~1000000 rows)}
60 0 0 0 {SCAN TABLE t1 (~1000000 rows)}
66 0 0 0 {SEARCH TABLE t1 USING COVERING INDEX i1 (a=?) (~10 rows)}
71 0 0 0 {SCAN TABLE t3 (~1000000 rows)}
[all …]
|
| /external/chromium-trace/trace-viewer/src/tracing/analysis/ |
| D | analyze_slices_test.js | 112 assertEquals(3, table.rows.length);
114 assertEquals('b', table.rows[0].text);
115 assertEquals(0, table.rows[1].time);
116 assertAlmostEquals(0.002, table.rows[2].time);
127 assertEquals(4, table.rows.length);
129 assertEquals('b', table.rows[0].text);
130 assertEquals('foo', table.rows[1].text);
131 assertEquals(0, table.rows[2].time);
132 assertAlmostEquals(0.002, table.rows[3].time);
143 assertEquals(6, table.rows.length);
[all …]
|
| /external/eigen/Eigen/src/Core/ |
| D | PlainObjectBase.h | 25 EIGEN_ALWAYS_INLINE void check_rows_cols_for_overflow(Index rows, Index cols) in check_rows_cols_for_overflow() argument
30 bool error = (rows < 0 || cols < 0) ? true in check_rows_cols_for_overflow()
31 : (rows == 0 || cols == 0) ? false in check_rows_cols_for_overflow()
32 : (rows > max_index / cols); in check_rows_cols_for_overflow()
119 EIGEN_STRONG_INLINE Index rows() const { return m_storage.rows(); }
127 return m_storage.data()[row + col * m_storage.rows()];
140 return m_storage.data()[row + col * m_storage.rows()];
153 return m_storage.data()[row + col * m_storage.rows()];
168 : row + col * m_storage.rows()));
185 : row + col * m_storage.rows()), x);
[all …]
|
| /external/eigen/bench/ |
| D | sparse_product.cpp | 100 int rows = SIZE; in main() local
104 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols), sm3(rows,cols), sm4(rows,cols); in main()
111 fillMatrix2(nnzPerCol, rows, cols, sm1); in main()
112 fillMatrix2(nnzPerCol, rows, cols, sm2); in main()
119 DenseMatrix m1(rows,cols), m2(rows,cols), m3(rows,cols); in main()
155 …std::cout << "Eigen sparse\t" << sm1.nonZeros()/(float(sm1.rows())*float(sm1.cols()))*100 << "% * " in main()
156 << sm2.nonZeros()/(float(sm2.rows())*float(sm2.cols()))*100 << "%\n"; in main()
254 UBlasSparse m1(rows,cols), m2(rows,cols), m3(rows,cols); in main()
267 GmmDynSparse gmmT3(rows,cols); in main()
268 GmmSparse m1(rows,cols), m2(rows,cols), m3(rows,cols); in main()
[all …]
|
| /external/eigen/Eigen/src/QR/ |
| D | FullPivHouseholderQR.h | 93 FullPivHouseholderQR(Index rows, Index cols)
94 : m_qr(rows, cols),
95 m_hCoeffs((std::min)(rows,cols)),
96 m_rows_transpositions(rows),
99 m_temp((std::min)(rows,cols)),
104 : m_qr(matrix.rows(), matrix.cols()),
105 m_hCoeffs((std::min)(matrix.rows(), matrix.cols())),
106 m_rows_transpositions(matrix.rows()),
109 m_temp((std::min)(matrix.rows(), matrix.cols())),
247 return rank() == rows();
[all …]
|