Detailed Description

template<typename Key, typename Value, fl::size N>
class fl::unsorted_map_fixed< Key, Value, N >

Definition at line 22 of file map.h.

#include <map.h>

Collaboration diagram for fl::unsorted_map_fixed< Key, Value, N >:

Public Types
typedef VectorType::const_iterator	const_iterator

enum	insert_result { inserted = 0 , exists = 1 , at_capacity = 2 }

typedef VectorType::iterator	iterator

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

typedef FixedVector< PairKV, N >	VectorType

Public Member Functions
constexpr	unsorted_map_fixed () FL_NOEXCEPT=default

iterator	begin ()

const_iterator	begin () const

constexpr fl::size	capacity () const

void	clear ()

bool	contains (const Key &key) const

constexpr bool	empty () const

iterator	end ()

const_iterator	end () const

fl::size	erase (const Key &key)

iterator	find (const Key &key)

const_iterator	find (const Key &key) const

Value	get (const Key &key, bool *has=nullptr) const

bool	get (const Key &key, Value *value) const

bool	has (const Key &it) const

template<typename Less>
iterator	highest (Less less_than=Less())

template<typename Less>
const_iterator	highest (Less less_than=Less()) const

pair< bool, iterator >	insert (const Key &key, const Value &value, insert_result *result=nullptr)

pair< bool, iterator >	insert (Key &&key, Value &&value, insert_result *result=nullptr)

template<typename Less>
iterator	lowest (Less less_than=Less())

template<typename Less>
const_iterator	lowest (Less less_than=Less()) const

bool	next (const Key &key, Key *next_key, bool allow_rollover=false) const

Value &	operator[] (const Key &key)

const Value &	operator[] (const Key &key) const

bool	prev (const Key &key, Key *prev_key, bool allow_rollover=false) const

constexpr fl::size	size () const

bool	update (const Key &key, const Value &value, bool insert_if_missing=true)

bool	update (const Key &key, Value &&value, bool insert_if_missing=true)

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

Public Types