#include <SetVector.hpp>

Public Types
typedef Key	key_type

typedef Key	value_type

typedef Compare	key_compare

typedef Compare	value_compare

typedef Allocator	allocator_type

typedef value_type &	reference

typedef allocator_type::pointer	pointer

typedef allocator_type::const_pointer	const_pointer

typedef content_t::const_iterator	iterator

typedef content_t::const_iterator	const_iterator

typedef content_t::size_type	size_type

typedef content_t::difference_type	difference_type

typedef std::reverse_iterator< iterator >	reverse_iterator

typedef std::reverse_iterator< const_iterator >	const_reverse_iterator

Public Member Functions
Construct/copy/destroy
	multiset_vector (const Compare &comp=Compare(), const Allocator &alloc=Allocator())

template<typename InputIterator >
	multiset_vector (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &alloc=Allocator())

	multiset_vector (const multiset_vector &copy)

	multiset_vector (const Allocator &alloc)

	multiset_vector (const multiset_vector &copy, const Allocator &alloc)

	~multiset_vector ()

multiset_vector &	operator= (const multiset_vector &copy)

allocator_type	get_allocator () const NOEXCEPT

Iterators
iterator	begin () NOEXCEPT

iterator	end () NOEXCEPT

const_iterator	begin () const NOEXCEPT

const_iterator	end () const NOEXCEPT

reverse_iterator	rbegin () NOEXCEPT

reverse_iterator	rend () 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

Vector-like access
const_reference	operator[] (size_type i) const

const_reference	at (size_type i) const

const_pointer	data () const NOEXCEPT

const_reference	front () const

const_reference	back () const

const content_t &	vector () const
	Return the underlying vector. More...

Capacity
bool	empty () const NOEXCEPT

size_type	size () const NOEXCEPT

size_type	max_size () const NOEXCEPT

void	reserve (size_type n)

Modifiers
iterator	insert (const value_type &value)

iterator	insert (const_iterator pos, const value_type &value)

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

iterator	erase (const_iterator position)

size_type	erase (const key_type &x)

iterator	erase (const_iterator first, const_iterator last)

void	swap (multiset_vector &other)

void	clear () NOEXCEPT

Observers
key_compare	key_comp () const

value_compare	value_comp () const

Public Attributes
const typedef value_type &	const_reference

Set operations
iterator	find (const key_type &k)

const_iterator	find (const key_type &k) const

size_type	count (const key_type &k) const

iterator	lower_bound (const key_type &k)

const_iterator	lower_bound (const key_type &k) const

iterator	upper_bound (const key_type &k)

const_iterator	upper_bound (const key_type &k) const

std::pair< iterator, iterator >	equal_range (const key_type &k)

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

bool	operator== (const multiset_vector &v1, const multiset_vector &v2)

bool	operator!= (const multiset_vector &v1, const multiset_vector &v2)

bool	operator< (const multiset_vector &v1, const multiset_vector &v2)

bool	operator> (const multiset_vector &v1, const multiset_vector &v2)

bool	operator<= (const multiset_vector &v1, const multiset_vector &v2)

bool	operator>= (const multiset_vector &v1, const multiset_vector &v2)

content_t::iterator	remove_iterator_const (const_iterator it)

void	sort ()

iterator	_find_insert_range (const_iterator first, const_iterator last, const value_type &value) const

const_iterator	_find_insert_hint (const_iterator hint, const value_type &value)

template<typename T >
iterator	_insert_vector (const_iterator it, const T &value)

template<typename T >
iterator	_insert (const T &value)

template<typename T >
iterator	_insert_hint (const_iterator hint, const T &value)

bool	equiv_keys (const key_type &k1, const key_type &k2) const

bool	differ_keys (const key_type &k1, const key_type &k2) const

bool	compare (const key_type &k1, const key_type &k2) const

Detailed Description

template<typename Key, typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>
class mgx::multiset_vector< Key, Compare, Allocator >

Implementation of a multiset using a sorted vector as container.

Definition at line 37 of file SetVector.hpp.

Member Typedef Documentation

◆ allocator_type

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef Allocator mgx::multiset_vector< Key, Compare, Allocator >::allocator_type

Definition at line 47 of file SetVector.hpp.

◆ const_iterator

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef content_t::const_iterator mgx::multiset_vector< Key, Compare, Allocator >::const_iterator

Definition at line 60 of file SetVector.hpp.

◆ const_pointer

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef allocator_type::const_pointer mgx::multiset_vector< Key, Compare, Allocator >::const_pointer

Definition at line 56 of file SetVector.hpp.

◆ const_reverse_iterator

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef std::reverse_iterator<const_iterator> mgx::multiset_vector< Key, Compare, Allocator >::const_reverse_iterator

Definition at line 65 of file SetVector.hpp.

◆ difference_type

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef content_t::difference_type mgx::multiset_vector< Key, Compare, Allocator >::difference_type

Definition at line 62 of file SetVector.hpp.

◆ iterator

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef content_t::const_iterator mgx::multiset_vector< Key, Compare, Allocator >::iterator

Definition at line 59 of file SetVector.hpp.

◆ key_compare

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef Compare mgx::multiset_vector< Key, Compare, Allocator >::key_compare

Definition at line 45 of file SetVector.hpp.

◆ key_type

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef Key mgx::multiset_vector< Key, Compare, Allocator >::key_type

Definition at line 43 of file SetVector.hpp.

◆ pointer

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef allocator_type::pointer mgx::multiset_vector< Key, Compare, Allocator >::pointer

Definition at line 55 of file SetVector.hpp.

◆ reference

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef value_type& mgx::multiset_vector< Key, Compare, Allocator >::reference

Definition at line 48 of file SetVector.hpp.

◆ reverse_iterator

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef std::reverse_iterator<iterator> mgx::multiset_vector< Key, Compare, Allocator >::reverse_iterator

Definition at line 64 of file SetVector.hpp.

◆ size_type

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef content_t::size_type mgx::multiset_vector< Key, Compare, Allocator >::size_type

Definition at line 61 of file SetVector.hpp.

◆ value_compare

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef Compare mgx::multiset_vector< Key, Compare, Allocator >::value_compare

Definition at line 46 of file SetVector.hpp.

◆ value_type

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

typedef Key mgx::multiset_vector< Key, Compare, Allocator >::value_type

Definition at line 44 of file SetVector.hpp.

Constructor & Destructor Documentation

◆ multiset_vector() [1/5]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

mgx::multiset_vector< Key, Compare, Allocator >::multiset_vector	(	const Compare &	comp = `Compare()`,
		const Allocator &	alloc = `Allocator()`
	)

inlineexplicit

Definition at line 69 of file SetVector.hpp.

◆ multiset_vector() [2/5]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

template<typename InputIterator >

mgx::multiset_vector< Key, Compare, Allocator >::multiset_vector	(	InputIterator	first,
		InputIterator	last,
		const Compare &	comp = `Compare()`,
		const Allocator &	alloc = `Allocator()`
	)

inline

Definition at line 76 of file SetVector.hpp.

◆ multiset_vector() [3/5]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

mgx::multiset_vector< Key, Compare, Allocator >::multiset_vector ( const multiset_vector< Key, Compare, Allocator > & copy )

inline

Definition at line 88 of file SetVector.hpp.

◆ multiset_vector() [4/5]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

mgx::multiset_vector< Key, Compare, Allocator >::multiset_vector ( const Allocator & alloc )

inlineexplicit

Definition at line 95 of file SetVector.hpp.

◆ multiset_vector() [5/5]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

mgx::multiset_vector< Key, Compare, Allocator >::multiset_vector	(	const multiset_vector< Key, Compare, Allocator > &	copy,
		const Allocator &	alloc
	)

inline

Definition at line 101 of file SetVector.hpp.

◆ ~multiset_vector()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

mgx::multiset_vector< Key, Compare, Allocator >::~multiset_vector ( )

inline

Definition at line 121 of file SetVector.hpp.

Member Function Documentation

◆ _find_insert_hint()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::_find_insert_hint	(	const_iterator	hint,
		const value_type &	value
	)

inlineprotected

Definition at line 468 of file SetVector.hpp.

◆ _find_insert_range()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::_find_insert_range	(	const_iterator	first,
		const_iterator	last,
		const value_type &	value
	)		const

inlineprotected

Definition at line 463 of file SetVector.hpp.

◆ _insert()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

template<typename T >

iterator mgx::multiset_vector< Key, Compare, Allocator >::_insert ( const T & value )

inlineprotected

Definition at line 509 of file SetVector.hpp.

◆ _insert_hint()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

template<typename T >

iterator mgx::multiset_vector< Key, Compare, Allocator >::_insert_hint	(	const_iterator	hint,
		const T &	value
	)

inlineprotected

Definition at line 520 of file SetVector.hpp.

◆ _insert_vector()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

template<typename T >

iterator mgx::multiset_vector< Key, Compare, Allocator >::_insert_vector	(	const_iterator	it,
		const T &	value
	)

inlineprotected

Definition at line 499 of file SetVector.hpp.

◆ at()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reference mgx::multiset_vector< Key, Compare, Allocator >::at ( size_type i ) const

inline

Definition at line 201 of file SetVector.hpp.

◆ back()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reference mgx::multiset_vector< Key, Compare, Allocator >::back ( ) const

inline

Definition at line 213 of file SetVector.hpp.

◆ begin() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::begin ( ) const

inline

Definition at line 157 of file SetVector.hpp.

◆ begin() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::begin ( )

inline

Definition at line 150 of file SetVector.hpp.

◆ cbegin()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::cbegin ( ) const

inline

Definition at line 178 of file SetVector.hpp.

◆ cend()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::cend ( ) const

inline

Definition at line 181 of file SetVector.hpp.

◆ clear()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void mgx::multiset_vector< Key, Compare, Allocator >::clear ( )

inline

Definition at line 325 of file SetVector.hpp.

◆ compare()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool mgx::multiset_vector< Key, Compare, Allocator >::compare	(	const key_type &	k1,
		const key_type &	k2
	)		const

inlineprotected

Definition at line 537 of file SetVector.hpp.

◆ count()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

size_type mgx::multiset_vector< Key, Compare, Allocator >::count ( const key_type & k ) const

inline

Definition at line 358 of file SetVector.hpp.

◆ crbegin()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reverse_iterator mgx::multiset_vector< Key, Compare, Allocator >::crbegin ( ) const

inline

Definition at line 185 of file SetVector.hpp.

◆ crend()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reverse_iterator mgx::multiset_vector< Key, Compare, Allocator >::crend ( ) const

inline

Definition at line 188 of file SetVector.hpp.

◆ data()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_pointer mgx::multiset_vector< Key, Compare, Allocator >::data ( ) const

inline

Definition at line 205 of file SetVector.hpp.

◆ differ_keys()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool mgx::multiset_vector< Key, Compare, Allocator >::differ_keys	(	const key_type &	k1,
		const key_type &	k2
	)		const

inlineprotected

Definition at line 532 of file SetVector.hpp.

◆ empty()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool mgx::multiset_vector< Key, Compare, Allocator >::empty ( ) const

inline

Definition at line 227 of file SetVector.hpp.

◆ end() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::end ( ) const

inline

Definition at line 160 of file SetVector.hpp.

◆ end() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::end ( )

inline

Definition at line 153 of file SetVector.hpp.

◆ equal_range() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

std::pair<iterator, iterator> mgx::multiset_vector< Key, Compare, Allocator >::equal_range ( const key_type & k )

inline

Definition at line 385 of file SetVector.hpp.

◆ equal_range() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

std::pair<const_iterator, const_iterator> mgx::multiset_vector< Key, Compare, Allocator >::equal_range ( const key_type & k ) const

inline

Definition at line 393 of file SetVector.hpp.

◆ equiv_keys()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool mgx::multiset_vector< Key, Compare, Allocator >::equiv_keys	(	const key_type &	k1,
		const key_type &	k2
	)		const

inlineprotected

Definition at line 527 of file SetVector.hpp.

◆ erase() [1/3]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

size_type mgx::multiset_vector< Key, Compare, Allocator >::erase ( const key_type & x )

inline

Definition at line 302 of file SetVector.hpp.

◆ erase() [2/3]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::erase	(	const_iterator	first,
		const_iterator	last
	)

inline

Definition at line 314 of file SetVector.hpp.

◆ erase() [3/3]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::erase ( const_iterator position )

inline

Definition at line 298 of file SetVector.hpp.

◆ find() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::find ( const key_type & k )

inline

Definition at line 345 of file SetVector.hpp.

◆ find() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::find ( const key_type & k ) const

inline

Definition at line 350 of file SetVector.hpp.

◆ front()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reference mgx::multiset_vector< Key, Compare, Allocator >::front ( ) const

inline

Definition at line 209 of file SetVector.hpp.

◆ get_allocator()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

allocator_type mgx::multiset_vector< Key, Compare, Allocator >::get_allocator ( ) const

inline

Definition at line 142 of file SetVector.hpp.

◆ insert() [1/3]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::insert ( const value_type & value )

inline

Definition at line 279 of file SetVector.hpp.

◆ insert() [2/3]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::insert	(	const_iterator	pos,
		const value_type &	value
	)

inline

Definition at line 283 of file SetVector.hpp.

◆ insert() [3/3]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

template<typename InputIterator >

void mgx::multiset_vector< Key, Compare, Allocator >::insert	(	InputIterator	first,
		InputIterator	last
	)

inline

Definition at line 287 of file SetVector.hpp.

◆ key_comp()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

key_compare mgx::multiset_vector< Key, Compare, Allocator >::key_comp ( ) const

inline

Definition at line 333 of file SetVector.hpp.

◆ lower_bound() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::lower_bound ( const key_type & k )

inline

Definition at line 365 of file SetVector.hpp.

◆ lower_bound() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::lower_bound ( const key_type & k ) const

inline

Definition at line 370 of file SetVector.hpp.

◆ max_size()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

size_type mgx::multiset_vector< Key, Compare, Allocator >::max_size ( ) const

inline

Definition at line 233 of file SetVector.hpp.

◆ operator=()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

multiset_vector& mgx::multiset_vector< Key, Compare, Allocator >::operator= ( const multiset_vector< Key, Compare, Allocator > & copy )

inline

Definition at line 134 of file SetVector.hpp.

◆ operator[]()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reference mgx::multiset_vector< Key, Compare, Allocator >::operator[] ( size_type i ) const

inline

Definition at line 197 of file SetVector.hpp.

◆ rbegin() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reverse_iterator mgx::multiset_vector< Key, Compare, Allocator >::rbegin ( ) const

inline

Definition at line 171 of file SetVector.hpp.

◆ rbegin() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

reverse_iterator mgx::multiset_vector< Key, Compare, Allocator >::rbegin ( )

inline

Definition at line 164 of file SetVector.hpp.

◆ remove_iterator_const()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

content_t::iterator mgx::multiset_vector< Key, Compare, Allocator >::remove_iterator_const ( const_iterator it )

inlineprotected

Definition at line 452 of file SetVector.hpp.

◆ rend() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_reverse_iterator mgx::multiset_vector< Key, Compare, Allocator >::rend ( ) const

inline

Definition at line 174 of file SetVector.hpp.

◆ rend() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

reverse_iterator mgx::multiset_vector< Key, Compare, Allocator >::rend ( )

inline

Definition at line 167 of file SetVector.hpp.

◆ reserve()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void mgx::multiset_vector< Key, Compare, Allocator >::reserve ( size_type n )

inline

Definition at line 243 of file SetVector.hpp.

◆ size()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

size_type mgx::multiset_vector< Key, Compare, Allocator >::size ( ) const

inline

Definition at line 230 of file SetVector.hpp.

◆ sort()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void mgx::multiset_vector< Key, Compare, Allocator >::sort ( )

inlineprotected

Definition at line 456 of file SetVector.hpp.

◆ swap()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void mgx::multiset_vector< Key, Compare, Allocator >::swap ( multiset_vector< Key, Compare, Allocator > & other )

inline

Definition at line 319 of file SetVector.hpp.

◆ upper_bound() [1/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator mgx::multiset_vector< Key, Compare, Allocator >::upper_bound ( const key_type & k )

inline

Definition at line 375 of file SetVector.hpp.

◆ upper_bound() [2/2]

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const_iterator mgx::multiset_vector< Key, Compare, Allocator >::upper_bound ( const key_type & k ) const

inline

Definition at line 380 of file SetVector.hpp.

◆ value_comp()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

value_compare mgx::multiset_vector< Key, Compare, Allocator >::value_comp ( ) const

inline

Definition at line 336 of file SetVector.hpp.

◆ vector()

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const content_t& mgx::multiset_vector< Key, Compare, Allocator >::vector ( ) const

inline

Return the underlying vector.

Definition at line 218 of file SetVector.hpp.

Friends And Related Function Documentation

◆ operator!=

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool operator!=	(	const multiset_vector< Key, Compare, Allocator > &	v1,
		const multiset_vector< Key, Compare, Allocator > &	v2
	)

friend

Definition at line 409 of file SetVector.hpp.

◆ operator<

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool operator<	(	const multiset_vector< Key, Compare, Allocator > &	v1,
		const multiset_vector< Key, Compare, Allocator > &	v2
	)

friend

Definition at line 413 of file SetVector.hpp.

◆ operator<=

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool operator<=	(	const multiset_vector< Key, Compare, Allocator > &	v1,
		const multiset_vector< Key, Compare, Allocator > &	v2
	)

friend

Definition at line 443 of file SetVector.hpp.

◆ operator==

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool operator==	(	const multiset_vector< Key, Compare, Allocator > &	v1,
		const multiset_vector< Key, Compare, Allocator > &	v2
	)

friend

Definition at line 399 of file SetVector.hpp.

◆ operator>

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool operator>	(	const multiset_vector< Key, Compare, Allocator > &	v1,
		const multiset_vector< Key, Compare, Allocator > &	v2
	)

friend

Definition at line 428 of file SetVector.hpp.

◆ operator>=

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool operator>=	(	const multiset_vector< Key, Compare, Allocator > &	v1,
		const multiset_vector< Key, Compare, Allocator > &	v2
	)

friend

Definition at line 447 of file SetVector.hpp.

Member Data Documentation

◆ const_reference

template<typename Key , typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const typedef value_type& mgx::multiset_vector< Key, Compare, Allocator >::const_reference

Definition at line 49 of file SetVector.hpp.

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

src/SetVector.hpp

Public Types

Public Member Functions

Public Attributes

Set operations

Detailed Description

template<typename Key, typename Compare = std::less<Key>, class Allocator = std::allocator<Key>> class mgx::multiset_vector< Key, Compare, Allocator >

Member Typedef Documentation

◆ allocator_type

◆ const_iterator

◆ const_pointer

◆ const_reverse_iterator

◆ difference_type

◆ iterator

◆ key_compare

◆ key_type

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_compare

◆ value_type

Constructor & Destructor Documentation

◆ multiset_vector() [1/5]

◆ multiset_vector() [2/5]

◆ multiset_vector() [3/5]

◆ multiset_vector() [4/5]

◆ multiset_vector() [5/5]

◆ ~multiset_vector()

Member Function Documentation

◆ _find_insert_hint()

◆ _find_insert_range()

◆ _insert()

◆ _insert_hint()

◆ _insert_vector()

◆ at()

◆ back()

◆ begin() [1/2]

◆ begin() [2/2]

◆ cbegin()

◆ cend()

◆ clear()

◆ compare()

◆ count()

◆ crbegin()

◆ crend()

◆ data()

◆ differ_keys()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ equal_range() [1/2]

◆ equal_range() [2/2]

◆ equiv_keys()

◆ erase() [1/3]

◆ erase() [2/3]

◆ erase() [3/3]

◆ find() [1/2]

◆ find() [2/2]

◆ front()

◆ get_allocator()

◆ insert() [1/3]

◆ insert() [2/3]

◆ insert() [3/3]

◆ key_comp()

◆ lower_bound() [1/2]

◆ lower_bound() [2/2]

◆ max_size()

◆ operator=()

◆ operator[]()

◆ rbegin() [1/2]

◆ rbegin() [2/2]

◆ remove_iterator_const()

◆ rend() [1/2]

◆ rend() [2/2]

◆ reserve()

◆ size()

◆ sort()

◆ swap()

◆ upper_bound() [1/2]

◆ upper_bound() [2/2]

template<typename Key, typename Compare = std::less<Key>, class Allocator = std::allocator<Key>>
class mgx::multiset_vector< Key, Compare, Allocator >