LISP-style assoc list using vector<>: map-like class with small memory footprint. Useful for small associative arrays. Lookup and insert are linear time.
More...
template<typename KeyT, typename ValT>
class moot::AssocVector< KeyT, ValT >
Requirements for KeyT
- should support operator== and copy constructor
Requirements for ValT
- should support operator==(), copy constructor, and operator=
◆ assoc_key_type
template<typename KeyT, typename ValT>
◆ assoc_value_type
template<typename KeyT, typename ValT>
◆ assoc_node_type
template<typename KeyT, typename ValT>
◆ assoc_vector_type
template<typename KeyT, typename ValT>
◆ iterator
template<typename KeyT, typename ValT>
◆ const_iterator
template<typename KeyT, typename ValT>
◆ reverse_iterator
template<typename KeyT, typename ValT>
◆ const_reverse_iterator
template<typename KeyT, typename ValT>
◆ AssocVector() [1/2]
template<typename KeyT, typename ValT>
◆ AssocVector() [2/2]
template<typename KeyT, typename ValT>
◆ ~AssocVector()
template<typename KeyT, typename ValT>
◆ find() [1/2]
template<typename KeyT, typename ValT>
◆ find() [2/2]
template<typename KeyT, typename ValT>
◆ get()
template<typename KeyT, typename ValT>
◆ insert()
template<typename KeyT, typename ValT>
◆ get_node()
template<typename KeyT, typename ValT>
◆ get_value()
template<typename KeyT, typename ValT>
Alias for get_node(key)->second
◆ nth()
template<typename KeyT, typename ValT>
◆ operator[]() [1/2]
template<typename KeyT, typename ValT>
◆ operator[]() [2/2]
template<typename KeyT, typename ValT>
◆ sort_bykey()
template<typename KeyT, typename ValT>
Sort contents in ascending order by key,value
◆ rsort_bykey()
template<typename KeyT, typename ValT>
Sort contents in descending order by key,value
◆ sort_byvalue()
template<typename KeyT, typename ValT>
Sort contents in ascending order by value,key
◆ rsort_byvalue()
template<typename KeyT, typename ValT>
Sort contents in descending order by value,key
The documentation for this class was generated from the following file: