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

  /external/ceres-solver/internal/ceres/
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_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;
123 int col_block_id = cells[j].block_id; local
124 int col_block_size = block_structure_->cols[col_block_id].size;
125 int col_block_pos = block_structure_->cols[col_block_id].position;
144 int col_block_id = cells[j].block_id; local
145 int col_block_size = block_structure_->cols[col_block_id].size;
146 int col_block_pos = block_structure_->cols[col_block_id].position;
162 int col_block_id = cells[j].block_id; local
163 int col_block_size = block_structure_->cols[col_block_id].size
179 int col_block_id = cells[j].block_id; local
201 int col_block_id = cells[j].block_id; local
224 int col_block_id = cells[j].block_id; local
269 const int col_block_id = cells[j].block_id; local
    [all...]
block_random_access_dense_matrix.cc 62 const int col_block_id,
68 *col = block_layout_[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 103 const int col_block_id = cell.block_id; local
104 const int col_block_pos = bs->cols[col_block_id].position;
105 const int col_block_size = bs->cols[col_block_id].size;
131 const int col_block_id = cells[c].block_id; local
132 const int col_block_pos = bs->cols[col_block_id].position;
133 const int col_block_size = bs->cols[col_block_id].size;
155 const int col_block_id = cell.block_id; local
156 const int col_block_pos = bs->cols[col_block_id].position;
157 const int col_block_size = bs->cols[col_block_id].size;
183 const int col_block_id = cells[c].block_id local
299 const int col_block_id = cells[c].block_id; local
    [all...]
suitesparse_test.cc 89 const int col_block_id,
98 for (int i = 0; i < col_block_id; ++i) {
104 for (int c = 0; c < col_blocks[col_block_id]; ++c, ++offset) {
138 #define CERES_TEST_FILL_BLOCK(row_block_id, col_block_id) \
140 row_block_id, col_block_id, \
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,
96 // A mapping from <row_block_id, col_block_id> to the position in

Completed in 71 milliseconds