structures::hash_table< key_type, contents > Member List

This is the complete list of members for structures::hash_table< key_type, contents >, including all inherited members.

acquire(const key_type &key)	structures::hash_table< key_type, contents >
add(const key_type &key, contents *to_store)	structures::hash_table< key_type, contents >
add(key_type *key, contents *to_store, bool check_dupes=true)	structures::hash_table< key_type, contents >
apply(apply_function *to_apply, void *data_link)	structures::hash_table< key_type, contents >
apply_function typedef	structures::hash_table< key_type, contents >
calculate_num_slots(int estimated_elements)	structures::hash_table< key_type, contents >	static
class_name() const =0	basis::nameable	pure virtual
DEFINE_CLASS_NAME("hash_table")	structures::hash_table< key_type, contents >
elements() const	structures::hash_table< key_type, contents >
estimated_elements() const	structures::hash_table< key_type, contents >	inline
EXISTING enum value	structures::hash_table< key_type, contents >
fast_dangerous_add(const key_type &key, contents *to_store)	structures::hash_table< key_type, contents >
find(const key_type &key, contents *&item_found) const	structures::hash_table< key_type, contents >
find(const key_type &key) const	structures::hash_table< key_type, contents >	inline
hash_table(const hashing_algorithm &hasher, int estimated_elements)	structures::hash_table< key_type, contents >
IS_NEW enum value	structures::hash_table< key_type, contents >
outcomes enum name	structures::hash_table< key_type, contents >
rehash(int estimated_elements)	structures::hash_table< key_type, contents >
reset()	structures::hash_table< key_type, contents >
table_access() const	structures::hash_table< key_type, contents >
verify() const	structures::hash_table< key_type, contents >
zap(const key_type &key)	structures::hash_table< key_type, contents >
~hash_table()	structures::hash_table< key_type, contents >	virtual