Home
last modified time | relevance | path

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

/third_party/boost/boost/intrusive/
Dcircular_slist_algorithms.hpp156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr &prev_init_node, cons… in get_previous_node() function in boost::intrusive::circular_slist_algorithms
157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node()
166 BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & this_node) in get_previous_node() function in boost::intrusive::circular_slist_algorithms
167 { return base_t::get_previous_node(this_node, this_node); } in get_previous_node()
229 base_t::unlink_after(get_previous_node(this_node)); in unlink()
240 { base_t::link_after(get_previous_node(nxt_node), this_node); } in link_before()
264 …NodeTraits::set_next(this_next == other_node ? other_node : get_previous_node(other_node), this_no… in swap_nodes()
267 …NodeTraits::set_next(other_next == this_node ? this_node : get_previous_node(this_node), other_no… in swap_nodes()
333 base_t::unlink_after(base_t::get_previous_node(first, p)); in move_backwards()
Dlinear_slist_algorithms.hpp156 …BOOST_INTRUSIVE_FORCEINLINE static node_ptr get_previous_node(const node_ptr & prev_init_node, con… in get_previous_node() function in boost::intrusive::linear_slist_algorithms
157 { return base_t::get_previous_node(prev_init_node, this_node); } in get_previous_node()
261 old_last = base_t::get_previous_node(first, node_ptr()); in move_first_n_backwards()
Dslist.hpp1863 (node_algorithms::get_previous_node in previous()
Dhashtable.hpp829 node_ptr const x(group_algorithms::get_previous_node(n)); in priv_erase_node()
/third_party/boost/boost/intrusive/detail/
Dcommon_slist_algorithms.hpp43 static node_ptr get_previous_node(node_ptr p, const node_ptr & this_node) in get_previous_node() function in boost::intrusive::detail::common_slist_algorithms