|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <tpl_hash.H>
Public Types | |
| typedef HashMapTable< Key, Data, Cmp > | Base |
Public Member Functions | |
| void | add (std::initializer_list< Key > lk, std::initializer_list< Data > ld) |
| HashMap () | |
| HashMap (std::initializer_list< Key > lk, std::initializer_list< Data > ld) | |
| template<template< typename T > class Container = DynList> | |
| HashMap (const Container< Key > &c, std::initializer_list< Data > ld) | |
| const Data & | operator[] (const Key &key) const |
| Data & | operator[] (const Key &key) |
| void | clear () |
| Empties the container. | |
| bool | is_empty () const noexcept |
| Checks if the container is empty. | |
Definition at line 109 of file tpl_hash.H.
| typedef HashMapTable<Key, Data, Cmp> Aleph::HashMap< Key, Data, HashMapTable, Cmp >::Base |
Definition at line 111 of file tpl_hash.H.
|
inline |
Definition at line 125 of file tpl_hash.H.
|
inline |
Definition at line 127 of file tpl_hash.H.
References Aleph::HashMap< Key, Data, HashMapTable, Cmp >::add(), and Aleph::divide_and_conquer_partition_dp().
|
inline |
Definition at line 134 of file tpl_hash.H.
References ah_range_error_if, and Aleph::divide_and_conquer_partition_dp().
|
inline |
Definition at line 114 of file tpl_hash.H.
References ah_range_error_if, and Aleph::divide_and_conquer_partition_dp().
Referenced by Aleph::HashMap< Key, Data, HashMapTable, Cmp >::HashMap().
|
inlinenoexcept |
Checks if the container is empty.
| none |
Definition at line 162 of file tpl_hash.H.
Referenced by Aleph::Transposition_Table< Key, Entry, HashMapTable, Cmp, ReplacePolicy >::is_empty().
|
inline |
Definition at line 146 of file tpl_hash.H.
|
inline |
Definition at line 146 of file tpl_hash.H.