| /external/ceres-solver/internal/ceres/ |
| schur_jacobi_preconditioner.cc | 60 set<pair<int, int> > block_pairs; local
65 block_pairs.insert(make_pair(i, i));
69 m_.reset(new BlockRandomAccessSparseMatrix(block_size_, block_pairs));
|
| block_random_access_crs_matrix_test.cc | 48 set< pair<int, int> > block_pairs; local
50 block_pairs.insert(make_pair(0, 0));
53 block_pairs.insert(make_pair(1, 1));
56 block_pairs.insert(make_pair(1, 2));
59 block_pairs.insert(make_pair(2, 0));
62 BlockRandomAccessCRSMatrix m(blocks, block_pairs);
66 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
67 it != block_pairs.end();
126 set< pair<int, int> > block_pairs; local
127 block_pairs.insert(make_pair(0, 0))
[all...] |
| block_random_access_sparse_matrix_test.cc | 48 set< pair<int, int> > block_pairs; local
50 block_pairs.insert(make_pair(0, 0));
53 block_pairs.insert(make_pair(1, 1));
56 block_pairs.insert(make_pair(1, 2));
59 block_pairs.insert(make_pair(2, 0));
62 BlockRandomAccessSparseMatrix m(blocks, block_pairs);
66 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
67 it != block_pairs.end();
129 set< pair<int, int> > block_pairs; local
130 block_pairs.insert(make_pair(0, 0))
[all...] |
| schur_complement_solver.cc | 187 set<pair<int, int> > block_pairs; local
189 block_pairs.insert(make_pair(i, i));
220 block_pairs.insert(make_pair(f_blocks[i], f_blocks[j]));
235 block_pairs.insert(make_pair(r_block1_id, r_block2_id));
241 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs));
|
