#include <smallmap_type.hpp>

Public Types | |
| typedef ::SmallPair< T, U > | Pair |
| typedef Pair * | iterator |
Public Member Functions | |
| FORCEINLINE | SmallMap () |
| Creates new SmallMap. | |
| FORCEINLINE | ~SmallMap () |
| Data are freed in SmallVector destructor. | |
| FORCEINLINE Pair * | Find (const T &key) |
| Finds given key in this map. | |
| FORCEINLINE void | Erase (Pair *pair) |
| Removes given pair from this map. | |
| FORCEINLINE bool | Erase (const T &key) |
| Removes given key from this map. | |
| FORCEINLINE bool | Insert (const T &key, const U &data) |
| Adds new item to this map. | |
| FORCEINLINE U & | operator[] (const T &key) |
| Returns data belonging to this key. | |
| FORCEINLINE void | SortByKey () |
Static Public Member Functions | |
| static int CDECL | KeySorter (const void *a, const void *b) |
Both types have to be POD ("Plain Old Data")! It has inherited accessors from SmallVector().
Definition at line 25 of file smallmap_type.hpp.
| FORCEINLINE SmallMap< T, U, S >::SmallMap | ( | ) | [inline] |
Creates new SmallMap.
Data are initialized in SmallVector constructor
Definition at line 30 of file smallmap_type.hpp.
| FORCEINLINE Pair* SmallMap< T, U, S >::Find | ( | const T & | key | ) | [inline] |
Finds given key in this map.
| key | key to find |
Definition at line 38 of file smallmap_type.hpp.
References SmallVector< SmallPair< T, U >, S >::data, SmallVector< SmallPair< T, U >, S >::End(), and SmallVector< SmallPair< T, U >, S >::items.
Referenced by AddNearbyStation(), and SmallMap< T, U, S >::Insert().
| FORCEINLINE void SmallMap< T, U, S >::Erase | ( | Pair * | pair | ) | [inline] |
Removes given pair from this map.
| pair | pair to remove |
Definition at line 50 of file smallmap_type.hpp.
References SmallVector< SmallPair< T, U >, S >::Begin(), SmallVector< SmallPair< T, U >, S >::data, SmallVector< SmallPair< T, U >, S >::End(), and SmallVector< SmallPair< T, U >, S >::items.
| FORCEINLINE bool SmallMap< T, U, S >::Erase | ( | const T & | key | ) | [inline] |
Removes given key from this map.
| key | key to remove |
Definition at line 61 of file smallmap_type.hpp.
References SmallVector< SmallPair< T, U >, S >::data, and SmallVector< SmallPair< T, U >, S >::items.
| FORCEINLINE bool SmallMap< T, U, S >::Insert | ( | const T & | key, | |
| const U & | data | |||
| ) | [inline] |
Adds new item to this map.
| key | key | |
| data | data |
Definition at line 77 of file smallmap_type.hpp.
References SmallVector< SmallPair< T, U >, S >::Append(), SmallVector< SmallPair< T, U >, S >::End(), and SmallMap< T, U, S >::Find().
Referenced by FindStationsNearby().
| FORCEINLINE U& SmallMap< T, U, S >::operator[] | ( | const T & | key | ) | [inline] |
Returns data belonging to this key.
| key | key |
Definition at line 89 of file smallmap_type.hpp.
References SmallVector< SmallPair< T, U >, S >::Append(), SmallVector< SmallPair< T, U >, S >::data, SmallPair< T, U >::first, SmallVector< SmallPair< T, U >, S >::items, and SmallPair< T, U >::second.
1.5.6