Searched refs:new_cont (Results 1 – 4 of 4) sorted by relevance
| /third_party/boost/libs/range/test/algorithm_test/ |
| D | random_shuffle.cpp | 47 const Container& new_cont in test_shuffle_result() argument
53 BOOST_CHECK_EQUAL( old_cont.size(), new_cont.size() ); in test_shuffle_result()
54 if (old_cont.size() != new_cont.size()) in test_shuffle_result()
57 if (new_cont.size() < 2) in test_shuffle_result()
61 new_cont.begin(), new_cont.end() in test_shuffle_result()
65 new_cont.begin()); in test_shuffle_result()
79 = std::count(new_cont.begin(), new_cont.end(), *it); in test_shuffle_result()
|
| /third_party/boost/libs/graph/example/ |
| D | r_c_shortest_paths_example.cpp | 83 spp_no_rc_res_cont& new_cont, const spp_no_rc_res_cont& old_cont, in operator ()() argument
86 new_cont.cost = old_cont.cost + g[ed].cost; in operator ()()
156 spp_spptw_res_cont& new_cont, const spp_spptw_res_cont& old_cont, in operator ()() argument
162 new_cont.cost = old_cont.cost + arc_prop.cost; in operator ()()
163 int& i_time = new_cont.time; in operator ()()
|
| /third_party/boost/libs/graph/test/ |
| D | r_c_shortest_paths_test.cpp | 84 spp_no_rc_res_cont& new_cont, const spp_no_rc_res_cont& old_cont, in operator ()() argument
87 new_cont.cost = old_cont.cost + g[ed].cost; in operator ()()
157 spp_spptw_res_cont& new_cont, const spp_spptw_res_cont& old_cont, in operator ()() argument
163 new_cont.cost = old_cont.cost + arc_prop.cost; in operator ()()
164 int& i_time = new_cont.time; in operator ()()
252 spp_spptw_marked_res_cont& new_cont, in operator ()() argument
267 new_cont.cost = old_cont.cost + arc_prop.cost; in operator ()()
268 new_cont.marked = old_cont.marked; in operator ()()
269 new_cont.marked.insert(dest); in operator ()()
270 int& i_time = new_cont.time; in operator ()()
|
| /third_party/boost/boost/multi_index/detail/ |
| D | safe_mode.hpp | 312 safe_container_base* new_cont=it.cont; in operator =() local
313 if(cont!=new_cont){ in operator =()
315 attach(new_cont); in operator =()
|