#include <set.h>

Inheritance diagram for frozen::set< Key, N, Compare >:

Collaboration diagram for frozen::set< Key, N, Compare >:

Public Types
using	key_type = Key
using	value_type = Key
using	size_type = typename container_type::size_type
using	difference_type = typename container_type::size_type
using	key_compare = Compare
using	value_compare = Compare
using	reference = typename container_type::const_reference
using	const_reference = reference
using	pointer = typename container_type::const_pointer
using	const_pointer = pointer
using	iterator = typename container_type::const_iterator
using	reverse_iterator = std::reverse_iterator<iterator>
using	const_iterator = iterator
using	const_reverse_iterator = std::reverse_iterator<const_iterator>

Public Member Functions
constexpr	set (const set &other)=default
constexpr	set (container_type keys, Compare const &comp)
constexpr	set (container_type keys)
constexpr	set (std::initializer_list< Key > keys, Compare const &comp)
constexpr	set (std::initializer_list< Key > keys)
constexpr set &	operator= (const set &other)=default
constexpr bool	empty () const
constexpr size_type	size () const
constexpr size_type	max_size () const
template<class KeyType>
constexpr std::size_t	count (KeyType const &key) const
template<class KeyType>
constexpr const_iterator	find (KeyType const &key) const
template<class KeyType>
constexpr bool	contains (KeyType const &key) const
template<class KeyType>
constexpr std::pair< const_iterator, const_iterator >	equal_range (KeyType const &key) const
template<class KeyType>
constexpr const_iterator	lower_bound (KeyType const &key) const
template<class KeyType>
constexpr const_iterator	upper_bound (KeyType const &key) const
constexpr const key_compare &	key_comp () const
constexpr const key_compare &	value_comp () const
constexpr const_iterator	begin () const
constexpr const_iterator	cbegin () const
constexpr const_iterator	end () const
constexpr const_iterator	cend () const
constexpr const_reverse_iterator	rbegin () const
constexpr const_reverse_iterator	crbegin () const
constexpr const_reverse_iterator	rend () const
constexpr const_reverse_iterator	crend () const
constexpr bool	operator== (set const &rhs) const
constexpr bool	operator!= (set const &rhs) const
constexpr bool	operator< (set const &rhs) const
constexpr bool	operator<= (set const &rhs) const
constexpr bool	operator> (set const &rhs) const
constexpr bool	operator>= (set const &rhs) const

Member Typedef Documentation

◆ const_iterator

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::const_iterator = iterator

◆ const_pointer

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::const_pointer = pointer

◆ const_reference

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::const_reference = reference

◆ const_reverse_iterator

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::const_reverse_iterator = std::reverse_iterator<const_iterator>

◆ difference_type

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::difference_type = typename container_type::size_type

◆ iterator

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::iterator = typename container_type::const_iterator

◆ key_compare

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::key_compare = Compare

◆ key_type

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::key_type = Key

◆ pointer

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::pointer = typename container_type::const_pointer

◆ reference

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::reference = typename container_type::const_reference

◆ reverse_iterator

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::reverse_iterator = std::reverse_iterator<iterator>

◆ size_type

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::size_type = typename container_type::size_type

◆ value_compare

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::value_compare = Compare

◆ value_type

template<class Key, std::size_t N, class Compare = std::less<Key>>

using frozen::set< Key, N, Compare >::value_type = Key

Constructor & Destructor Documentation

◆ set() [1/5]

template<class Key, std::size_t N, class Compare = std::less<Key>>

frozen::set< Key, N, Compare >::set ( const set< Key, N, Compare > & other )

constexprdefault

References set().

Referenced by operator!=(), operator<(), operator<=(), operator=(), operator==(), operator>(), operator>=(), set(), set(), set(), and set().

◆ set() [2/5]

template<class Key, std::size_t N, class Compare = std::less<Key>>

frozen::set< Key, N, Compare >::set	(	container_type	keys,
		Compare const &	comp )

inlineconstexpr

References value_comp().

◆ set() [3/5]

template<class Key, std::size_t N, class Compare = std::less<Key>>

frozen::set< Key, N, Compare >::set ( container_type keys )

inlineexplicitconstexpr

References set().

◆ set() [4/5]

template<class Key, std::size_t N, class Compare = std::less<Key>>

frozen::set< Key, N, Compare >::set	(	std::initializer_list< Key >	keys,
		Compare const &	comp )

inlineconstexpr

References set().

◆ set() [5/5]

template<class Key, std::size_t N, class Compare = std::less<Key>>

frozen::set< Key, N, Compare >::set ( std::initializer_list< Key > keys )

inlineconstexpr

References set().

Member Function Documentation

◆ begin()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_iterator frozen::set< Key, N, Compare >::begin ( ) const

inlineconstexpr

Referenced by operator<(), operator==(), and operator>().

◆ cbegin()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_iterator frozen::set< Key, N, Compare >::cbegin ( ) const

inlineconstexpr

◆ cend()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_iterator frozen::set< Key, N, Compare >::cend ( ) const

inlineconstexpr

◆ contains()

template<class Key, std::size_t N, class Compare = std::less<Key>>

template<class KeyType>

bool frozen::set< Key, N, Compare >::contains ( KeyType const & key ) const

inlineconstexpr

References find().

◆ count()

template<class Key, std::size_t N, class Compare = std::less<Key>>

template<class KeyType>

std::size_t frozen::set< Key, N, Compare >::count ( KeyType const & key ) const

inlineconstexpr

References frozen::bits::binary_search(), and value_comp().

◆ crbegin()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_reverse_iterator frozen::set< Key, N, Compare >::crbegin ( ) const

inlineconstexpr

◆ crend()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_reverse_iterator frozen::set< Key, N, Compare >::crend ( ) const

inlineconstexpr

◆ empty()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::empty ( ) const

inlineconstexpr

◆ end()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_iterator frozen::set< Key, N, Compare >::end ( ) const

inlineconstexpr

Referenced by equal_range(), frozen::set< Key, 0, Compare >::equal_range(), find(), frozen::set< Key, 0, Compare >::find(), lower_bound(), frozen::set< Key, 0, Compare >::lower_bound(), operator<(), operator==(), operator>(), upper_bound(), and frozen::set< Key, 0, Compare >::upper_bound().

◆ equal_range()

template<class Key, std::size_t N, class Compare = std::less<Key>>

template<class KeyType>

std::pair< const_iterator, const_iterator > frozen::set< Key, N, Compare >::equal_range ( KeyType const & key ) const

inlineconstexpr

References end(), and lower_bound().

◆ find()

template<class Key, std::size_t N, class Compare = std::less<Key>>

template<class KeyType>

const_iterator frozen::set< Key, N, Compare >::find ( KeyType const & key ) const

inlineconstexpr

References end(), lower_bound(), and value_comp().

Referenced by contains().

◆ key_comp()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const key_compare & frozen::set< Key, N, Compare >::key_comp ( ) const

inlineconstexpr

References value_comp().

◆ lower_bound()

template<class Key, std::size_t N, class Compare = std::less<Key>>

template<class KeyType>

const_iterator frozen::set< Key, N, Compare >::lower_bound ( KeyType const & key ) const

inlineconstexpr

References end(), frozen::bits::lower_bound(), and value_comp().

Referenced by equal_range(), and find().

◆ max_size()

template<class Key, std::size_t N, class Compare = std::less<Key>>

size_type frozen::set< Key, N, Compare >::max_size ( ) const

inlineconstexpr

◆ operator!=()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::operator!= ( set< Key, N, Compare > const & rhs ) const

inlineconstexpr

References set().

◆ operator<()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::operator< ( set< Key, N, Compare > const & rhs ) const

inlineconstexpr

References begin(), end(), frozen::bits::lexicographical_compare(), and set().

◆ operator<=()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::operator<= ( set< Key, N, Compare > const & rhs ) const

inlineconstexpr

References set().

◆ operator=()

template<class Key, std::size_t N, class Compare = std::less<Key>>

set & frozen::set< Key, N, Compare >::operator= ( const set< Key, N, Compare > & other )

constexprdefault

References set().

◆ operator==()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::operator== ( set< Key, N, Compare > const & rhs ) const

inlineconstexpr

References begin(), end(), frozen::bits::equal(), and set().

◆ operator>()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::operator> ( set< Key, N, Compare > const & rhs ) const

inlineconstexpr

References begin(), end(), frozen::bits::lexicographical_compare(), and set().

◆ operator>=()

template<class Key, std::size_t N, class Compare = std::less<Key>>

bool frozen::set< Key, N, Compare >::operator>= ( set< Key, N, Compare > const & rhs ) const

inlineconstexpr

References set().

◆ rbegin()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_reverse_iterator frozen::set< Key, N, Compare >::rbegin ( ) const

inlineconstexpr

◆ rend()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const_reverse_iterator frozen::set< Key, N, Compare >::rend ( ) const

inlineconstexpr

◆ size()

template<class Key, std::size_t N, class Compare = std::less<Key>>

size_type frozen::set< Key, N, Compare >::size ( ) const

inlineconstexpr

◆ upper_bound()

template<class Key, std::size_t N, class Compare = std::less<Key>>

template<class KeyType>

const_iterator frozen::set< Key, N, Compare >::upper_bound ( KeyType const & key ) const

inlineconstexpr

References end(), frozen::bits::lower_bound(), and value_comp().

◆ value_comp()

template<class Key, std::size_t N, class Compare = std::less<Key>>

const key_compare & frozen::set< Key, N, Compare >::value_comp ( ) const

inlineconstexpr

Referenced by count(), find(), key_comp(), frozen::set< Key, 0, Compare >::key_comp(), lower_bound(), set(), and upper_bound().

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

set.h

Public Types

Public Member Functions

Member Typedef Documentation

◆ const_iterator

◆ const_pointer

◆ const_reference

◆ const_reverse_iterator

◆ difference_type

◆ iterator

◆ key_compare

◆ key_type

◆ pointer

◆ reference

◆ reverse_iterator

◆ size_type

◆ value_compare

◆ value_type

Constructor & Destructor Documentation

◆ set() [1/5]

◆ set() [2/5]

◆ set() [3/5]

◆ set() [4/5]

◆ set() [5/5]

Member Function Documentation

◆ begin()

◆ cbegin()

◆ cend()

◆ contains()

◆ count()

◆ crbegin()

◆ crend()

◆ empty()

◆ end()

◆ equal_range()

◆ find()

◆ key_comp()

◆ lower_bound()

◆ max_size()

◆ operator!=()

◆ operator<()

◆ operator<=()

◆ operator=()

◆ operator==()

◆ operator>()

◆ operator>=()

◆ rbegin()

◆ rend()

◆ size()

◆ upper_bound()

◆ value_comp()