Home
last modified time | relevance | path

Searched refs:get_value_traits (Results 1 – 21 of 21) sorted by relevance

/third_party/boost/boost/intrusive/detail/
Dtree_iterator.hpp79 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
83 : members_(other.pointed_node(), other.get_value_traits()) in tree_iterator()
158 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::tree_iterator
163 … return tree_iterator(node_algorithms::get_header(this->pointed_node()), this->get_value_traits()); in end_iterator_from_it()
167 { return tree_iterator<value_traits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
174 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
Dslist_iterator.hpp73 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
77 : members_(other.pointed_node(), other.get_value_traits()) in slist_iterator()
89 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::slist_iterator
119 { return slist_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
127 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
Dlist_iterator.hpp71 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
75 : members_(other.pointed_node(), other.get_value_traits()) in list_iterator()
87 BOOST_INTRUSIVE_FORCEINLINE const_value_traits_ptr get_value_traits() const in get_value_traits() function in boost::intrusive::list_iterator
131 { return list_iterator<ValueTraits, false>(this->pointed_node(), this->get_value_traits()); } in unconst()
138 { return this->get_value_traits()->to_value_ptr(members_.nodeptr_); } in operator_arrow()
Dnode_to_value.hpp113 const_value_traits_ptr get_value_traits() const in get_value_traits() function
120 { return *(this->get_value_traits()->to_value_ptr(pointer_traits<npointer>::pointer_to(arg))); } in to_value()
Dget_value_traits.hpp203 struct get_value_traits struct
210 typedef typename get_value_traits<void, SupposedValueTraits>::type::node_traits type;
/third_party/boost/boost/intrusive/
Dbstree.hpp136 BOOST_INTRUSIVE_FORCEINLINE const value_traits &get_value_traits() const in get_value_traits() function
139 BOOST_INTRUSIVE_FORCEINLINE value_traits &get_value_traits() in get_value_traits() function
146 { return pointer_traits<const_value_traits_ptr>::pointer_to(this->get_value_traits()); } in priv_value_traits_ptr()
195 node_algorithms::replace_node( get_value_traits().to_node_ptr(*replace_this) in replace_node()
197 , get_value_traits().to_node_ptr(with_this)); in replace_node()
221 … { return iterator (this->get_value_traits().to_node_ptr(value), this->priv_value_traits_ptr()); } in iterator_to()
224 …{ return const_iterator (this->get_value_traits().to_node_ptr(*pointer_traits<pointer>::const_cas… in iterator_to()
372 …::key_nodeptr_comp<KeyTypeKeyCompare, value_traits, key_of_value>(comp, &this->get_value_traits()); in key_node_comp()
594 (detail::null_disposer(), &this->get_value_traits())); in ~bstbase()
738 : data_type(::boost::move(x.comp()), ::boost::move(x.get_value_traits())) in bstree_impl()
[all …]
Dtreap.hpp151 …tr_comp<PrioPrioComp, value_traits, priority_of_value>(priopriocomp, &this->get_value_traits()); } in prio_node_prio_comp()
435 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal()
464 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal()
760 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_unique_commit()
783 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_before()
813 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in push_back()
836 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in push_front()
929 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
1029 …tail::node_disposer<Disposer, value_traits, TreapAlgorithms>(disposer, &this->get_value_traits())); in clear_and_dispose()
1263 typedef typename detail::get_value_traits
Dsgtree.hpp449 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal()
464 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_equal()
547 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_unique_commit()
577 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in insert_before()
592 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in push_back()
606 node_ptr to_insert(this->get_value_traits().to_node_ptr(value)); in push_front()
663 disposer(this->get_value_traits().to_value_ptr(to_erase)); in erase_and_dispose()
978 typedef typename detail::get_value_traits
Dsplaytree.hpp501 key_node_comp(comp, &this->get_value_traits()); in splay_down()
563 typedef typename detail::get_value_traits
Dbs_set.hpp476 typedef typename detail::get_value_traits
969 typedef typename detail::get_value_traits
Dset.hpp479 typedef typename detail::get_value_traits
973 typedef typename detail::get_value_traits
Dunordered_set.hpp437 typedef typename detail::get_value_traits
889 typedef typename detail::get_value_traits
Davl_set.hpp479 typedef typename detail::get_value_traits
973 typedef typename detail::get_value_traits
Dtreap_set.hpp492 typedef typename detail::get_value_traits
1007 typedef typename detail::get_value_traits
Dsplay_set.hpp500 typedef typename detail::get_value_traits
1010 typedef typename detail::get_value_traits
Dsg_set.hpp488 typedef typename detail::get_value_traits
994 typedef typename detail::get_value_traits
Drbtree.hpp488 typedef typename detail::get_value_traits
Davltree.hpp485 typedef typename detail::get_value_traits
Dlist.hpp1427 typedef typename detail::get_value_traits
Dslist.hpp2155 typedef typename detail::get_value_traits
Dhashtable.hpp3525 typedef typename detail::get_value_traits
3571 typedef typename detail::get_value_traits