Detailed Description

template<typename Key, typename Value, typename Compare = less<Key>, typename Allocator = allocator_slab<char>>
class fl::MapRedBlackTree< Key, Value, Compare, Allocator >

Definition at line 998 of file rbtree.h.

#include <rbtree.h>

Inheritance diagram for fl::MapRedBlackTree< Key, Value, Compare, Allocator >:

Collaboration diagram for fl::MapRedBlackTree< Key, Value, Compare, Allocator >:

Classes
struct	PairCompare

class	value_compare

Public Types
using	allocator_type = Allocator

using	const_iterator = typename TreeType::const_iterator

using	const_pointer = const value_type*

using	const_reference = const value_type&

using	const_reverse_iterator = typename TreeType::const_reverse_iterator

using	difference_type = ptrdiff_t

using	iterator = typename TreeType::iterator

using	key_compare = Compare

using	key_type = Key

using	mapped_type = Value

using	pointer = value_type*

using	reference = value_type&

using	reverse_iterator = typename TreeType::reverse_iterator

using	size_type = fl::size

using	value_type = fl::pair<Key, Value>

Public Member Functions
	MapRedBlackTree (const Compare &comp=Compare(), const Allocator &alloc=Allocator())

	MapRedBlackTree (const MapRedBlackTree &other) FL_NOEXCEPT=default

	MapRedBlackTree (fl::initializer_list< value_type > init, const Compare &comp=Compare(), const Allocator &alloc=Allocator())

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

	MapRedBlackTree (MapRedBlackTree &&other) FL_NOEXCEPT=default

	~MapRedBlackTree () FL_NOEXCEPT=default

Value &	at (const Key &key)

const Value &	at (const Key &key) const

iterator	begin ()

const_iterator	begin () const

const_iterator	cbegin () const

const_iterator	cend () const

void	clear ()

bool	contains (const Key &key) const

fl::size	count (const Key &key) const

const_reverse_iterator	crbegin () const

const_reverse_iterator	crend () const

template<typename... Args>
fl::pair< iterator, bool >	emplace (Args &&... args)

template<typename... Args>
iterator	emplace_hint (const_iterator hint, Args &&... args)

bool	empty () const

iterator	end ()

const_iterator	end () const

fl::pair< iterator, iterator >	equal_range (const Key &key)

fl::pair< const_iterator, const_iterator >	equal_range (const Key &key) const

fl::size	erase (const Key &key)

iterator	erase (const_iterator first, const_iterator last)

iterator	erase (const_iterator pos)

iterator	find (const Key &key)

const_iterator	find (const Key &key) const

allocator_type	get_allocator () const

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

iterator	insert (const_iterator hint, const value_type &value)

iterator	insert (const_iterator hint, value_type &&value)

void	insert (fl::initializer_list< value_type > ilist)

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

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

template<typename M>
fl::pair< iterator, bool >	insert_or_assign (const Key &key, M &&obj)

template<typename M>
iterator	insert_or_assign (const_iterator hint, const Key &key, M &&obj)

template<typename M>
iterator	insert_or_assign (const_iterator hint, Key &&key, M &&obj)

template<typename M>
fl::pair< iterator, bool >	insert_or_assign (Key &&key, M &&obj)

key_compare	key_comp () const

iterator	lower_bound (const Key &key)

const_iterator	lower_bound (const Key &key) const

fl::size	max_size () const

bool	operator!= (const MapRedBlackTree &other) const

bool	operator< (const MapRedBlackTree &other) const

bool	operator<= (const MapRedBlackTree &other) const

MapRedBlackTree &	operator= (const MapRedBlackTree &other) FL_NOEXCEPT=default

MapRedBlackTree &	operator= (fl::initializer_list< value_type > ilist) FL_NOEXCEPT

MapRedBlackTree &	operator= (MapRedBlackTree &&other) FL_NOEXCEPT=default

bool	operator== (const MapRedBlackTree &other) const

bool	operator> (const MapRedBlackTree &other) const

bool	operator>= (const MapRedBlackTree &other) const

Value &	operator[] (const Key &key)

reverse_iterator	rbegin ()

const_reverse_iterator	rbegin () const

reverse_iterator	rend ()

const_reverse_iterator	rend () const

fl::size	size () const

void	swap (MapRedBlackTree &other)

template<typename... Args>
fl::pair< iterator, bool >	try_emplace (const Key &key, Args &&... args)

template<typename... Args>
iterator	try_emplace (const_iterator hint, const Key &key, Args &&... args)

template<typename... Args>
iterator	try_emplace (const_iterator hint, Key &&key, Args &&... args)

template<typename... Args>
fl::pair< iterator, bool >	try_emplace (Key &&key, Args &&... args)

iterator	upper_bound (const Key &key)

const_iterator	upper_bound (const Key &key) const

value_compare	value_comp () const

Private Types
using	TreeType = RedBlackTree<value_type, PairCompare, Allocator>

Private Attributes
TreeType	mTree

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

fl/stl/detail/rbtree.h

Detailed Description

Classes

Public Types

Public Member Functions

Private Types

Private Attributes