FastLED: fl::SortedHeapMap< Key, Value, Less > Class Template Reference

FastLED 3.9.12

Loading...

Searching...

No Matches

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.

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

typedef SortedHeapVector< Pair, PairLess >::const_iterator	const_iterator

typedef Pair	value_type

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

void	setMaxSize (size_t n)

void	reserve (size_t n)

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

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

void	swap (SortedHeapMap &other)

Value &	at (const Key &key)

bool	has (const Key &key) const

bool	contains (const Key &key) const

bool	operator== (const SortedHeapMap &other) const

bool	operator!= (const SortedHeapMap &other) const

size_t	size () const

bool	empty () const

bool	full () const

size_t	capacity () const

void	clear ()

iterator	begin ()

iterator	end ()

const_iterator	begin () const

const_iterator	end () const

iterator	find (const Key &key)

const_iterator	find (const Key &key) const

bool	erase (const Key &key)

bool	erase (iterator it)

iterator	lower_bound (const Key &key)

const_iterator	lower_bound (const Key &key) const

iterator	upper_bound (const Key &key)

const_iterator	upper_bound (const Key &key) const

Pair &	front ()

const Pair &	front () const

Pair &	back ()

const Pair &	back () const

Value &	operator[] (const Key &key)

Member Typedef Documentation

◆ const_iterator

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

typedef SortedHeapVector<Pair,PairLess>::const_iterator fl::SortedHeapMap< Key, Value, Less >::const_iterator

Definition at line 279 of file map.h.

◆ iterator

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

typedef SortedHeapVector<Pair,PairLess>::iterator fl::SortedHeapMap< Key, Value, Less >::iterator

Definition at line 278 of file map.h.

◆ value_type

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

typedef Pair fl::SortedHeapMap< Key, Value, Less >::value_type

Definition at line 280 of file map.h.

Constructor & Destructor Documentation

◆ SortedHeapMap()

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

fl::SortedHeapMap< Key, Value, Less >::SortedHeapMap ( Less less = Less() )

inline

Definition at line 282 of file map.h.

Member Function Documentation

◆ at()

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

Value & fl::SortedHeapMap< Key, Value, Less >::at ( const Key & key )

inline

Definition at line 309 of file map.h.

◆ back() [1/2]

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

Pair & fl::SortedHeapMap< Key, Value, Less >::back ( )

inline

Definition at line 391 of file map.h.

◆ back() [2/2]

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

const Pair & fl::SortedHeapMap< Key, Value, Less >::back ( ) const

inline

Definition at line 392 of file map.h.

◆ begin() [1/2]

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

iterator fl::SortedHeapMap< Key, Value, Less >::begin ( )

inline

Definition at line 346 of file map.h.

◆ begin() [2/2]

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

const_iterator fl::SortedHeapMap< Key, Value, Less >::begin ( ) const

inline

Definition at line 348 of file map.h.

◆ capacity()

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

size_t fl::SortedHeapMap< Key, Value, Less >::capacity ( ) const

inline

Definition at line 342 of file map.h.

◆ clear()

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

void fl::SortedHeapMap< Key, Value, Less >::clear ( )

inline

Definition at line 343 of file map.h.

◆ contains()

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

bool fl::SortedHeapMap< Key, Value, Less >::contains ( const Key & key ) const

inline

Definition at line 318 of file map.h.

◆ empty()

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

bool fl::SortedHeapMap< Key, Value, Less >::empty ( ) const

inline

Definition at line 340 of file map.h.

◆ end() [1/2]

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

iterator fl::SortedHeapMap< Key, Value, Less >::end ( )

inline

Definition at line 347 of file map.h.

◆ end() [2/2]

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

const_iterator fl::SortedHeapMap< Key, Value, Less >::end ( ) const

inline

Definition at line 349 of file map.h.

◆ erase() [1/2]

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

bool fl::SortedHeapMap< Key, Value, Less >::erase ( const Key & key )

inline

Definition at line 358 of file map.h.

◆ erase() [2/2]

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

bool fl::SortedHeapMap< Key, Value, Less >::erase ( iterator it )

inline

Definition at line 361 of file map.h.

◆ find() [1/2]

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

iterator fl::SortedHeapMap< Key, Value, Less >::find ( const Key & key )

inline

Definition at line 351 of file map.h.

◆ find() [2/2]

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

const_iterator fl::SortedHeapMap< Key, Value, Less >::find ( const Key & key ) const

inline

Definition at line 354 of file map.h.

◆ front() [1/2]

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

Pair & fl::SortedHeapMap< Key, Value, Less >::front ( )

inline

Definition at line 389 of file map.h.

◆ front() [2/2]

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

const Pair & fl::SortedHeapMap< Key, Value, Less >::front ( ) const

inline

Definition at line 390 of file map.h.

◆ full()

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

bool fl::SortedHeapMap< Key, Value, Less >::full ( ) const

inline

Definition at line 341 of file map.h.

◆ has()

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

bool fl::SortedHeapMap< Key, Value, Less >::has ( const Key & key ) const

inline

Definition at line 314 of file map.h.

◆ insert()

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

bool fl::SortedHeapMap< Key, Value, Less >::insert	(	const Key &	key,
		const Value &	value,
		InsertResult *	result = nullptr )

inline

Definition at line 294 of file map.h.

◆ lower_bound() [1/2]

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

iterator fl::SortedHeapMap< Key, Value, Less >::lower_bound ( const Key & key )

inline

Definition at line 365 of file map.h.

◆ lower_bound() [2/2]

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

const_iterator fl::SortedHeapMap< Key, Value, Less >::lower_bound ( const Key & key ) const

inline

Definition at line 369 of file map.h.

◆ operator!=()

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

bool fl::SortedHeapMap< Key, Value, Less >::operator!= ( const SortedHeapMap< Key, Value, Less > & other ) const

inline

Definition at line 335 of file map.h.

◆ operator==()

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

bool fl::SortedHeapMap< Key, Value, Less >::operator== ( const SortedHeapMap< Key, Value, Less > & other ) const

inline

Definition at line 322 of file map.h.

◆ operator[]()

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

Value & fl::SortedHeapMap< Key, Value, Less >::operator[] ( const Key & key )

inline

Definition at line 395 of file map.h.

◆ reserve()

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

void fl::SortedHeapMap< Key, Value, Less >::reserve ( size_t n )

inline

Definition at line 290 of file map.h.

◆ setMaxSize()

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

void fl::SortedHeapMap< Key, Value, Less >::setMaxSize ( size_t n )

inline

Definition at line 286 of file map.h.

◆ size()

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

size_t fl::SortedHeapMap< Key, Value, Less >::size ( ) const

inline

Definition at line 339 of file map.h.

◆ swap()

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

void fl::SortedHeapMap< Key, Value, Less >::swap ( SortedHeapMap< Key, Value, Less > & other )

inline

Definition at line 305 of file map.h.

◆ update()

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

void fl::SortedHeapMap< Key, Value, Less >::update	(	const Key &	key,
		const Value &	value )

inline

Definition at line 298 of file map.h.

◆ upper_bound() [1/2]

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

iterator fl::SortedHeapMap< Key, Value, Less >::upper_bound ( const Key & key )

inline

Definition at line 373 of file map.h.

◆ upper_bound() [2/2]

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

const_iterator fl::SortedHeapMap< Key, Value, Less >::upper_bound ( const Key & key ) const

inline

Definition at line 381 of file map.h.

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

/home/runner/work/FastLED/FastLED/src/fl/map.h

fl
SortedHeapMap
Generated on Wed Jan 22 2025 01:23:04 for FastLED by 1.11.0