Searched defs:block_pairs (Results 1 - 3 of 3) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dblock_random_access_sparse_matrix.cc49 const set<pair<int, int> >& block_pairs)
67 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
68 it != block_pairs.end();
86 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
87 it != block_pairs.end();
97 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
98 it != block_pairs.end();
47 BlockRandomAccessSparseMatrix( const vector<int>& blocks, const set<pair<int, int> >& block_pairs) argument
H A Dblock_random_access_sparse_matrix_test.cc48 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
[all...]
H A Dschur_complement_solver.cc193 set<pair<int, int> > block_pairs; local
195 block_pairs.insert(make_pair(i, i));
226 block_pairs.insert(make_pair(f_blocks[i], f_blocks[j]));
241 block_pairs.insert(make_pair(r_block1_id, r_block2_id));
247 set_lhs(new BlockRandomAccessSparseMatrix(blocks_, block_pairs));

Completed in 135 milliseconds