/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/apache-harmony/sql/src/test/java/org/apache/harmony/sql/tests/javax/sql/ |
H A D | Impl_RowSet.java | 587 public boolean relative(int rows) throws SQLException { argument 606 public void setFetchSize(int rows) throws SQLException { argument
|
/external/ceres-solver/include/ceres/ |
H A D | crs_matrix.h | 49 // rows, cols and values. 51 // rows is a num_rows + 1 sized array that points into the cols and 54 // cols[rows[i]] ... cols[rows[i + 1] - 1] are the indices of the 57 // values[rows[i]] .. values[rows[i + 1] - 1] are the values of the 73 // rows = [ 0, 2, 5, 7] 78 vector<int> rows; member in struct:ceres::CRSMatrix
|
/external/ceres-solver/internal/ceres/ |
H A D | autodiff_test.cc | 40 T &RowMajorAccess(T *base, int rows, int cols, int i, int j) { argument
|
H A D | block_random_access_diagonal_matrix.cc | 51 // rows/columns. 67 int* rows = tsm_->mutable_rows(); local 78 rows[pos] = block_begin + r;
|
H A D | 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());
|
H A D | block_structure.h | 82 vector<CompressedRow> rows; member in struct:ceres::internal::CompressedRowBlockStructure 86 vector<Block> rows; member in struct:ceres::internal::CompressedColumnBlockStructure
|
H A D | compressed_col_sparse_matrix_utils.h | 71 const IntegerType* rows, 78 const IntegerType r = rows[idx]; 92 const IntegerType* rows, 98 const IntegerType r = rows[idx]; 118 const IntegerType* rows, 128 const IntegerType r = rows[idx]; 136 SolveUpperTriangularInPlace(num_cols, rows, cols, values, solution); 70 SolveUpperTriangularInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 91 SolveUpperTriangularTransposeInPlace(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, double* rhs_and_solution) argument 117 SolveRTRWithSparseRHS(IntegerType num_cols, const IntegerType* rows, const IntegerType* cols, const double* values, const int rhs_nonzero_index, double* solution) argument
|
H A D | compressed_col_sparse_matrix_utils_test.cc | 91 int* rows, 106 rows[offset] = row_pos + r; 134 int* rows = tsm.mutable_rows(); local 142 rows + offset, cols + offset); 200 rows.resize(7); 204 rows[0] = 0; 208 rows[1] = 1; 212 rows[2] = 1; 214 rows[3] = 2; 218 rows[ 87 FillBlock(const vector<int>& row_blocks, const vector<int>& col_blocks, const int row_block_id, const int col_block_id, int* rows, int* cols) argument 229 vector<int> rows; member in class:ceres::internal::SolveUpperTriangularTest [all...] |
H A D | compressed_row_jacobian_writer.cc | 114 int* rows = jacobian->mutable_rows(); local 117 rows[0] = 0; 146 rows[row_pos + j + 1] = rows[row_pos + j] + num_derivatives; 161 const int column_block_begin = rows[row_pos + r] + col_pos; 171 CHECK_EQ(num_jacobian_nonzeros, rows[total_num_residuals]); 186 const int* jacobian_rows = jacobian->rows();
|
H A D | compressed_row_sparse_matrix.cc | 47 // duplicates in the pair of arrays rows and cols, i.e., there is no 50 // rows[i] == rows[j] && cols[i] == cols[j] 54 RowColLessThan(const int* rows, const int* cols) argument 55 : rows(rows), cols(cols) { 59 if (rows[x] == rows[y]) { 62 return (rows[x] < rows[ 65 const int* rows; member in struct:ceres::internal::__anon1759::RowColLessThan 329 int* rows = matrix->mutable_rows(); local [all...] |
H A D | compressed_row_sparse_matrix.h | 62 // as the rows and cols matrices do not match the values of 74 // Build a square sparse diagonal matrix with num_rows rows and 109 const int* rows() const { return &rows_[0]; } function in class:ceres::internal::CompressedRowSparseMatrix 144 // Since the entries of the program are the same for rows with the
|
H A D | compressed_row_sparse_matrix_test.cc | 223 EXPECT_EQ(crsm->num_rows() + 1, crs_matrix.rows.size()); 228 EXPECT_EQ(crsm->rows()[i], crs_matrix.rows[i]); 283 int* rows = matrix_->mutable_rows(); local 287 rows[0] = 0; 291 rows[1] = 1; 295 rows[2] = 2; 301 rows[3] = 4; 309 rows[4] = 7; 350 int* rows local 437 vector<int> rows; local [all...] |
H A D | covariance_impl.cc | 139 const int* rows = covariance_matrix_->rows(); local 141 const int row_size = rows[row_begin + 1] - rows[row_begin]; 142 const int* cols_begin = cols + rows[row_begin]; 171 ConstMatrixRef cov(covariance_matrix_->values() + rows[row_begin], 266 // Compute the number of rows. Map each parameter block to the 322 int* rows = covariance_matrix_->mutable_rows(); local 325 // Iterate over parameter blocks and in turn over the rows of the 329 // set of compressed rows correspondin 509 const int* rows = covariance_matrix_->rows(); local 641 const int* rows = covariance_matrix_->rows(); local 693 const int* rows = covariance_matrix_->rows(); local [all...] |
H A D | covariance_test.cc | 107 const int* rows = crsm->rows(); local 109 EXPECT_EQ(rows[r], expected_rows[r]) 111 << rows[r] << " " 352 << "rows: " << row_begin << " " << row_end << " "
|
H A D | 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() [all...] |
H A D | dynamic_compressed_row_sparse_matrix_test.cc | 52 // should have no effect on the number of rows, columns or nonzeros. 85 std::vector<int> rows, cols; local 90 rows.push_back(r); 100 std::copy(rows.begin(), rows.end(), tsm->mutable_rows()); 133 EXPECT_EQ(dense_from_dcrsm.rows(), num_rows); 147 ConstIntVectorRef crsm_rows(crsm->rows(), crsm->num_rows() + 1); 148 ConstIntVectorRef dcrsm_rows(dcrsm->rows(), dcrsm->num_rows() + 1);
|
H A D | incomplete_lq_factorization.cc | 46 const int row_begin = matrix->rows()[row]; 47 const int row_end = matrix->rows()[row + 1]; 69 const int* a_rows = a.rows(); 73 const int* b_rows = b.rows(); 119 int* rows = matrix->mutable_rows(); local 122 int num_nonzeros = rows[matrix->num_rows()]; 126 rows[matrix->num_rows()] = num_nonzeros; 160 rows[matrix->num_rows()] = num_nonzeros; 172 const int* rows = matrix.rows(); local [all...] |
H A D | 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()[ [all...] |
H A D | linear_least_squares_problems.cc | 192 int* rows = A->mutable_rows(); local 200 rows[nnz] = 0; 204 rows[nnz] = 0; 211 rows[nnz] = 1; 215 rows[nnz] = 1; 222 rows[nnz] = 2; 226 rows[nnz] = 2; 233 rows[nnz] = 3; 237 rows[nnz] = 3; 244 rows[nn [all...] |
H A D | program.cc | 392 int* rows = tsm->mutable_rows(); local 411 rows = tsm->mutable_rows(); 417 rows[num_nonzeros] = r;
|
H A D | program_test.cc | 272 int* rows = expected_block_sparse_jacobian.mutable_rows(); local 275 rows[0] = 0; 278 rows[1] = 2; 280 rows[2] = 0; 283 rows[3] = 2; 285 rows[4] = 1; 288 rows[5] = 2; 290 rows[6] = 1; 293 rows[7] = 0; 295 rows[ 369 int* rows = expected_block_sparse_jacobian.mutable_rows(); local [all...] |
H A D | triplet_sparse_matrix.h | 83 // the same number of rows as num_rows_; 91 const int* rows() const { return rows_.get(); } function in class:ceres::internal::TripletSparseMatrix
|
/external/chromium_org/chrome/browser/extensions/api/braille_display_private/ |
H A D | brlapi_connection.cc | 171 unsigned int columns, rows; local 173 handle_.get(), &columns, &rows) < 0) { 177 *size = columns * rows;
|
/external/chromium_org/chrome/browser/history/android/ |
H A D | android_provider_backend.cc | 316 // rows have the same URL. 467 // Get the bookmarked rows. 649 SearchTerms rows; 650 if (!GetSelectedSearchTerms(selection, selection_args, &rows)) 653 *deleted_count = rows.size(); 654 if (rows.empty()) 657 for (SearchTerms::const_iterator i = rows.begin(); i != rows.end(); ++i) 660 // We don't delete the rows in search_terms table, as once the 888 TableIDRows* rows) { 885 GetSelectedURLs( const std::string& selection, const std::vector<base::string16>& selection_args, TableIDRows* rows) argument 915 GetSelectedSearchTerms( const std::string& selection, const std::vector<base::string16>& selection_args, SearchTerms* rows) argument [all...] |