|
class | honey::MtMapElem< Key_, Val_, List_ > |
| Map element in recursive list. More...
|
|
struct | honey::MtPair< Key_, Val_ > |
| Key/value pair. A pair can be constructed with the syntax: (key() = value) More...
|
|
class | honey::MtMapIter< Head, Elem > |
| Bidirectional iterator over map key/value pairs. More...
|
|
class | honey::MtMapCommon< Subclass, Key_, Val_, List_ > |
| Common functions between map elem and the map tail specialization. Use through class MtMapElem. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< isTail, _ >::findElem< Key, Prev > |
| We don't have this key, recurse towards tail. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< isTail, _ >::findElem< Key, Prev_ > |
| Specialize for our key. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< isTail, _ >::sizeR< Count > |
| Recurse to tail. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< true, _ >::findElem< Key, Prev_ > |
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::priv< true, _ >::sizeR< Count > |
| End recursion. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::hasKey_< Key > |
| Check if key exists at compile-time. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::size_ |
| Get size of map at compile-time. More...
|
|
struct | honey::MtMapCommon< Subclass, Key_, Val_, List_ >::empty_ |
| Check if empty at compile-time. More...
|
|
class | honey::MtMapElem< Key_, Val_, List_ > |
| Map element in recursive list. More...
|
|