| /external/eigen/doc/snippets/ |
| Tutorial_commainit_02.cpp | 1 int rows=5, cols=5; variable
2 MatrixXf m(rows,cols);
5 MatrixXf::Zero(rows-3,3),
6 MatrixXf::Identity(rows-3,cols-3);
|
| /external/chromium_org/third_party/WebKit/Source/modules/webdatabase/ |
| SQLResultSet.cpp | 49 // If the query didn't result in any rows being added, raise an InvalidAccessError exception
62 SQLResultSetRowList* SQLResultSet::rows() const function in class:WebCore::SQLResultSet
|
| SQLStatementSync.cpp | 100 SQLResultSetRowList* rows = resultSet->rows(); local
103 rows->addColumn(statement.getColumnName(i));
107 rows->addResult(statement.getColumnValue(i));
|
| SQLStatementBackend.cpp | 166 SQLResultSetRowList* rows = resultSet->rows(); local
169 rows->addColumn(statement.getColumnName(i));
173 rows->addResult(statement.getColumnValue(i));
202 // sqlite3_total_changes() here instead of sqlite3_changed, because that includes rows modified from within a trigger
|
| /external/eigen/doc/ |
| tutorial.cpp | 27 int rows = 3, cols = 3; local
|
| /external/ceres-solver/include/ceres/ |
| crs_matrix.h | 48 // rows, cols and values.
50 // rows is a num_rows + 1 sized array that points into the cols and
53 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the
56 // values[rows[i]] .. values[rows[i + 1] - 1] are the values of the
72 // rows = [ 0, 2, 5, 7]
77 vector<int> rows; member in struct:ceres::CRSMatrix
|
| /external/eigen/bench/ |
| basicbenchmark.h | 43 const int rows = mat.rows(); local
46 MatrixType I(rows,cols);
47 MatrixType m(rows,cols);
|
| sparse_transpose.cpp | 38 int rows = SIZE; local
42 EigenSparseMatrix sm1(rows,cols), sm3(rows,cols);
47 fillMatrix(density, rows, cols, sm1);
52 DenseMatrix m1(rows,cols), m3(rows,cols);
59 std::cout << "Non zeros: " << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
81 GmmDynSparse gmmT3(rows,cols);
82 GmmSparse m1(rows,cols), m3(rows,cols)
[all...] |
| /external/eigen/test/ |
| conservative_resize.cpp | 40 const Index rows = internal::random<Index>(1,50); local
43 m.conservativeResize(rows,cols);
44 VERIFY_IS_APPROX(m, n.block(0,0,rows,cols));
50 const Index rows = internal::random<Index>(50,75); local
53 m.conservativeResizeLike(MatrixType::Zero(rows,cols));
54 VERIFY_IS_APPROX(m.block(0,0,n.rows(),n.cols()), n);
55 VERIFY( rows<=50 || m.block(50,0,rows-50,cols).sum() == Scalar(0) );
56 VERIFY( cols<=50 || m.block(0,50,rows,cols-50).sum() == Scalar(0) );
|
| eigen2support.cpp | 19 Index rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m3(rows, cols);
30 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
31 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
43 VERIFY_IS_EQUAL((m1.col(0).end(1)), (m1.col(0).segment(rows-1,1)));
44 VERIFY_IS_EQUAL((m1.col(0).template end<1>()), (m1.col(0).segment(rows-1,1)));
|
| upperbidiagonalization.cpp | 15 const typename MatrixType::Index rows = m.rows(); local
21 MatrixType a = MatrixType::Random(rows,cols);
23 RealMatrixType b(rows, cols);
|
| bandmatrix.cpp | 19 Index rows = _m.rows(); local
24 MatrixType m(rows,cols,supers,subs);
26 DenseMatrixType dm1(rows,cols);
49 Index d = (std::min)(rows,cols);
51 Index b = std::max<Index>(0,rows-d-subs);
52 if(a>0) dm1.block(0,d+supers,rows,a).setZero();
54 dm1.block(subs+1,0,rows-subs-1-b,rows-subs-1-b).template triangularView<Lower>().setZero();
68 Index rows = internal::random<Index>(1,10) local
[all...] |
| corners.cpp | 19 Index rows = m.rows(); local
22 Index r = internal::random<Index>(1,rows);
25 MatrixType matrix = MatrixType::Random(rows,cols);
26 const MatrixType const_matrix = MatrixType::Random(rows,cols);
30 COMPARE_CORNER(bottomLeftCorner(r,c), block(rows-r,0,r,c));
31 COMPARE_CORNER(bottomRightCorner(r,c), block(rows-r,cols-c,r,c));
33 Index sr = internal::random<Index>(1,rows) - 1;
34 Index nr = internal::random<Index>(1,rows-sr);
40 COMPARE_CORNER(bottomRows(r), block(rows-r,0,r,cols))
52 rows = MatrixType::RowsAtCompileTime, enumerator in enum:__anon20695
[all...] |
| diagonal.cpp | 20 Index rows = m.rows(); local
23 MatrixType m1 = MatrixType::Random(rows, cols),
24 m2 = MatrixType::Random(rows, cols);
31 if (rows>2)
|
| dontalign.cpp | 27 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 SquareMatrixType square = SquareMatrixType::Random(rows,rows);
32 VectorType v = VectorType::Random(rows);
43 Scalar* array = internal::aligned_new<Scalar>(rows);
44 v = VectorType::MapAligned(array, rows);
45 internal::aligned_delete(array, rows);
|
| /external/eigen/test/eigen2/ |
| eigen2_inverse.cpp | 19 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
29 identity = MatrixType::Identity(rows, rows);
31 while(ei_abs(m1.determinant()) < RealScalar(0.1) && rows <= 8)
33 m1 = MatrixType::Random(rows, cols);
|
| eigen2_qr.cpp | 18 int rows = m.rows(); local
25 MatrixType a = MatrixType::Random(rows,cols);
28 VERIFY_IS_NOT_APPROX(a+MatrixType::Identity(rows, cols), qrOfA.matrixQ() * qrOfA.matrixR());
|
| eigen2_linearstructure.cpp | 21 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols),
29 mzero = MatrixType::Zero(rows, cols);
34 int r = ei_random<int>(0, rows-1),
66 VERIFY_IS_APPROX(m1+m1.block(0,0,rows,cols), m1+m1);
67 VERIFY_IS_APPROX(m1.cwise() * m1.block(0,0,rows,cols), m1.cwise() * m1);
68 VERIFY_IS_APPROX(m1 - m1.block(0,0,rows,cols), m1 - m1)
[all...] |
| 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...] |
| eigen2_miscmatrices.cpp | 21 int rows = m.rows(); local
24 int r = ei_random<int>(0, rows-1), r2 = ei_random<int>(0, rows-1), c = ei_random<int>(0, cols-1);
25 VERIFY_IS_APPROX(MatrixType::Ones(rows,cols)(r,c), static_cast<Scalar>(1));
26 MatrixType m1 = MatrixType::Ones(rows,cols);
28 VectorType v1 = VectorType::Random(rows);
34 square = MatrixType::Zero(rows, rows);
35 square.diagonal() = VectorType::Ones(rows);
[all...] |
| /external/ceres-solver/internal/ceres/ |
| incomplete_lq_factorization_test.cc | 48 EXPECT_EQ(expected.rows()[i], actual.rows()[i]);
84 int* rows = matrix.mutable_rows(); local
90 rows[i] = idx;
100 rows[10] = idx;
148 for (int idx = matrix.rows()[1]; idx < matrix.rows()[2]; ++idx) {
149 EXPECT_EQ(matrix.cols()[idx], idx - matrix.rows()[1]);
150 EXPECT_EQ(matrix.values()[idx], dense_vector(idx - matrix.rows()[1]));
159 EXPECT_EQ(matrix.cols()[matrix.rows()[2]], 0)
[all...] |
| /external/chromium/chrome/browser/geolocation/ |
| geolocation_exceptions_table_model_unittest.cc | 65 GeolocationExceptionsTableModel::Rows rows; local
66 rows.insert(0U);
67 EXPECT_TRUE(model_->CanRemoveRows(rows));
76 EXPECT_FALSE(model_->CanRemoveRows(rows));
79 rows.clear();
80 rows.insert(1U);
81 rows.insert(2U);
82 EXPECT_TRUE(model_->CanRemoveRows(rows));
91 GeolocationExceptionsTableModel::Rows rows local
[all...] |
| /external/chromium/chrome/browser/notifications/ |
| notification_exceptions_table_model_unittest.cc | 109 RemoveRowsTableModel::Rows rows; local
110 rows.insert(0); // allowed.com
111 rows.insert(3); // e-allowed2.com
112 model_->RemoveRows(rows);
119 RemoveRowsTableModel::Rows rows; local
120 rows.insert(0);
121 rows.insert(1);
122 rows.insert(2)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
| u_linear.h | 63 unsigned rows; member in struct:pipe_tile_info
94 if (t->tile.size != t->block.size * t->cols * t->rows)
100 if (t->size < t->stride * t->rows * t->tiles_y)
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseSparseProductWithPruning.h | 28 Index rows = lhs.innerSize(); local
34 AmbiVector<Scalar,Index> tempVector(rows);
46 res.resize(cols, rows);
48 res.resize(rows, cols);
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs.cols());
55 //double ratioColRes = (double(rhs.innerVector(j).nonZeros()) + double(lhs.nonZeros())/double(lhs.cols()))/double(lhs.rows());
90 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
104 SparseTemporaryType _res(res.rows(), res.cols());
117 typename remove_all<ResultType>::type _res(res.rows(), res.cols());
136 // SparseTemporaryType _res(res.cols(), res.rows());
[all...] |
