Detailed Description

template<typename Key, typename Value, typename Less = fl::DefaultLess<Key>>
class fl::SortedHeapMap< Key, Value, Less >

Definition at line 257 of file map.h.

#include <map.h>

Inheritance diagram for fl::SortedHeapMap< Key, Value, Less >:

Collaboration diagram for fl::SortedHeapMap< Key, Value, Less >:

Public Types
typedef SortedHeapVector< Pair, PairLess >::const_iterator	const_iterator

typedef SortedHeapVector< Pair, PairLess >::iterator	iterator

typedef Pair	value_type

Public Member Functions
	SortedHeapMap (Less less=Less())

Value &	at (const Key &key)

Pair &	back ()

const Pair &	back () const

iterator	begin ()

const_iterator	begin () const

size_t	capacity () const

void	clear ()

bool	contains (const Key &key) const

bool	empty () const

iterator	end ()

const_iterator	end () const

bool	erase (const Key &key)

bool	erase (iterator it)

iterator	find (const Key &key)

const_iterator	find (const Key &key) const

Pair &	front ()

const Pair &	front () const

bool	full () const

bool	has (const Key &key) const

bool	insert (const Key &key, const Value &value, InsertResult *result=nullptr)

iterator	lower_bound (const Key &key)

const_iterator	lower_bound (const Key &key) const

bool	operator!= (const SortedHeapMap &other) const

bool	operator== (const SortedHeapMap &other) const

Value &	operator[] (const Key &key)

void	reserve (size_t n)

void	setMaxSize (size_t n)

size_t	size () const

void	swap (SortedHeapMap &other)

void	update (const Key &key, const Value &value)

iterator	upper_bound (const Key &key)

const_iterator	upper_bound (const Key &key) const

Private Attributes
SortedHeapVector< Pair, PairLess >	data

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

Classes