Class that represents a map type (extends from std::unordered_map). More...

#include <SPL/Runtime/Type/Map.h>

Inheritance diagram for SPL::map< K, V >:
Inheritance graph
node node node
[legend]

Detailed Description

template<class K, class V>
class SPL::map< K, V >

Class that represents a map type (extends from std::unordered_map).

Constructor & Destructor Documentation

◆ map() [1/8]

template<class K , class V >

Default constructor

◆ map() [2/8]

template<class K , class V >

Construct from a unordered_map

Parameters

◆ map() [3/8]

template<class K , class V >

Copy constructor

Parameters

◆ map() [4/8]

template<class K , class V >
template<class InputIterator >

Construct from a sequence

Parameters

◆ map() [5/8]

template<class K , class V >

Construct from a reflective map

Parameters

◆ map() [6/8]

template<class K , class V >

Construct from a value handle

Parameters

◆ map() [7/8]

template<class K , class V >
template<class K2 , class V2 >

Construct from an assignable map

Parameters

◆ map() [8/8]

template<class K , class V >
template<class K2 , class V2 , int32_t msize>

Construct from an assignable bmap

Parameters

◆ ~map()

template<class K , class V >

Destructor

Member Function Documentation

◆ add()

template<class K , class V >

Append to list

Parameters
Returns
*this

◆ operator=() [1/2]

template<class K , class V >

Assignment operator (from another map)

Parameters
Returns
self

◆ operator=() [2/2]

template<class K , class V >

Assignment operator (from a unordered_map)

Parameters
Returns
self

◆ operator==()

template<class K , class V >

Equality comparison

Parameters
Returns
true if the contained elements are the same, false otherwise

◆ operator!=()

template<class K , class V >

Non-equality comparison

Parameters
Returns
true if the contained elements are not the same, false otherwise

◆ at() [1/2]

template<class K , class V >

Get the element with a given key, create it if not present

Parameters
Returns
reference to the element
Exceptions

◆ at() [2/2]

template<class K , class V >

Get the element with a given key, throw exception if not present

Parameters
Returns
constant reference to the element

◆ operator[]()

template<class K , class V >

Get the element with a given key, create it if not present

Parameters
Returns
reference to the element

◆ serialize() [1/2]

template<class K , class V >
template<class BufferType >

Serialize (binary)

Parameters

◆ deserialize() [1/2]

template<class K , class V >
template<class BufferType >

Deserialize (binary)

Parameters

◆ serialize() [2/2]

template<class K , class V >

Serialize (character)

Parameters

Implements SPL::Collection.

◆ serializeWithPrecision()

template<class K , class V >

Serialize (character), with maximum precision for floats

Parameters

Implements SPL::Collection.

◆ deserialize() [2/2]

template<class K , class V >

Deserialize (character)

Parameters

Implements SPL::Collection.

◆ deserializeWithNanAndInfs()

template<class K , class V >

Deserialize with Inf and Nan (character)

Parameters

◆ hashCode()

template<class K , class V >

Get hash code

Returns
hash code

Implements SPL::Collection.

◆ equals()

template<class K , class V >

Compare with another collection

Parameters
Returns
true if equal, false otherwise

Implements SPL::Collection.

◆ clone()

template<class K , class V >

Create a clone of the collection object

Returns
clone of the collection object

Implements SPL::Collection.

◆ assignFrom()

template<class K , class V >

Assign this collection using another collection

Parameters
Exceptions

Implements SPL::Collection.

◆ swapWith()

template<class K , class V >

Swap this collection with another collection

Parameters
Exceptions

Implements SPL::Collection.

◆ getKeyMetaType()

template<class K , class V >

Get key type

Returns
key type of the map

Implements SPL::Map.

◆ getValueMetaType()

template<class K , class V >

Get value type

Returns
value type of the map

Implements SPL::Map.

◆ getElementMetaType()

template<class K , class V >

Get element type

Returns
element type of this map, as a (key,value) type pair

Implements SPL::Map.

◆ createKey()

template<class K , class V >

Create a new key. The returned value handle is a wrapper for an object allocated on the heap. As a result, the caller is responsible for cleaning up the memory by calling ValueHandle::deleteValue()

Returns
value handle for the new key

Implements SPL::Map.

◆ createValue()

template<class K , class V >

Create a new key. The returned value handle is a wrapper for an object allocated on the heap. As a result, the caller is responsible for cleaning up the memory by calling ValueHandle::deleteValue()

Returns
value handle for the new value

Implements SPL::Map.

◆ createElement()

template<class K , class V >

Create a new element. The returned value handles are wrappers for objects allocated on the heap. As a result, the caller is responsible for cleaning up the memory by calling ValueHandle::deleteValue()

Returns
value handle for the new element (key and value)

Implements SPL::Map.

◆ getSize()

template<class K , class V >

Get the size of the map

Returns
size of the map

Implements SPL::Map.

◆ findElement() [1/2]

template<class K , class V >

Find an element in the map

Parameters
Returns
an iterator for the element if found, the end iterator otherwise

Implements SPL::Map.

◆ findElement() [2/2]

template<class K , class V >

Find an element in the map

Parameters
Returns
an iterator for the element if found, the end iterator otherwise

Implements SPL::Map.

◆ insertElement()

template<class K , class V >

Insert a given key value pair

Parameters

Implements SPL::Map.

◆ removeElement()

template<class K , class V >

remove the element with a given key

Parameters

Implements SPL::Map.

◆ removeAllElements()

template<class K , class V >

Remove all elements

Implements SPL::Map.

◆ getBeginIterator() [1/2]

template<class K , class V >

Get a begin iterator

Returns
begin iterator

Implements SPL::Map.

◆ getBeginIterator() [2/2]

template<class K , class V >

Get a begin const iterator

Returns
begin const iterator

Implements SPL::Map.

◆ getEndIterator() [1/2]

template<class K , class V >

Get an end iterator

Returns
end iterator

Implements SPL::Map.

◆ getEndIterator() [2/2]

template<class K , class V >

Get an end cost iterator

Returns
end const iterator

Implements SPL::Map.

◆ getSerializedSize()

template<class K , class V >

Get the size in bytes when serialized

Returns
size in bytes when serialized

Implements SPL::Collection.

◆ getIterManager()

template<class K , class V >

Implements SPL::Map.


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