#include <FlatSet.h>

Public Types
using	iterator = typename KeyContainer::iterator

using	const_iterator = typename KeyContainer::const_iterator

Public Member Functions
bool	empty () const

auto	size () const

auto	begin ()

auto	begin () const

auto	end ()

auto	end () const

bool	contains (Key const &value) const

auto	find (Key const &value) const

auto	find (Key const &value)

template<class... Args>
std::pair< iterator, bool >	emplace (Args &&... args)

std::pair< iterator, bool >	insert (Key const &key)

std::size_t	erase (Key const &key)

auto	erase (const_iterator itr)

void	clear ()

void	shrink_to_fit ()

Private Attributes
KeyContainer	_storage

Friends
std::strong_ordering	operator<=> (FlatSet const &left, FlatSet const &right)=default

bool	operator== (FlatSet const &left, FlatSet const &right)=default

Detailed Description

template<class Key, class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>
class Trinity::Containers::FlatSet< Key, Compare, KeyContainer >

Definition at line 27 of file FlatSet.h.

Member Typedef Documentation

◆ const_iterator

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

using Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::const_iterator = typename KeyContainer::const_iterator

Definition at line 31 of file FlatSet.h.

◆ iterator

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

using Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::iterator = typename KeyContainer::iterator

Definition at line 30 of file FlatSet.h.

Member Function Documentation

◆ begin() [1/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::begin ( )

inline

Definition at line 36 of file FlatSet.h.

Here is the caller graph for this function:

◆ begin() [2/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::begin ( ) const

inline

Definition at line 37 of file FlatSet.h.

◆ clear()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

void Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::clear ( )

inline

Definition at line 95 of file FlatSet.h.

Here is the caller graph for this function:

◆ contains()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

bool Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::contains ( Key const & value ) const

inline

Definition at line 42 of file FlatSet.h.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ emplace()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

template<class... Args>

std::pair< iterator, bool > Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::emplace ( Args &&... args )

inline

Definition at line 70 of file FlatSet.h.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ empty()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

bool Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::empty ( ) const

inline

Definition at line 33 of file FlatSet.h.

Here is the caller graph for this function:

◆ end() [1/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::end ( )

inline

Definition at line 39 of file FlatSet.h.

Here is the caller graph for this function:

◆ end() [2/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::end ( ) const

inline

Definition at line 40 of file FlatSet.h.

◆ erase() [1/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::erase ( const_iterator itr )

inline

Definition at line 93 of file FlatSet.h.

◆ erase() [2/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

std::size_t Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::erase ( Key const & key )

inline

Definition at line 84 of file FlatSet.h.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ find() [1/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::find ( Key const & value )

inline

Definition at line 58 of file FlatSet.h.

Here is the call graph for this function:

◆ find() [2/2]

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::find ( Key const & value ) const

inline

Definition at line 47 of file FlatSet.h.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ insert()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

std::pair< iterator, bool > Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::insert ( Key const & key )

inline

Definition at line 82 of file FlatSet.h.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ shrink_to_fit()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

void Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::shrink_to_fit ( )

inline

Definition at line 97 of file FlatSet.h.

Here is the caller graph for this function:

◆ size()

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

auto Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::size ( ) const

inline

Definition at line 34 of file FlatSet.h.

Here is the caller graph for this function:

Friends And Related Symbol Documentation

◆ operator<=>

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

std::strong_ordering operator<=>	(	FlatSet< Key, Compare, KeyContainer > const &	left,
		FlatSet< Key, Compare, KeyContainer > const &	right
	)

friend

◆ operator==

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

bool operator==	(	FlatSet< Key, Compare, KeyContainer > const &	left,
		FlatSet< Key, Compare, KeyContainer > const &	right
	)

friend

Member Data Documentation

◆ _storage

template<class Key , class Compare = std::less<Key>, class KeyContainer = std::vector<Key>>

KeyContainer Trinity::Containers::FlatSet< Key, Compare, KeyContainer >::_storage

private

Definition at line 103 of file FlatSet.h.

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

common/Containers/FlatSet.h

Public Types

Public Member Functions

Private Attributes

Friends

Detailed Description

Member Typedef Documentation

◆ const_iterator

◆ iterator

Member Function Documentation

◆ begin() [1/2]

◆ begin() [2/2]

◆ clear()

◆ contains()

◆ emplace()

◆ empty()

◆ end() [1/2]

◆ end() [2/2]

◆ erase() [1/2]

◆ erase() [2/2]

◆ find() [1/2]

◆ find() [2/2]

◆ insert()

◆ shrink_to_fit()

◆ size()

Friends And Related Symbol Documentation

◆ operator<=>

◆ operator==

Member Data Documentation

◆ _storage