Searched refs:block_pairs (Results 1 – 4 of 4) sorted by relevance
| /external/ceres-solver/internal/ceres/ |
| D | block_random_access_sparse_matrix_test.cc | 48 set< pair<int, int> > block_pairs; in TEST() local
50 block_pairs.insert(make_pair(0, 0)); in TEST()
53 block_pairs.insert(make_pair(1, 1)); in TEST()
56 block_pairs.insert(make_pair(1, 2)); in TEST()
59 block_pairs.insert(make_pair(2, 0)); in TEST()
62 BlockRandomAccessSparseMatrix m(blocks, block_pairs); in TEST()
66 for (set<pair<int, int> >::const_iterator it = block_pairs.begin(); in TEST()
67 it != block_pairs.end(); in TEST()
129 set< pair<int, int> > block_pairs; in SetUp() local
130 block_pairs.insert(make_pair(0, 0)); in SetUp()
[all …]
|
| D | block_random_access_sparse_matrix.cc | 49 const set<pair<int, int> >& block_pairs) in BlockRandomAccessSparseMatrix()
67 for (set<pair<int, int> >::const_iterator it = block_pairs.begin(); in BlockRandomAccessSparseMatrix()
68 it != block_pairs.end(); in BlockRandomAccessSparseMatrix()
86 for (set<pair<int, int> >::const_iterator it = block_pairs.begin(); in BlockRandomAccessSparseMatrix()
87 it != block_pairs.end(); in BlockRandomAccessSparseMatrix()
97 for (set<pair<int, int> >::const_iterator it = block_pairs.begin(); in BlockRandomAccessSparseMatrix()
98 it != block_pairs.end(); in BlockRandomAccessSparseMatrix()
|
| D | schur_complement_solver.cc | 193 set<pair<int, int> > block_pairs; in InitStorage() local
195 block_pairs.insert(make_pair(i, i)); in InitStorage()
226 block_pairs.insert(make_pair(f_blocks[i], f_blocks[j])); in InitStorage()
241 block_pairs.insert(make_pair(r_block1_id, r_block2_id)); in InitStorage()
247 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs)); in InitStorage()
|
| D | block_random_access_sparse_matrix.h | 60 const set<pair<int, int> >& block_pairs);
|