| 
| 
typedef ALLOC  | allocator_type | 
|   | 
| 
typedef _iter< const hvec_map, const value_type >  | const_iterator | 
|   | 
| 
typedef std::vector< value_type >::const_pointer  | const_pointer | 
|   | 
| 
typedef std::vector< value_type >::const_reference  | const_reference | 
|   | 
| 
typedef HASH  | hasher | 
|   | 
| 
typedef _iter< hvec_map, value_type >  | iterator | 
|   | 
| 
typedef PRED  | key_equal | 
|   | 
| 
typedef KEY  | key_type | 
|   | 
| 
typedef hash_vector_base::lookup_cache  | lookup_cache | 
|   | 
| 
typedef VAL  | mapped_type | 
|   | 
| 
typedef std::vector< value_type >::pointer  | pointer | 
|   | 
| 
typedef std::vector< value_type >::reference  | reference | 
|   | 
| 
typedef std::pair< const KEY, VAL >  | value_type | 
|   | 
 | 
| 
  | hvec_map (const hvec_map &)=default | 
|   | 
| 
  | hvec_map (hvec_map &&)=default | 
|   | 
| 
template<class ITER >  | 
|   | hvec_map (ITER begin, ITER end, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type()) | 
|   | 
| 
  | hvec_map (size_t icap=0, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type()) | 
|   | 
| 
  | hvec_map (std::initializer_list< value_type > il, const hasher &hf=hasher(), const key_equal &eql=key_equal(), const allocator_type &a=allocator_type()) | 
|   | 
| 
iterator  | begin () | 
|   | 
| 
const_iterator  | begin () const | 
|   | 
| 
const_iterator  | cbegin () const | 
|   | 
| 
const_iterator  | cend () const | 
|   | 
| 
void  | clear () | 
|   | 
| 
size_t  | count (const KEY &k) const | 
|   | 
| 
template<typename... VV>  | 
| std::pair< iterator, bool >  | emplace (const KEY &k, VV &&...v) | 
|   | 
| 
template<typename... VV>  | 
| std::pair< iterator, bool >  | emplace (KEY &&k, VV &&...v) | 
|   | 
| 
bool  | empty () const | 
|   | 
| 
iterator  | end () | 
|   | 
| 
const_iterator  | end () const | 
|   | 
| 
template<class HVM , class VT >  | 
| _iter< HVM, VT >  | erase (_iter< HVM, VT > it) | 
|   | 
| 
size_t  | erase (const KEY &k) | 
|   | 
| 
iterator  | find (const KEY &k) | 
|   | 
| 
const_iterator  | find (const KEY &k) const | 
|   | 
| 
std::pair< iterator, bool >  | insert (const value_type &v) | 
|   | 
| 
template<typename InputIterator >  | 
| void  | insert (InputIterator first, InputIterator last) | 
|   | 
| 
void  | insert (std::initializer_list< value_type > vl) | 
|   | 
| 
size_t  | max_size () const | 
|   | 
| 
bool  | operator!= (const hvec_map &a) const | 
|   | 
| 
hvec_map &  | operator= (const hvec_map &that) | 
|   | 
| 
hvec_map &  | operator= (hvec_map &&)=default | 
|   | 
| 
bool  | operator== (const hvec_map &a) const | 
|   | 
| 
VAL &  | operator[] (const KEY &k) | 
|   | 
| 
VAL &  | operator[] (KEY &&k) | 
|   | 
| 
size_t  | size () const | 
|   |