HomeSort by relevance Sort by last modified time
    Searched refs:row_block_id (Results 1 - 10 of 10) sorted by null

  /external/ceres-solver/internal/ceres/
block_random_access_dense_matrix.cc 66 CellInfo* BlockRandomAccessDenseMatrix::GetCell(const int row_block_id,
72 *row = block_layout_[row_block_id];
76 return &cell_infos_[row_block_id * block_layout_.size() + col_block_id];
block_random_access_crs_matrix.cc 96 const int row_block_id = it->first; local
97 const int row_block_size = blocks_[row_block_id];
99 while ((it != block_pairs.end()) && (it->first == row_block_id)) {
128 row_strides_[row_block_id] = num_cols;
144 CellInfo* BlockRandomAccessCRSMatrix::GetCell(int row_block_id,
151 layout_.find(IntPairToLong(row_block_id, col_block_id));
158 *row_stride = blocks_[row_block_id];
159 *col_stride = row_strides_[row_block_id];
block_random_access_matrix.h 74 // CellInfo* cell = A->GetCell(row_block_id, col_block_id,
103 // If the cell (row_block_id, col_block_id) is present, then return
112 virtual CellInfo* GetCell(int row_block_id,
block_random_access_sparse_matrix.cc 100 const int row_block_id = it->first; local
102 const int row_block_size = blocks_[row_block_id];
105 layout_[IntPairToLong(row_block_id, col_block_id)]->values - values;
108 rows[pos] = col_layout[row_block_id] + r;
128 CellInfo* BlockRandomAccessSparseMatrix::GetCell(int row_block_id,
135 layout_.find(IntPairToLong(row_block_id, col_block_id));
143 *row_stride = blocks_[row_block_id];
block_random_access_sparse_matrix_test.cc 69 const int row_block_id = it->first; local
75 CellInfo* cell = m.GetCell(row_block_id, col_block_id,
81 EXPECT_EQ(row_stride, blocks[row_block_id]);
86 row, col, blocks[row_block_id], blocks[col_block_id]) =
87 (row_block_id + 1) * (col_block_id +1) *
88 Matrix::Ones(blocks[row_block_id], blocks[col_block_id]);
block_random_access_dense_matrix.h 51 // GetCell never returns NULL for any (row_block_id, col_block_id)
66 virtual CellInfo* GetCell(int row_block_id,
block_random_access_crs_matrix_test.cc 69 const int row_block_id = it->first; local
75 CellInfo* cell = m.GetCell(row_block_id, col_block_id,
84 row, col, blocks[row_block_id], blocks[col_block_id]) =
85 (row_block_id + 1) * (col_block_id +1) *
86 Matrix::Ones(blocks[row_block_id], blocks[col_block_id]);
block_random_access_crs_matrix.h 55 // <row_block_id, col_block_id> pairs to identify the non-zero cells
65 virtual CellInfo* GetCell(int row_block_id,
95 // A mapping from <row_block_id, col_block_id> to the position in
block_random_access_sparse_matrix.h 57 // <row_block_id, col_block_id> pairs to identify the non-zero cells
67 virtual CellInfo* GetCell(int row_block_id,
95 // A mapping from <row_block_id, col_block_id> to the position in
compressed_col_sparse_matrix_utils_test.cc 89 const int row_block_id,
94 for (int i = 0; i < row_block_id; ++i) {
104 for (int r = 0; r < row_blocks[row_block_id]; ++r) {
139 #define CERES_TEST_FILL_BLOCK(row_block_id, col_block_id) \
141 row_block_id, col_block_id, \

Completed in 78 milliseconds