Searched refs:const_iterator (Results 1 - 25 of 4405) sorted by path

1234567891011>>

/external/bison/data/
H A Dstack.hh41 typedef typename S::const_reverse_iterator const_iterator;
87 inline const_iterator begin () const { return seq_.rbegin (); }
88 inline const_iterator end () const { return seq_.rend (); }
/external/bison/examples/calc++/
H A Dcalc++-parser.cc988 for (state_stack_type::const_iterator i = yystate_stack_.begin ();
H A Dstack.hh53 typedef typename S::const_reverse_iterator const_iterator; typedef in class:yy::stack
99 inline const_iterator begin () const { return seq_.rbegin (); }
100 inline const_iterator end () const { return seq_.rend (); }
/external/ceres-solver/include/ceres/internal/
H A Dfixed_array.h84 typedef T const* const_iterator; typedef in class:ceres::internal::FixedArray
130 inline const_iterator begin() const { return &array_[0].element; }
131 inline const_iterator end() const { return &array_[size_].element; }
/external/ceres-solver/include/ceres/
H A Dordered_groups.h66 typename map<T, int>::const_iterator it = element_to_group_.find(element);
131 for (typename set<T>::const_iterator element_it = it->second.begin();
146 typename map<T, int>::const_iterator it = element_to_group_.find(element);
154 typename map<T, int>::const_iterator it = element_to_group_.find(element);
161 typename map<int, set<T> >::const_iterator it =
/external/ceres-solver/internal/ceres/
H A Dblock_random_access_sparse_matrix.cc67 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
86 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
97 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
H A Dblock_random_access_sparse_matrix_test.cc66 for (set<pair<int, int> >::const_iterator it = block_pairs.begin();
H A Dcanonical_views_clustering.cc117 for (IntSet::const_iterator view = valid_views.begin();
150 for (IntSet::const_iterator view = views.begin();
172 for (IntSet::const_iterator neighbor = neighbors.begin();
199 for (IntSet::const_iterator neighbor = neighbors.begin();
228 for (IntSet::const_iterator view = views.begin();
231 IntMap::const_iterator it =
H A Dcompressed_col_sparse_matrix_utils.cc69 vector<int>::const_iterator it = lower_bound(row_block_starts.begin(),
H A Dcoordinate_descent_minimizer.cc72 for (map<int, set<double*> >::const_iterator it = group_to_elements.begin();
75 for (set<double*>::const_iterator ptr_it = it->second.begin();
106 const map<ParameterBlock*, int>::const_iterator it =
244 map<int, set<double*> >::const_iterator it = group_to_elements.begin();
H A Dcovariance_impl.cc338 for (map<const double*, int>::const_iterator it =
H A Dgraph.h77 for (typename HashSet<Vertex>::const_iterator it = sinks.begin();
H A Dgraph_algorithms.h113 for (typename HashSet<Vertex>::const_iterator it = vertices.begin();
135 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
147 for (typename vector<Vertex>::const_iterator it = vertex_queue.begin();
191 for (typename HashSet<Vertex>::const_iterator it = vertices.begin();
210 for (typename HashSet<Vertex>::const_iterator it = neighbors.begin();
222 for (typename vector<Vertex>::const_iterator it = vertex_queue.begin();
288 for (typename HashSet<Vertex>::const_iterator it = vertices.begin();
296 for (typename HashSet<Vertex>::const_iterator it2 = neighbors.begin();
H A Dlow_rank_inverse_hessian.cc176 for (std::list<int>::const_iterator it = indices_.begin();
H A Dmap_util.h61 typename Collection::const_iterator it = collection.find(key);
74 typename Collection::const_iterator it = collection.find(key);
113 typename Collection::const_iterator it = collection.find(key);
H A Dparameter_block_ordering.cc156 for (map<int, set<double*> >::const_iterator it = group_to_elements.begin();
H A Dproblem_impl.cc64 ParameterMap::const_iterator it = parameter_map.find(parameter_block);
258 vector<double*>::const_iterator duplicate_items =
802 for (ParameterMap::const_iterator it = parameter_block_map_.begin();
H A Dprogram.cc368 for (vector<ResidualBlock*>::const_iterator it = residual_blocks_.begin();
H A Dreorder_program.cc159 for (map<int, set<double*> >::const_iterator group_it = groups.begin();
163 for (set<double*>::const_iterator parameter_block_ptr_it = group.begin();
166 ProblemImpl::ParameterMap::const_iterator parameter_block_it =
H A Dschur_eliminator_impl.h509 BufferLayoutType::const_iterator it1 = buffer_layout.begin();
529 BufferLayoutType::const_iterator it2 = it1;
H A Dsingle_linkage_clustering.cc53 for (HashSet<int>::const_iterator it = vertices.begin();
59 for (HashSet<int>::const_iterator it1 = vertices.begin();
64 for (HashSet<int>::const_iterator it2 = neighbors.begin();
H A Dsolver_impl.cc294 for (ProblemImpl::ParameterMap::const_iterator it = parameter_map.begin();
501 for (ProblemImpl::ParameterMap::const_iterator it = parameter_map.begin();
612 for (vector<ParameterBlock*>::const_iterator it = parameter_blocks.begin();
645 for (vector<ResidualBlock*>::const_iterator it = residual_blocks.begin();
H A Dvisibility.cc99 for (set<int>::const_iterator it = visibility_set.begin();
111 for (vector<set<int> >::const_iterator it = inverse_visibility.begin();
115 for (set<int>::const_iterator camera1 = inverse_visibility_set.begin();
118 set<int>::const_iterator camera2 = camera1;
137 for (HashMap<pair<int, int>, int>::const_iterator it = camera_pairs.begin();
H A Dvisibility_based_preconditioner.cc295 for (set<int>::const_iterator block1 = f_blocks.begin();
298 set<int>::const_iterator block2 = block1;
402 for (set< pair<int, int> >::const_iterator it = block_pairs_.begin();
509 for (HashSet<int>::const_iterator it1 = vertices.begin();
515 for (HashSet<int>::const_iterator it2 = neighbors.begin();
592 for (HashMap<int, int>::const_iterator it = membership_map.begin();
/external/chromium_org/android_webview/browser/
H A Daw_form_database_service.cc117 QueryMap::const_iterator it = result_map_.find(h);

Completed in 328 milliseconds

1234567891011>>