#include <set.h>

Inheritance diagram for momo::stdish::multiset_adaptor< TTreeSet >:

Public Types
typedef iterator	insert_return_type

typedef key_type	value_type

typedef TreeSet::Iterator	iterator

typedef internal::set_node_handle< typename TreeSet::ExtractedItem >	node_type

Public Types inherited from momo::stdish::set_adaptor< TTreeSet >
typedef TreeSet::Key	key_type

typedef TreeTraits::LessComparer	key_compare

typedef TreeSet	nested_container_type

typedef size_t	size_type

typedef ptrdiff_t	difference_type

typedef key_type	value_type

typedef key_compare	value_compare

typedef std::allocator_traits< typename MemManager::ByteAllocator >::template rebind_alloc< value_type >	allocator_type

typedef TreeSet::ConstIterator	const_iterator

typedef TreeSet::Iterator	iterator

typedef value_type &	reference

typedef const_iterator::Reference	const_reference

typedef value_type *	pointer

typedef const_iterator::Pointer	const_pointer

typedef std::reverse_iterator< iterator >	reverse_iterator

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

typedef internal::set_node_handle< typename TreeSet::ExtractedItem >	node_type

typedef internal::insert_return_type< iterator, node_type >	insert_return_type

Public Member Functions
multiset_adaptor &	operator= (std::initializer_list< value_type > values)

iterator	insert (value_type &&value)

iterator	insert (const value_type &value)

iterator	insert (node_type &&node)

template<typename... ValueArgs>
iterator	emplace (ValueArgs &&... valueArgs)

std::pair< iterator, bool >	insert (value_type &&value)

iterator	insert (const_iterator hint, value_type &&value)

std::pair< iterator, bool >	insert (const value_type &value)

iterator	insert (const_iterator hint, const value_type &value)

insert_return_type	insert (node_type &&node)

iterator	insert (const_iterator hint, node_type &&node)

template<typename Iterator >
void	insert (Iterator first, Iterator last)

void	insert (std::initializer_list< value_type > values)

Public Member Functions inherited from momo::stdish::set_adaptor< TTreeSet >
	set_adaptor ()

	set_adaptor (const allocator_type &alloc)

	set_adaptor (const key_compare &lessComp, const allocator_type &alloc=allocator_type())

template<typename Iterator >
	set_adaptor (Iterator first, Iterator last, const allocator_type &alloc=allocator_type())

template<typename Iterator >
	set_adaptor (Iterator first, Iterator last, const key_compare &lessComp, const allocator_type &alloc=allocator_type())

	set_adaptor (std::initializer_list< value_type > values, const allocator_type &alloc=allocator_type())

	set_adaptor (std::initializer_list< value_type > values, const key_compare &lessComp, const allocator_type &alloc=allocator_type())

	set_adaptor (set_adaptor &&right)

	set_adaptor (set_adaptor &&right, const allocator_type &alloc)

	set_adaptor (const set_adaptor &right)

	set_adaptor (const set_adaptor &right, const allocator_type &alloc)

	~set_adaptor ()=default

set_adaptor &	operator= (set_adaptor &&right) noexcept(momo::internal::ContainerAssignerStd::IsNothrowMoveAssignable< set_adaptor >::value)

set_adaptor &	operator= (const set_adaptor &right)

set_adaptor &	operator= (std::initializer_list< value_type > values)

void	swap (set_adaptor &right) noexcept

const nested_container_type &	get_nested_container () const noexcept

nested_container_type &	get_nested_container () noexcept

const_iterator	begin () const noexcept

const_iterator	end () const noexcept

const_reverse_iterator	rbegin () const noexcept

const_reverse_iterator	rend () const noexcept

const_iterator	cbegin () const noexcept

const_iterator	cend () const noexcept

const_reverse_iterator	crbegin () const noexcept

const_reverse_iterator	crend () const noexcept

key_compare	key_comp () const

value_compare	value_comp () const

allocator_type	get_allocator () const noexcept

size_type	max_size () const noexcept

size_type	size () const noexcept

MOMO_NODISCARD bool	empty () const noexcept

void	clear () noexcept

const_iterator	find (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, const_iterator >	find (const KeyArg &key) const

size_type	count (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, size_type >	count (const KeyArg &key) const

bool	contains (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, bool >	contains (const KeyArg &key) const

const_iterator	lower_bound (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, const_iterator >	lower_bound (const KeyArg &key) const

const_iterator	upper_bound (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, const_iterator >	upper_bound (const KeyArg &key) const

std::pair< const_iterator, const_iterator >	equal_range (const key_type &key) const

template<typename KeyArg >
momo::internal::EnableIf< IsValidKeyArg< KeyArg >::value, std::pair< const_iterator, const_iterator > >	equal_range (const KeyArg &key) const

std::pair< iterator, bool >	insert (value_type &&value)

iterator	insert (const_iterator hint, value_type &&value)

std::pair< iterator, bool >	insert (const value_type &value)

iterator	insert (const_iterator hint, const value_type &value)

insert_return_type	insert (node_type &&node)

iterator	insert (const_iterator hint, node_type &&node)

template<typename Iterator >
void	insert (Iterator first, Iterator last)

void	insert (std::initializer_list< value_type > values)

template<typename... ValueArgs>
std::pair< iterator, bool >	emplace (ValueArgs &&... valueArgs)

template<typename ValueArg >
momo::internal::EnableIf< std::is_same< key_type, typename std::decay< ValueArg >::type >::value, std::pair< iterator, bool > >	emplace (ValueArg &&valueArg)

template<typename... ValueArgs>
iterator	emplace_hint (const_iterator hint, ValueArgs &&... valueArgs)

template<typename ValueArg >
momo::internal::EnableIf< std::is_same< key_type, typename std::decay< ValueArg >::type >::value, iterator >	emplace_hint (const_iterator hint, ValueArg &&valueArg)

iterator	erase (const_iterator where)

iterator	erase (const_iterator first, const_iterator last)

size_type	erase (const key_type &key)

node_type	extract (const_iterator where)

node_type	extract (const key_type &key)

template<typename Set >
void	merge (Set &&set_adaptor)

Friends
void	swap (multiset_adaptor &left, multiset_adaptor &right) noexcept

Member Typedef Documentation

◆ insert_return_type

template<typename TTreeSet >

typedef iterator momo::stdish::multiset_adaptor< TTreeSet >::insert_return_type

◆ iterator

template<typename TTreeSet >

typedef TreeSet::Iterator momo::stdish::set_adaptor< TTreeSet >::iterator

◆ node_type

template<typename TTreeSet >

typedef internal::set_node_handle<typename TreeSet::ExtractedItem> momo::stdish::set_adaptor< TTreeSet >::node_type

◆ value_type

template<typename TTreeSet >

typedef key_type momo::stdish::set_adaptor< TTreeSet >::value_type

Member Function Documentation

◆ emplace()

template<typename TTreeSet >

template<typename... ValueArgs>

iterator momo::stdish::multiset_adaptor< TTreeSet >::emplace ( ValueArgs &&... valueArgs )

inline

◆ insert() [1/11]

template<typename TTreeSet >

std::pair<iterator, bool> momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [2/11]

template<typename TTreeSet >

iterator momo::stdish::multiset_adaptor< TTreeSet >::insert ( const value_type & value )

inline

◆ insert() [3/11]

template<typename TTreeSet >

iterator momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [4/11]

template<typename TTreeSet >

iterator momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [5/11]

template<typename TTreeSet >

iterator momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [6/11]

template<typename TTreeSet >

template<typename Iterator >

void momo::stdish::set_adaptor< TTreeSet >::insert ( typename Iterator )

inline

◆ insert() [7/11]

template<typename TTreeSet >

insert_return_type momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [8/11]

template<typename TTreeSet >

iterator momo::stdish::multiset_adaptor< TTreeSet >::insert ( node_type && node )

inline

◆ insert() [9/11]

template<typename TTreeSet >

void momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [10/11]

template<typename TTreeSet >

std::pair<iterator, bool> momo::stdish::set_adaptor< TTreeSet >::insert

inline

◆ insert() [11/11]

template<typename TTreeSet >

iterator momo::stdish::multiset_adaptor< TTreeSet >::insert ( value_type && value )

inline

◆ operator=()

template<typename TTreeSet >

multiset_adaptor& momo::stdish::multiset_adaptor< TTreeSet >::operator= ( std::initializer_list< value_type > values )

inline

Friends And Related Function Documentation

◆ swap

template<typename TTreeSet >

void swap	(	multiset_adaptor< TTreeSet > &	left,
		multiset_adaptor< TTreeSet > &	right
	)

friend

The documentation for this class was generated from the following file:

include/momo/stdish/set.h

Public Types

Public Member Functions

Friends

Member Typedef Documentation

◆ insert_return_type

◆ iterator

◆ node_type

◆ value_type

Member Function Documentation

◆ emplace()

◆ insert() [1/11]

◆ insert() [2/11]

◆ insert() [3/11]

◆ insert() [4/11]

◆ insert() [5/11]

◆ insert() [6/11]

◆ insert() [7/11]

◆ insert() [8/11]

◆ insert() [9/11]

◆ insert() [10/11]

◆ insert() [11/11]

◆ operator=()

Friends And Related Function Documentation

◆ swap