| /external/smack/src/org/jivesoftware/smackx/ |
| ReportedData.java | 34 * in columns and rows.
41 private List<Row> rows = new ArrayList<Row>(); field in class:ReportedData
77 // Add the rows to the report based on the form's items
91 rows.add(new Row(fieldList));
108 rows.add(row);
121 * Returns an Iterator for the rows returned from a search.
123 * @return an Iterator for the rows returned from a search.
126 return Collections.unmodifiableList(new ArrayList<Row>(rows)).iterator();
|
| /external/ceres-solver/internal/ceres/ |
| block_random_access_sparse_matrix.cc | 55 // rows/columns.
81 int* rows = tsm_->mutable_rows(); local
108 rows[pos] = col_layout[row_block_id] + r;
111 DCHECK_LT(rows[pos], tsm_->num_rows());
|
| block_structure.h | 84 vector<CompressedRow> rows; member in struct:ceres::internal::CompressedRowBlockStructure
88 vector<Block> rows; member in struct:ceres::internal::CompressedColumnBlockStructure
|
| /external/chromium_org/chrome/browser/history/ |
| history_notifications.h | 57 URLRows rows; member in struct:history::URLsDeletedDetails
|
| /external/chromium_org/third_party/WebKit/Source/core/html/ |
| HTMLTableSectionElement.cpp | 62 RefPtr<HTMLCollection> children = rows();
84 RefPtr<HTMLCollection> children = rows();
98 int rows = 0; local
102 rows++;
106 return rows;
149 PassRefPtr<HTMLCollection> HTMLTableSectionElement::rows() function in class:WebCore::HTMLTableSectionElement
|
| /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...] |
| Flagged.h | 53 inline Index rows() const { return m_matrix.rows(); } function in class:Eigen::Flagged
|
| ForceAlignedAccess.h | 44 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::ForceAlignedAccess
|
| NestByValue.h | 45 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::NestByValue
|
| ReturnByValue.h | 62 inline Index rows() const { return static_cast<const Derived*>(this)->rows(); } function in class:Eigen::ReturnByValue
|
| Swap.h | 38 inline Index rows() const { return m_expression.rows(); } function in class:Eigen::SwapWrapper
76 eigen_internal_assert(row >= 0 && row < rows()
97 eigen_internal_assert(row >= 0 && row < rows()
|
| /external/eigen/Eigen/src/misc/ |
| Kernel.h | 26 MatrixType::ColsAtCompileTime, // the number of rows in the "kernel matrix"
50 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::kernel_retval_base
75 using Base::rows; \
|
| Solve.h | 44 inline Index rows() const { return m_dec.cols(); } function in struct:Eigen::internal::solve_retval_base
69 using Base::rows; \
|
| /external/eigen/bench/ |
| bench_reverse.cpp | 20 int rows = m.rows(); local
25 MatrixType a = MatrixType::Random(rows,cols);
26 MatrixType b = MatrixType::Random(rows,cols);
31 int r = internal::random<int>(0,rows-1);
50 std::cout << rows << " x " << cols << " \t"
|
| sparse_dense_product.cpp | 54 int rows = SIZE; local
58 EigenSparseMatrix sm1(rows,cols);
65 //fillMatrix(density, rows, cols, sm1);
66 fillMatrix2(7, rows, cols, sm1);
72 DenseMatrix m1(rows,cols);
93 std::cout << "Eigen sparse\t" << sm1.nonZeros()/float(sm1.rows()*sm1.cols())*100 << "%\n";
106 // std::cout << "Eigen dyn-sparse\t" << m1.nonZeros()/float(m1.rows()*m1.cols())*100 << "%\n";
119 //GmmDynSparse gmmT3(rows,cols);
120 GmmSparse m1(rows,cols);
138 UBlasSparse m1(rows,cols)
[all...] |
| spmv.cpp | 28 // mkl_scscmm(&n, lhs.rows(), rhs.cols(), lhs.cols(), &alpha, matdescra,
31 // // mkl_somatcopy('C', 'T', lhs.rows(), lhs.cols(), 1,
32 // // lhs._valuePtr(), lhs.rows(), DST, dst_stride);
40 int rows = size; local
51 rows = atoi(argv[i]+1);
76 std::cout << argv[0] << " r<nb rows> c<nb columns> n<non zeros per column> t<nb tries> p<nb repeats>\n";
80 std::cout << "SpMV " << rows << " x " << cols << " with " << nnzPerCol << " non zeros per column. (" << repeats << " repeats, and " << tries << " tries)\n\n";
82 EigenSparseMatrix sm(rows,cols);
83 DenseVector dv(cols), res(rows);
91 fillMatrix2(nnzPerCol, rows, cols, sm)
[all...] |
| /external/eigen/test/ |
| array_replicate.cpp | 24 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols),
28 m2 = MatrixType::Random(rows, cols);
30 VectorType v1 = VectorType::Random(rows);
38 x1.resize(rows*f1,cols*f2);
41 x1.block(i*rows,j*cols,rows,cols) = m1;
44 x2.resize(2*rows,3*cols);
49 x2.resize(rows,f1)
[all...] |
| array_reverse.cpp | 22 Index rows = m.rows(); local
27 MatrixType m1 = MatrixType::Random(rows, cols);
28 VectorType v1 = VectorType::Random(rows);
32 for ( int i = 0; i < rows; i++ ) {
34 VERIFY_IS_APPROX(m1_r(i, j), m1(rows - 1 - i, cols - 1 - j));
40 for ( int i = 0; i < rows; i++ ) {
42 VERIFY_IS_APPROX(m1_rd(i, j), m1(rows - 1 - i, cols - 1 - j));
48 for ( int i = 0; i < rows; i++ ) {
50 VERIFY_IS_APPROX(m1_rb(i, j), m1(rows - 1 - i, cols - 1 - j))
[all...] |
| 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...] |
| eigensolver_generic.cpp | 21 Index rows = m.rows(); local
30 MatrixType a = MatrixType::Random(rows,cols);
31 MatrixType a1 = MatrixType::Random(rows,cols);
45 VERIFY_IS_APPROX(ei1.eigenvectors().colwise().norm(), RealVectorType::Ones(rows).transpose());
53 MatrixType id = MatrixType::Identity(rows, cols);
56 if (rows > 2)
73 MatrixType a = MatrixType::Random(m.rows(),m.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...] |
| /external/eigen/test/eigen2/ |
| eigen2_array.cpp | 23 int rows = m.rows(); local
26 MatrixType m1 = MatrixType::Random(rows, cols),
27 m2 = MatrixType::Random(rows, cols),
28 m3(rows, cols);
35 VERIFY_IS_APPROX(m1.cwise() + s1, MatrixType::Constant(rows,cols,s1) + m1);
36 VERIFY_IS_APPROX((m1*Scalar(2)).cwise() - s2, (m1+m1) - MatrixType::Constant(rows,cols,s2) );
58 int rows = m.rows(); local
61 int r = ei_random<int>(0, rows-1)
[all...] |
| eigen2_basicstuff.cpp | 17 int rows = m.rows(); local
22 MatrixType m1 = MatrixType::Random(rows, cols),
23 m2 = MatrixType::Random(rows, cols),
24 m3(rows, cols),
25 mzero = MatrixType::Zero(rows, cols),
27 ::Identity(rows, rows),
28 square = Matrix<Scalar, MatrixType::RowsAtCompileTime, MatrixType::RowsAtCompileTime>::Random(rows, rows);
[all...] |
| eigen2_lu.cpp | 17 for(int a = 0; a < 3*(m.rows()+m.cols()); a++)
20 int i = Eigen::ei_random<int>(0,m.rows()-1); // i is a random row number
23 j = Eigen::ei_random<int>(0,m.rows()-1);
41 int rows = ei_random<int>(20,200), cols = ei_random<int>(20,200), cols2 = ei_random<int>(20,200); local
42 int rank = ei_random<int>(1, std::min(rows, cols)-1);
44 MatrixType m1(rows, cols), m2(cols, cols2), m3(rows, cols2), k(1,1);
45 m1 = MatrixType::Random(rows,cols);
46 if(rows <= cols)
47 for(int i = rank; i < rows; i++) m1.row(i).setZero()
[all...] |
| eigen2_nomalloc.cpp | 30 int rows = m.rows(); local
33 MatrixType m1 = MatrixType::Random(rows, cols),
34 m2 = MatrixType::Random(rows, cols),
35 m3(rows, cols),
36 mzero = MatrixType::Zero(rows, cols),
38 ::Identity(rows, rows),
40 ::Random(rows, rows);
[all...] |
