Home
last modified time | relevance | path

Searched refs:group_traits (Results 1 – 2 of 2) sorted by relevance

/third_party/boost/boost/intrusive/
Dhashtable.hpp367 typedef unordered_group_adapter<node_traits> group_traits; typedef
374 typedef circular_slist_algorithms<group_traits> group_algorithms;
386 (group_traits::get_next(nxt) == prev_node)){ in get_bucket_before_begin()
398 node_ptr last_node_group = group_traits::get_next(first_node_of_group); in get_bucket_before_begin()
403 last_node_group = group_traits::get_next(first_node_of_group); in get_bucket_before_begin()
414 nb = group_traits::get_next(n); //go to last in group in get_prev_to_first_in_group()
424 if(nxt_ptr != end_ptr && to_erase_ptr == group_traits::get_next(nxt_ptr)){ in erase_from_group()
433 { return group_traits::get_next(first_in_group); } in get_last_in_group()
441 while(n == node_traits::get_next((ng = group_traits::get_next(n)))){ in get_first_in_group()
449 return node_traits::get_next(group_traits::get_next(ptr)); in next_group_if_first_in_group()
[all …]
Dunordered_set_hook.hpp123 typedef unordered_group_adapter<NodeTraits> group_traits; typedef
124 typedef circular_slist_algorithms<group_traits> group_algorithms;