Vowpal Wabbit
|
#include <v_hashmap.h>
Classes | |
struct | hash_elem |
Public Member Functions | |
size_t | base_size () |
void | set_default_value (const V &def) |
void | init_dat (size_t min_size, const V &def, bool(*eq)(void *, const K &, const K &), void *eq_dat=nullptr) |
void | init (size_t min_size, const V &def, bool(*eq)(const K &, const K &)) |
void | init (size_t min_size, bool(*eq)(const K &, const K &)) |
v_hashmap (size_t min_size, const V &def, bool(*eq)(void *, const K &, const K &), void *eq_dat=nullptr) | |
v_hashmap (size_t min_size, V &def, bool(*eq)(const K &, const K &)) | |
v_hashmap () | |
void | set_equivalent (bool(*eq)(void *, const K &, const K &), void *eq_dat=nullptr) |
void | set_equivalent (bool(*eq)(const K &, const K &)) |
void | delete_v () |
~v_hashmap () | |
void | clear () |
void * | iterator_next (void *prev) |
void * | iterator () |
V * | iterator_get_value (void *el) |
void | iter (void(*func)(K, V)) |
void | put_after_get_nogrow (const K &key, uint64_t hash, const V &val) |
void | double_size () |
bool | is_equivalent (const K &key, const K &key2) |
V & | get (const K &key, uint64_t hash) |
bool | contains (const K &key, size_t hash) |
void | put_after_get (const K &key, uint64_t hash, const V &val) |
void | put (const K &key, uint64_t hash, const V &val) |
size_t | size () |
Public Attributes | |
bool(* | equivalent )(void *, const K &, const K &) |
bool(* | equivalent_no_data )(const K &, const K &) |
V | default_value |
v_array< hash_elem > | dat |
size_t | last_position |
size_t | num_occupants |
void * | eq_data |
Definition at line 14 of file v_hashmap.h.
|
inline |
Definition at line 83 of file v_hashmap.h.
|
inline |
Definition at line 87 of file v_hashmap.h.
Definition at line 88 of file v_hashmap.h.
Definition at line 105 of file v_hashmap.h.
|
inline |
Definition at line 35 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::clear(), v_hashmap< size_t, features >::contains(), v_hashmap< size_t, features >::double_size(), v_hashmap< size_t, features >::get(), and v_hashmap< size_t, features >::put_after_get().
|
inline |
|
inline |
|
inline |
Definition at line 103 of file v_hashmap.h.
Referenced by LabelDict::free_label_features(), namedlabels::namedlabels(), namedlabels::~namedlabels(), and v_hashmap< size_t, features >::~v_hashmap().
|
inline |
Definition at line 168 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::put_after_get().
|
inline |
Definition at line 203 of file v_hashmap.h.
Referenced by LabelDict::add_example_namespace_from_memory(), LabelDict::del_example_namespace_from_memory(), namedlabels::get(), namedlabels::namedlabels(), and parse_dictionary_argument().
|
inline |
Definition at line 54 of file v_hashmap.h.
Referenced by namedlabels::namedlabels(), parse_dictionary_argument(), and v_hashmap< size_t, features >::v_hashmap().
|
inline |
Definition at line 69 of file v_hashmap.h.
|
inline |
Definition at line 39 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::v_hashmap().
|
inline |
Definition at line 193 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::contains(), and v_hashmap< size_t, features >::get().
|
inline |
|
inline |
|
inline |
Definition at line 143 of file v_hashmap.h.
Referenced by LabelDict::free_label_features().
|
inline |
|
inline |
Definition at line 275 of file v_hashmap.h.
Referenced by namedlabels::namedlabels(), and parse_dictionary_argument().
|
inline |
Definition at line 259 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::put(), and LabelDict::set_label_features().
|
inline |
Definition at line 160 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::double_size(), and v_hashmap< size_t, features >::put_after_get().
|
inline |
Definition at line 37 of file v_hashmap.h.
|
inline |
Definition at line 90 of file v_hashmap.h.
|
inline |
Definition at line 96 of file v_hashmap.h.
|
inline |
Definition at line 29 of file v_hashmap.h.
V v_hashmap< K, V >::default_value |
Definition at line 28 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::get().
void* v_hashmap< K, V >::eq_data |
Definition at line 32 of file v_hashmap.h.
bool(* v_hashmap< K, V >::equivalent) (void *, const K &, const K &) |
Definition at line 25 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::init(), v_hashmap< size_t, features >::init_dat(), v_hashmap< size_t, features >::is_equivalent(), and v_hashmap< size_t, features >::set_equivalent().
bool(* v_hashmap< K, V >::equivalent_no_data) (const K &, const K &) |
Definition at line 26 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::init(), v_hashmap< size_t, features >::init_dat(), v_hashmap< size_t, features >::is_equivalent(), and v_hashmap< size_t, features >::set_equivalent().
size_t v_hashmap< K, V >::last_position |
Definition at line 30 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::get(), and v_hashmap< size_t, features >::put_after_get_nogrow().
size_t v_hashmap< K, V >::num_occupants |
Definition at line 31 of file v_hashmap.h.
Referenced by v_hashmap< size_t, features >::size().