Iros
 
Loading...
Searching...
No Matches
List of all members
di::container::IntrusiveTreeSet< T, Tag, Comp > Class Template Reference

#include <di/container/intrusive/tree_set.h>

Inheritance diagram for di::container::IntrusiveTreeSet< T, Tag, Comp >:
[legend]

Additional Inherited Members

- Public Member Functions inherited from di::container::RBTree< T, function::Compare, DefaultIntrusiveTreeSetTag, IntrusiveSetInterface< IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare >, T, IntrusiveTreeSetNode< DefaultIntrusiveTreeSetTag >, RBTreeIterator< T, DefaultIntrusiveTreeSetTag >, meta::ConstIterator< RBTreeIterator< T, DefaultIntrusiveTreeSetTag > >, detail::RBTreeValidForLookup< T, function::Compare >::template Type, false >, false >
 RBTree ()=default
 
 RBTree (RBTree const &)=delete
 
constexpr RBTree (function::Compare comparator)
 
constexpr RBTree (RBTree &&other)
 
auto operator= (RBTree const &) -> RBTree &=delete
 
constexpr auto operator= (RBTree &&other) -> RBTree &
 
constexpr ~RBTree ()
 
constexpr auto size () const -> usize
 
constexpr auto empty () const -> bool
 
constexpr auto begin () -> Iterator
 
constexpr auto begin () const -> ConstIterator
 
constexpr auto end () -> Iterator
 
constexpr auto end () const -> ConstIterator
 
constexpr auto unconst_iterator (ConstIterator it) -> Iterator
 
constexpr auto insert_node (Node &node)
 
constexpr auto insert_node (ConstIterator, Node &node)
 
constexpr auto erase_impl (ConstIterator position) -> Iterator
 
constexpr auto equal_range_impl (U &&needle) const
 
constexpr auto lower_bound_impl (U &&needle) const -> ConstIterator
 
constexpr auto upper_bound_impl (U &&needle) const -> ConstIterator
 
constexpr auto find_impl (U &&needle) const -> ConstIterator
 
constexpr void merge_impl (RBTree &&other)
 
- Public Member Functions inherited from di::container::IntrusiveSetInterface< IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare >, T, IntrusiveTreeSetNode< DefaultIntrusiveTreeSetTag >, RBTreeIterator< T, DefaultIntrusiveTreeSetTag >, meta::ConstIterator< RBTreeIterator< T, DefaultIntrusiveTreeSetTag > >, detail::RBTreeValidForLookup< T, function::Compare >::template Type, false >
constexpr auto empty () const -> bool
 
constexpr void clear ()
 
constexpr auto insert (IntrusiveTreeSetNode< DefaultIntrusiveTreeSetTag > &node)
 
constexpr auto insert (ConstIterator hint, IntrusiveTreeSetNode< DefaultIntrusiveTreeSetTag > &node)
 
constexpr auto merge (IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare > &self)
 
constexpr auto merge (IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare > &&self)
 
constexpr auto erase (RBTreeIterator< T, DefaultIntrusiveTreeSetTag > position)
 
constexpr auto erase (RBTreeIterator< T, DefaultIntrusiveTreeSetTag > first, RBTreeIterator< T, DefaultIntrusiveTreeSetTag > last) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag >
 
constexpr auto erase (T const &needle) -> usize
 
constexpr auto erase (U &&needle) -> usize
 
constexpr auto front () -> Optional< T & >
 
constexpr auto front () const -> Optional< T const & >
 
constexpr auto back () -> Optional< T & >
 
constexpr auto back () const -> Optional< T const & >
 
constexpr auto at (T const &needle) -> Optional< T & >
 
constexpr auto at (T const &needle) const -> Optional< T const & >
 
constexpr auto at (U &&needle) -> Optional< T & >
 
constexpr auto at (U &&needle) const -> Optional< T const & >
 
constexpr auto find (T const &needle) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag >
 
constexpr auto find (T const &needle) const -> ConstIterator
 
constexpr auto find (U &&needle) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag >
 
constexpr auto find (U &&needle) const -> ConstIterator
 
constexpr auto contains (T const &needle) const -> bool
 
constexpr auto contains (U &&needle) const -> bool
 
constexpr auto count (T const &needle) const -> usize
 
constexpr auto count (U &&needle) const -> usize
 
constexpr auto equal_range (T const &needle) -> View< RBTreeIterator< T, DefaultIntrusiveTreeSetTag > >
 
constexpr auto equal_range (U &&needle) -> View< RBTreeIterator< T, DefaultIntrusiveTreeSetTag > >
 
constexpr auto equal_range (T const &needle) const -> View< ConstIterator >
 
constexpr auto equal_range (U &&needle) const -> View< ConstIterator >
 
constexpr auto lower_bound (T const &needle) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag > requires(
 
constexpr auto lower_bound (T const &needle) const -> ConstIterator requires(
 
constexpr auto lower_bound (U &&needle) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag > requires(
 
constexpr auto lower_bound (U &&needle) const -> ConstIterator requires(
 
constexpr auto upper_bound (T const &needle) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag > requires(
 
constexpr auto upper_bound (T const &needle) const -> ConstIterator requires(
 
constexpr auto upper_bound (U &&needle) -> RBTreeIterator< T, DefaultIntrusiveTreeSetTag > requires(
 
constexpr auto upper_bound (U &&needle) const -> ConstIterator requires(
 
constexpr void intersect (IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare > const &b)
 
constexpr void subtract (IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare > const &b)
 
- Protected Member Functions inherited from di::container::RBTree< T, function::Compare, DefaultIntrusiveTreeSetTag, IntrusiveSetInterface< IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare >, T, IntrusiveTreeSetNode< DefaultIntrusiveTreeSetTag >, RBTreeIterator< T, DefaultIntrusiveTreeSetTag >, meta::ConstIterator< RBTreeIterator< T, DefaultIntrusiveTreeSetTag > >, detail::RBTreeValidForLookup< T, function::Compare >::template Type, false >, false >
constexpr void insert_node (InsertPosition position, Node &to_insert)
 
constexpr auto node_value (Node &node) const -> T &
 
constexpr auto node_value (Node const &node) const -> T const &
 
constexpr auto node_color (Node *node) const -> Node::Color
 
constexpr void rotate_left (Node &x)
 
constexpr void rotate_right (Node &y)
 
constexpr auto insert_position (U &&needle) const -> InsertPosition
 
constexpr void do_insert_node (InsertPosition position, Node &to_insert)
 
constexpr void do_insert_rebalancing (Node *node)
 
constexpr void transplant (Node &u, Node *v)
 
constexpr void erase_node (Node &to_delete)
 
constexpr void do_erase_rebalancing (Node *x)
 
constexpr auto compare (Node const &a, Node const &b) const
 
constexpr auto compare (T const &a, U &&b) const
 
- Protected Attributes inherited from di::container::RBTree< T, function::Compare, DefaultIntrusiveTreeSetTag, IntrusiveSetInterface< IntrusiveTreeSet< T, DefaultIntrusiveTreeSetTag, function::Compare >, T, IntrusiveTreeSetNode< DefaultIntrusiveTreeSetTag >, RBTreeIterator< T, DefaultIntrusiveTreeSetTag >, meta::ConstIterator< RBTreeIterator< T, DefaultIntrusiveTreeSetTag > >, detail::RBTreeValidForLookup< T, function::Compare >::template Type, false >, false >
Node * m_root
 
Node * m_minimum
 
Node * m_maximum
 
usize m_size
 
function::Compare m_comparator
 
The documentation for this class was generated from the following file: