Searched refs:col_block_id (Results 1 - 12 of 12) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dblock_random_access_diagonal_matrix_test.cc56 int col_block_id; local
63 col_block_id = j;
64 CellInfo* cell = m.GetCell(row_block_id, col_block_id,
77 EXPECT_EQ(col_stride, blocks[col_block_id]);
81 row, col, blocks[row_block_id], blocks[col_block_id]) =
82 (row_block_id + 1) * (col_block_id +1) *
83 Matrix::Ones(blocks[row_block_id], blocks[col_block_id]);
H A Dblock_random_access_dense_matrix.cc67 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];
66 GetCell(const int row_block_id, const int col_block_id, int* row, int* col, int* row_stride, int* col_stride) argument
H A Dblock_sparse_matrix.cc69 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]
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...]
H A Dblock_random_access_sparse_matrix.cc101 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];
128 GetCell(int row_block_id, int col_block_id, int* row, int* col, int* row_stride, int* col_stride) argument
H A Dblock_random_access_sparse_matrix_test.cc70 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]);
H A Dpartitioned_matrix_view_impl.h109 const int col_block_id = cell.block_id; local
110 const int col_block_pos = bs->cols[col_block_id].position;
111 const int col_block_size = bs->cols[col_block_id].size;
136 const int col_block_id = cells[c].block_id; local
137 const int col_block_pos = bs->cols[col_block_id].position;
138 const int col_block_size = bs->cols[col_block_id].size;
151 const int col_block_id = cells[c].block_id; local
152 const int col_block_pos = bs->cols[col_block_id].position;
153 const int col_block_size = bs->cols[col_block_id].size;
175 const int col_block_id local
202 const int col_block_id = cells[c].block_id; local
217 const int col_block_id = cells[c].block_id; local
344 const int col_block_id = cells[c].block_id; local
363 const int col_block_id = cells[c].block_id; local
[all...]
H A Dblock_random_access_matrix.h74 // 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,
H A Dblock_random_access_dense_matrix.h51 // GetCell never returns NULL for any (row_block_id, col_block_id)
67 int col_block_id,
H A Dblock_random_access_diagonal_matrix.cc92 int col_block_id,
97 if (row_block_id != col_block_id) {
91 GetCell(int row_block_id, int col_block_id, int* row, int* col, int* row_stride, int* col_stride) argument
H A Dblock_random_access_diagonal_matrix.h63 int col_block_id,
H A Dblock_random_access_sparse_matrix.h57 // <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
H A Dcompressed_col_sparse_matrix_utils_test.cc90 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, \
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

Completed in 560 milliseconds