#include <SetVector.hpp>

Inheritance diagram for mgx::set_vector< Key, Compare, Allocator >:

Public Types
typedef super_type::key_type	key_type

typedef super_type::value_type	value_type

typedef super_type::key_compare	key_compare

typedef super_type::value_compare	value_compare

typedef super_type::allocator_type	allocator_type

typedef super_type::reference	reference

typedef super_type::const_reference	const_reference

typedef super_type::pointer	pointer

typedef super_type::const_pointer	const_pointer

typedef super_type::iterator	iterator

typedef super_type::const_iterator	const_iterator

typedef super_type::size_type	size_type

typedef super_type::difference_type	difference_type

typedef super_type::reverse_iterator	reverse_iterator

typedef super_type::const_reverse_iterator	const_reverse_iterator

Public Types inherited from mgx::multiset_vector< Key, std::less< Key >, std::allocator< Key > >
typedef Key	key_type

typedef Key	value_type

typedef std::less< Key >	key_compare

typedef std::less< Key >	value_compare

typedef std::allocator< Key >	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
	set_vector (const Compare &comp=Compare(), const Allocator &alloc=Allocator())

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

	set_vector (const set_vector &copy)

	set_vector (const Allocator &alloc)

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

	~set_vector ()

set_vector &	operator= (const set_vector &copy)

Public Member Functions inherited from mgx::multiset_vector< Key, std::less< Key >, std::allocator< Key > >
	multiset_vector (const std::less< Key > &comp=std::less< Key >(), const std::allocator< Key > &alloc=std::allocator< Key >())

	multiset_vector (InputIterator first, InputIterator last, const std::less< Key > &comp=std::less< Key >(), const std::allocator< Key > &alloc=std::allocator< Key >())

	multiset_vector (const multiset_vector &copy)

	multiset_vector (const std::allocator< Key > &alloc)

	multiset_vector (const multiset_vector &copy, const std::allocator< Key > &alloc)

	~multiset_vector ()

multiset_vector &	operator= (const multiset_vector &copy)

allocator_type	get_allocator () const NOEXCEPT

iterator	begin () NOEXCEPT

const_iterator	begin () const NOEXCEPT

iterator	end () NOEXCEPT

const_iterator	end () const NOEXCEPT

reverse_iterator	rbegin () NOEXCEPT

const_reverse_iterator	rbegin () const NOEXCEPT

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

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...

bool	empty () const NOEXCEPT

size_type	size () const NOEXCEPT

size_type	max_size () const NOEXCEPT

void	reserve (size_type n)

iterator	insert (const value_type &value)

iterator	insert (const_iterator pos, const value_type &value)

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

key_compare	key_comp () const

value_compare	value_comp () const

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

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

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

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

size_type	erase (const key_type &x)

void	swap (set_vector &other)

iterator	erase (const_iterator position)

size_type	erase (const key_type &x)

iterator	erase (const_iterator first, const_iterator last)

Additional Inherited Members
Public Attributes inherited from mgx::multiset_vector< Key, std::less< Key >, std::allocator< Key > >
const typedef value_type &	const_reference

Protected Member Functions inherited from mgx::multiset_vector< Key, std::less< Key >, std::allocator< Key > >
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)

iterator	_insert_vector (const_iterator it, const T &value)

iterator	_insert (const T &value)

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::set_vector< Key, Compare, Allocator >

Implementation of a set using a sorted vector as container.

Definition at line 554 of file SetVector.hpp.