Home
last modified time | relevance | path

Searched refs:group_to_elements (Results 1 – 5 of 5) sorted by relevance

/external/ceres-solver/internal/ceres/
Dcoordinate_descent_minimizer.cc71 map<int, set<double*> > group_to_elements = ordering.group_to_elements(); in Init() local
72 for (map<int, set<double*> >::const_iterator it = group_to_elements.begin(); in Init()
73 it != group_to_elements.end(); in Init()
240 const map<int, set<double*> >& group_to_elements = in IsOrderingValid() local
241 ordering.group_to_elements(); in IsOrderingValid()
244 map<int, set<double*> >::const_iterator it = group_to_elements.begin(); in IsOrderingValid()
245 for ( ; it != group_to_elements.end(); ++it) { in IsOrderingValid()
Dparameter_block_ordering.cc154 const map<int, set<double*> >& group_to_elements = in OrderingToGroupSizes() local
155 ordering->group_to_elements(); in OrderingToGroupSizes()
156 for (map<int, set<double*> >::const_iterator it = group_to_elements.begin(); in OrderingToGroupSizes()
157 it != group_to_elements.end(); in OrderingToGroupSizes()
Dreorder_program.cc157 ordering.group_to_elements(); in ApplyOrdering()
363 parameter_block_ordering->group_to_elements().begin()->second.size(); in ReorderProgramForSchurTypeLinearSolver()
Dsolver_impl.cc627 options.linear_solver_ordering->group_to_elements().begin()->second; in IsOrderingValid()
899 ->group_to_elements().begin() in CreateEvaluator()
/external/ceres-solver/include/ceres/
Dordered_groups.h183 const map<int, set<T> >& group_to_elements() const { in group_to_elements() function