Searched refs:a_iter (Results 1 – 3 of 3) sorted by relevance
| /third_party/boost/boost/graph/ |
| D | graph_stats.hpp | 83 a_iterator_type a_iter, a_end; in dup_edge_dist() local
84 for (boost::tie(a_iter, a_end) = adjacent_vertices(v, g); in dup_edge_dist()
85 a_iter != a_end; ++a_iter) in dup_edge_dist()
87 front_neighbors.push_back(*a_iter); in dup_edge_dist()
|
| D | push_relabel_max_flow.hpp | 181 out_edge_iterator a_iter, a_end; in push_relabel() local
182 for (boost::tie(a_iter, a_end) = out_edges(src, g); a_iter != a_end; in push_relabel()
183 ++a_iter) in push_relabel()
184 if (target(*a_iter, g) != src) in push_relabel()
185 test_excess += get(residual_capacity, *a_iter); in push_relabel()
195 for (boost::tie(a_iter, a_end) = out_edges(src, g); in push_relabel()
196 a_iter != a_end; ++a_iter) in push_relabel()
198 edge_descriptor a = *a_iter; in push_relabel()
|
| /third_party/boost/boost/random/ |
| D | discrete_distribution.hpp | 596 a_iter = above_average.begin(), in init() local
599 while(b_iter != b_end && a_iter != a_end) { in init()
601 std::make_pair(b_iter->first, a_iter->second); in init()
602 a_iter->first -= (_impl.get_weight(b_iter->second) - b_iter->first); in init()
603 if(a_iter->first < normalized_average) { in init()
604 *b_iter = *a_iter++; in init()
613 for(; a_iter != a_end; ++a_iter) { in init()
614 _impl._alias_table[static_cast<std::size_t>(a_iter->second)].first = in init()
615 _impl.get_weight(a_iter->second); in init()
|