/external/ceres-solver/internal/ceres/ |
block_random_access_dense_matrix.cc | 67 const int col_block_id, 73 *col = block_layout_[col_block_id]; 76 return &cell_infos_[row_block_id * block_layout_.size() + col_block_id];
|
block_sparse_matrix.cc | 69 int col_block_id = cells[j].block_id; local 70 int col_block_size = block_structure_->cols[col_block_id].size; 97 int col_block_id = cells[j].block_id; local 98 int col_block_size = block_structure_->cols[col_block_id].size; 99 int col_block_pos = block_structure_->cols[col_block_id].position; 117 int col_block_id = cells[j].block_id; local 118 int col_block_size = block_structure_->cols[col_block_id].size; 119 int col_block_pos = block_structure_->cols[col_block_id].position; 135 int col_block_id = cells[j].block_id; local 136 int col_block_size = block_structure_->cols[col_block_id].size 152 int col_block_id = cells[j].block_id; local 174 int col_block_id = cells[j].block_id; local 197 int col_block_id = cells[j].block_id; local 227 const int col_block_id = cells[j].block_id; local [all...] |
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 113 int col_block_id,
|
block_random_access_sparse_matrix.cc | 101 const int col_block_id = it->second; local 103 const int col_block_size = blocks_[col_block_id]; 105 layout_[IntPairToLong(row_block_id, col_block_id)]->values - values; 109 cols[pos] = col_layout[col_block_id] + c; 129 int col_block_id, 135 layout_.find(IntPairToLong(row_block_id, col_block_id)); 144 *col_stride = blocks_[col_block_id];
|
block_random_access_sparse_matrix_test.cc | 70 const int col_block_id = it->second; local 75 CellInfo* cell = m.GetCell(row_block_id, col_block_id, 82 EXPECT_EQ(col_stride, blocks[col_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) 67 int col_block_id,
|
partitioned_matrix_view.cc | 104 const int col_block_id = cell.block_id; local 105 const int col_block_pos = bs->cols[col_block_id].position; 106 const int col_block_size = bs->cols[col_block_id].size; 128 const int col_block_id = cells[c].block_id; local 129 const int col_block_pos = bs->cols[col_block_id].position; 130 const int col_block_size = bs->cols[col_block_id].size; 149 const int col_block_id = cell.block_id; local 150 const int col_block_pos = bs->cols[col_block_id].position; 151 const int col_block_size = bs->cols[col_block_id].size; 173 const int col_block_id = cells[c].block_id local 286 const int col_block_id = cells[c].block_id; local [all...] |
block_random_access_crs_matrix.cc | 115 const int col_block_id = col_blocks[j]; local 116 const int col_block_size = blocks_[col_block_id]; 120 cols[column_block_begin + c] = col_layout_[col_block_id] + c; 145 int col_block_id, 151 layout_.find(IntPairToLong(row_block_id, col_block_id));
|
block_random_access_crs_matrix_test.cc | 70 const int col_block_id = it->second; 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 66 int col_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 68 int col_block_id, 95 // A mapping from <row_block_id, col_block_id> to the position in
|
compressed_col_sparse_matrix_utils_test.cc | 90 const int col_block_id, 99 for (int i = 0; i < col_block_id; ++i) { 105 for (int c = 0; c < col_blocks[col_block_id]; ++c, ++offset) { 139 #define CERES_TEST_FILL_BLOCK(row_block_id, col_block_id) \ 141 row_block_id, col_block_id, \
|