Loading [MathJax]/extensions/tex2jax.js
Iros
 
•All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages Concepts
Loading...
Searching...
No Matches
Public Member Functions | Friends | List of all members
di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi > Class Template Reference

#include <di/container/associative/intrusive_set_interface.h>

Public Member Functions

constexpr auto empty () const -> bool
 
constexpr void clear ()
 
constexpr auto insert (Node &node)
 
constexpr auto insert (ConstIterator hint, Node &node)
 
constexpr auto merge (Self &self)
 
constexpr auto merge (Self &&self)
 
constexpr auto erase (Iterator position)
 
constexpr auto erase (Iterator first, Iterator last) -> Iterator
 
constexpr auto erase (Value const &needle) -> usize
 
template<typename U>
requires (valid<U>)
constexpr auto erase (U &&needle) -> usize
 
constexpr auto front () -> Optional< Value & >
 
constexpr auto front () const -> Optional< Value const & >
 
constexpr auto back () -> Optional< Value & >
 
constexpr auto back () const -> Optional< Value const & >
 
constexpr auto at (Value const &needle) -> Optional< Value & >
 
constexpr auto at (Value const &needle) const -> Optional< Value const & >
 
template<typename U>
requires (valid<U>)
constexpr auto at (U &&needle) -> Optional< Value & >
 
template<typename U>
requires (valid<U>)
constexpr auto at (U &&needle) const -> Optional< Value const & >
 
constexpr auto find (Value const &needle) -> Iterator
 
constexpr auto find (Value const &needle) const -> ConstIterator
 
template<typename U>
requires (valid<U>)
constexpr auto find (U &&needle) -> Iterator
 
template<typename U>
requires (valid<U>)
constexpr auto find (U &&needle) const -> ConstIterator
 
constexpr auto contains (Value const &needle) const -> bool
 
template<typename U>
requires (valid<U>)
constexpr auto contains (U &&needle) const -> bool
 
constexpr auto count (Value const &needle) const -> usize
 
template<typename U>
requires (valid<U>)
constexpr auto count (U &&needle) const -> usize
 
constexpr auto equal_range (Value const &needle) -> View< Iterator >
 
template<typename U>
requires (valid<U>)
constexpr auto equal_range (U &&needle) -> View< Iterator >
 
constexpr auto equal_range (Value const &needle) const -> View< ConstIterator >
 
template<typename U>
requires (valid<U>)
constexpr auto equal_range (U &&needle) const -> View< ConstIterator >
 
constexpr auto lower_bound (Value const &needle) -> Iterator requires(
 
constexpr auto lower_bound (Value const &needle) const -> ConstIterator requires(
 
template<typename U>
requires (valid<U>)
constexpr auto lower_bound (U &&needle) -> Iterator requires(
 
template<typename U>
requires (valid<U>)
constexpr auto lower_bound (U &&needle) const -> ConstIterator requires(
 
constexpr auto upper_bound (Value const &needle) -> Iterator requires(
 
constexpr auto upper_bound (Value const &needle) const -> ConstIterator requires(
 
template<typename U>
requires (valid<U>)
constexpr auto upper_bound (U &&needle) -> Iterator requires(
 
template<typename U>
requires (valid<U>)
constexpr auto upper_bound (U &&needle) const -> ConstIterator requires(
 
constexpr void intersect (Self const &b)
 
constexpr void subtract (Self const &b)
 

Friends

constexpr friend auto operator| (Self &&a, Self &&b)
 Set union.
 
constexpr friend auto operator|= (Self &a, Self &&b) -> decltype(auto)
 
constexpr friend auto operator& (Self &&a, Self const &b)
 Set intersection.
 
constexpr friend auto operator&= (Self &a, Self const &b) -> Self &requires(!is_multi)
 
constexpr friend auto operator- (Self &&a, Self const &b)
 Set differerce.
 
constexpr friend auto operator-= (Self &a, Self const &b) -> Self &requires(!is_multi)
 
template<typename F, SameAs< Tag< erase_if > > T = Tag<erase_if>>
requires (concepts::Predicate<F&, Value const&>)
constexpr friend auto tag_invoke (T, Self &self, F &&function) -> usize
 

Member Function Documentation

◆ at() [1/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::at ( U && needle) -> Optional<Value&>
inlineconstexpr

◆ at() [2/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::at ( U && needle) const -> Optional<Value const&>
inlineconstexpr

◆ at() [3/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::at ( Value const & needle) -> Optional<Value&>
inlineconstexpr

◆ at() [4/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::at ( Value const & needle) const -> Optional<Value const&>
inlineconstexpr

◆ back() [1/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::back ( ) -> Optional<Value&>
inlineconstexpr

◆ back() [2/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::back ( ) const -> Optional<Value const&>
inlineconstexpr

◆ clear()

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
void di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::clear ( )
inlineconstexpr

◆ contains() [1/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::contains ( U && needle) const -> bool
inlineconstexpr

◆ contains() [2/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::contains ( Value const & needle) const -> bool
inlineconstexpr

◆ count() [1/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::count ( U && needle) const -> usize
inlineconstexpr

◆ count() [2/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::count ( Value const & needle) const -> usize
inlineconstexpr

◆ empty()

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::empty ( ) const -> bool
inlineconstexpr

◆ equal_range() [1/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::equal_range ( U && needle) -> View<Iterator>
inlineconstexpr

◆ equal_range() [2/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::equal_range ( U && needle) const -> View<ConstIterator>
inlineconstexpr

◆ equal_range() [3/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::equal_range ( Value const & needle) -> View<Iterator>
inlineconstexpr

◆ equal_range() [4/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::equal_range ( Value const & needle) const -> View<ConstIterator>
inlineconstexpr

◆ erase() [1/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::erase ( Iterator first,
Iterator last ) -> Iterator
inlineconstexpr

◆ erase() [2/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::erase ( Iterator position)
inlineconstexpr

◆ erase() [3/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::erase ( U && needle) -> usize
inlineconstexpr

◆ erase() [4/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::erase ( Value const & needle) -> usize
inlineconstexpr

◆ find() [1/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::find ( U && needle) -> Iterator
inlineconstexpr

◆ find() [2/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::find ( U && needle) const -> ConstIterator
inlineconstexpr

◆ find() [3/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::find ( Value const & needle) -> Iterator
inlineconstexpr

◆ find() [4/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::find ( Value const & needle) const -> ConstIterator
inlineconstexpr

◆ front() [1/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::front ( ) -> Optional<Value&>
inlineconstexpr

◆ front() [2/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::front ( ) const -> Optional<Value const&>
inlineconstexpr

◆ insert() [1/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::insert ( ConstIterator hint,
Node & node )
inlineconstexpr

◆ insert() [2/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::insert ( Node & node)
inlineconstexpr

◆ intersect()

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
void di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::intersect ( Self const & b)
inlineconstexpr

◆ lower_bound() [1/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::lower_bound ( U && needle) -> Iterator requires(
inlineconstexpr

◆ lower_bound() [2/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::lower_bound ( U && needle) const -> ConstIterator requires(
inlineconstexpr

◆ lower_bound() [3/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::lower_bound ( Value const & needle) -> Iterator requires(
inlineconstexpr

◆ lower_bound() [4/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::lower_bound ( Value const & needle) const -> ConstIterator requires(
inlineconstexpr

◆ merge() [1/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::merge ( Self && self)
inlineconstexpr

◆ merge() [2/2]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::merge ( Self & self)
inlineconstexpr

◆ subtract()

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
void di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::subtract ( Self const & b)
inlineconstexpr

◆ upper_bound() [1/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::upper_bound ( U && needle) -> Iterator requires(
inlineconstexpr

◆ upper_bound() [2/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename U>
requires (valid<U>)
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::upper_bound ( U && needle) const -> ConstIterator requires(
inlineconstexpr

◆ upper_bound() [3/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::upper_bound ( Value const & needle) -> Iterator requires(
inlineconstexpr

◆ upper_bound() [4/4]

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
auto di::container::IntrusiveSetInterface< Self, Value, Node, Iterator, ConstIterator, ValidForLookup, is_multi >::upper_bound ( Value const & needle) const -> ConstIterator requires(
inlineconstexpr

Friends And Related Symbol Documentation

◆ operator&

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
friend auto operator& ( Self && a,
Self const & b )
friend

Set intersection.

◆ operator&=

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
friend auto operator&= ( Self & a,
Self const & b ) -> Self& requires(!is_multi)
friend

◆ operator-

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
friend auto operator- ( Self && a,
Self const & b )
friend

Set differerce.

◆ operator-=

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
friend auto operator-= ( Self & a,
Self const & b ) -> Self& requires(!is_multi)
friend

◆ operator|

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
friend auto operator| ( Self && a,
Self && b )
friend

Set union.

◆ operator|=

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
friend auto operator|= ( Self & a,
Self && b ) -> decltype(auto)
friend

◆ tag_invoke

template<typename Self, typename Value, typename Node, typename Iterator, typename ConstIterator, template< typename > typename ValidForLookup, bool is_multi>
template<typename F, SameAs< Tag< erase_if > > T = Tag<erase_if>>
requires (concepts::Predicate<F&, Value const&>)
friend auto tag_invoke ( T ,
Self & self,
F && function ) -> usize
friend
The documentation for this class was generated from the following file: