#include <map.h>
|
const Element * | find (const K &p_key) const |
|
Element * | find (const K &p_key) |
|
const Element * | find_closest (const K &p_key) const |
|
Element * | find_closest (const K &p_key) |
|
Element * | insert (const K &p_key, const V &p_value) |
|
void | erase (Element *p_element) |
|
bool | erase (const K &p_key) |
|
bool | has (const K &p_key) const |
|
const V & | operator[] (const K &p_key) const |
|
V & | operator[] (const K &p_key) |
|
Element * | front () const |
|
Element * | back () const |
|
bool | empty () const |
|
int | size () const |
|
int | calculate_depth () const |
|
void | clear () |
|
void | operator= (const Map &p_map) |
|
| Map (const Map &p_map) |
|
template<class K, class V, class C = Comparator<K>, class A = DefaultAllocator>
class Map< K, V, C, A >
- Author
- Juan Linietsky reduz.nosp@m.io@g.nosp@m.mail..nosp@m.com
The documentation for this class was generated from the following file:
- /Users/huihoo/Downloads/godot-2.0.4-stable/core/map.h