| /external/jmonkeyengine/engine/src/test/jme3test/texture/ |
| TestTexture3DLoading.java | 40 int rows = 4;//4 * 4 local
42 q.scaleTextureCoordinates(new Vector2f(rows, rows));
46 material.setInt("Rows", rows);
|
| /external/eigen/test/ |
| 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
130 Index rows = m.rows(); local
[all...] |
| 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...] |
| cwiseop.cpp | 38 Index rows = m.rows(); local
41 MatrixType m1 = MatrixType::Random(rows, cols),
42 m2 = MatrixType::Random(rows, cols),
43 m3(rows, cols),
44 m4(rows, cols),
45 mzero = MatrixType::Zero(rows, cols),
46 mones = MatrixType::Ones(rows, cols),
48 ::Identity(rows, rows);
[all...] |
| 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)));
|
| swap.cpp | 31 typename MatrixType::Index rows = m.rows(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
|
| eigensolver_complex.cpp | 17 by checking that the k-th power sums are equal for k = 1, ..., vec1.rows() */
25 VERIFY(vec1.rows() == vec2.rows());
26 for (int k = 1; k <= vec1.rows(); ++k)
39 Index rows = m.rows(); local
48 MatrixType a = MatrixType::Random(rows,cols);
67 MatrixType z = MatrixType::Zero(rows,cols);
71 MatrixType id = MatrixType::Identity(rows, cols);
74 if (rows > 1
[all...] |
| product_extra.cpp | 22 Index rows = m.rows(); local
25 MatrixType m1 = MatrixType::Random(rows, cols),
26 m2 = MatrixType::Random(rows, cols),
27 m3(rows, cols),
28 mzero = MatrixType::Zero(rows, cols),
29 identity = MatrixType::Identity(rows, rows),
30 square = MatrixType::Random(rows, rows),
[all...] |
| /external/eigen/bench/ |
| benchEigenSolver.cpp | 36 int rows = m.rows(); local
39 int stdRepeats = std::max(1,int((REPEAT*1000)/(rows*rows*sqrt(rows))));
45 MatrixType a = MatrixType::Random(rows,cols);
51 int r = internal::random<int>(0,covMat.rows()-1);
85 std::cout << covMat.rows() << " \t"
95 gmm::dense_matrix<Scalar> gmmCovMat(covMat.rows(),covMat.cols());
96 gmm::dense_matrix<Scalar> eigvect(covMat.rows(),covMat.cols())
[all...] |
| benchCholesky.cpp | 31 int rows = m.rows(); local
35 for (int j=0; j<rows; ++j)
37 int r = std::max(rows - j -1,0);
41 int repeats = (REPEAT*1000)/(rows*rows);
46 MatrixType a = MatrixType::Random(rows,cols);
52 int r = internal::random<int>(0,covMat.rows()-1);
80 std::cout << covMat.rows() << " \t"
92 gsl_matrix* gslCovMat = gsl_matrix_alloc(covMat.rows(),covMat.cols())
[all...] |
| sparse_randomsetter.cpp | 47 int rows = sm1.rows(); local
54 (*set1)(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
67 int rows = SIZE; local
71 EigenSparseMatrix sm1(rows,cols), sm2(rows,cols);
74 nentries = rows*cols*density;
81 dummy = internal::random<int>(0,rows-1) + internal::random<int>(0,cols-1);
97 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1;
106 // set1(internal::random<int>(0,rows-1),internal::random<int>(0,cols-1)) += 1
[all...] |
| /external/chromium_org/tools/page_cycler/database/select-readtransactions-read-results/ |
| index.html | 14 for (var i = 0; i < data.rows.length; i++) {
15 resultId = data.rows.item(i).ID;
16 resultString = data.rows.item(i).Foo;
|
| /external/eigen/doc/examples/ |
| Tutorial_simple_example_dynamic_size.cpp | 12 for (int i=0; i<m.rows(); ++i) // loop over rows
13 m(i,j) = i+j*m.rows(); // to access matrix coefficients,
|
| tut_matrix_resize.cpp | 11 << m.rows() << "x" << m.cols() << std::endl;
17 << v.rows() << "x" << v.cols() << std::endl;
|
| /external/eigen/test/eigen2/ |
| eigen2_cholesky.cpp | 24 int rows = m.rows(); local
32 MatrixType a0 = MatrixType::Random(rows,cols);
33 VectorType vecB = VectorType::Random(rows), vecX(rows);
34 MatrixType matB = MatrixType::Random(rows,cols), matX(rows,cols);
37 MatrixType a1 = MatrixType::Random(rows,cols);
52 VectorType vecX(rows), _vecX, _vecB;
91 if (rows>4
[all...] |
| eigen2_swap.cpp | 31 int rows = m.rows(); local
35 MatrixType m1 = MatrixType::Random(rows,cols);
36 MatrixType m2 = MatrixType::Random(rows,cols) + Scalar(100) * MatrixType::Identity(rows,cols);
37 OtherMatrixType m3 = OtherMatrixType::Random(rows,cols) + Scalar(200) * OtherMatrixType::Identity(rows,cols);
58 m1.swap(m2.block(0,0,rows,cols));
|
| 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...] |
| /external/chromium_org/ui/keyboard/resources/ |
| constants.js | 18 * The number of rows in each keyset.
21 // TODO(bshe): The number of rows should equal to the number of kb-row elements
|
| /external/chromium_org/ui/keyboard/resources/webui/ |
| constants.js | 19 * The number of rows in each keyset.
22 // TODO(bshe): The number of rows should equal to the number of kb-row elements
|
| /external/chromium_org/ui/views/controls/table/ |
| table_grouper.h | 15 // TableGrouper is used by TableView to group a set of rows and treat them
16 // as one. Rows that fall in the same group are selected together and sorted
|
| /external/eigen/Eigen/src/Core/ |
| DenseStorage.h | 94 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
110 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
138 inline DenseStorage(DenseIndex, DenseIndex rows, DenseIndex cols) : m_rows(rows), m_cols(cols) {}
141 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
143 inline void conservativeResize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; }
144 inline void resize(DenseIndex, DenseIndex rows, DenseIndex cols) { m_rows = rows; m_cols = cols; }
158 inline DenseStorage(DenseIndex, DenseIndex rows, DenseIndex) : m_rows(rows) {
160 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
179 inline DenseIndex rows(void) const {return _Rows;} function in class:Eigen::DenseStorage
203 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
241 static inline DenseIndex rows(void) {return _Rows;} function in class:Eigen::DenseStorage
277 inline DenseIndex rows(void) const {return m_rows;} function in class:Eigen::DenseStorage
[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/ceres-solver/internal/ceres/ |
| dense_sparse_matrix.cc | 68 const int *rows = m.rows(); local
73 m_(rows[i], cols[i]) += values[i];
112 m_.resize(m_.rows() + m_.cols(), m_.cols());
114 m_.block(0, 0, tmp.rows(), tmp.cols()) = tmp;
131 return m_.rows() - m_.cols();
133 return m_.rows();
142 return (m_.rows() - m_.cols()) * m_.cols();
144 return m_.rows() * m_.cols();
151 ? m_.rows() - m_.cols(
[all...] |
| block_sparse_matrix.cc | 61 // Count the number of non-zero entries and the number of rows in
63 for (int i = 0; i < block_structure_->rows.size(); ++i) {
64 int row_block_size = block_structure_->rows[i].block.size;
67 const vector<Cell>& cells = block_structure_->rows[i].cells;
92 for (int i = 0; i < block_structure_->rows.size(); ++i) {
93 int row_block_pos = block_structure_->rows[i].block.position;
94 int row_block_size = block_structure_->rows[i].block.size;
95 const vector<Cell>& cells = block_structure_->rows[i].cells;
112 for (int i = 0; i < block_structure_->rows.size(); ++i) {
113 int row_block_pos = block_structure_->rows[i].block.position
[all...] |
| /external/chromium/chrome/browser/ui/cocoa/ |
| table_model_array_controller.mm | 17 - (void)setModelRows:(RemoveRowsTableModel::Rows*)modelRows
18 fromControllerRows:(NSIndexSet*)rows;
115 - (void)setModelRows:(RemoveRowsTableModel::Rows*)modelRows
116 fromControllerRows:(NSIndexSet*)rows {
117 if ([rows count] == 0)
121 for (NSUInteger i = [rows firstIndex];
123 i = [rows indexGreaterThanIndex:i]) {
130 for (NSUInteger i = [rows firstIndex];
132 i = [rows indexGreaterThanIndex:i]) {
155 NSMutableArray* rows = [NSMutableArray arrayWithCapacity:range.length]
[all...] |
