gum::HashTable< Key, Val > Member List

This is the complete list of members for gum::HashTable< Key, Val >, including all inherited members.

_begin_index_	gum::HashTable< Key, Val >	mutableprivate
_clearIterators_()	gum::HashTable< Key, Val >	private
_copy_(const HashTable< Key, Val > &table)	gum::HashTable< Key, Val >	private
_create_(Size size)	gum::HashTable< Key, Val >	private
_erase_(HashTableBucket< Key, Val > *bucket, Size index)	gum::HashTable< Key, Val >	private
_hash_func_	gum::HashTable< Key, Val >	private
_insert_(Bucket *bucket)	gum::HashTable< Key, Val >	private
_key_uniqueness_policy_	gum::HashTable< Key, Val >	private
_nb_elements_	gum::HashTable< Key, Val >	private
_nodes_	gum::HashTable< Key, Val >	private
_resize_policy_	gum::HashTable< Key, Val >	private
_safe_iterators_	gum::HashTable< Key, Val >	mutableprivate
_size_	gum::HashTable< Key, Val >	private
begin()	gum::HashTable< Key, Val >
begin() const	gum::HashTable< Key, Val >
beginSafe()	gum::HashTable< Key, Val >
beginSafe() const	gum::HashTable< Key, Val >
Bijection class	gum::HashTable< Key, Val >	friend
Bucket typedef	gum::HashTable< Key, Val >
capacity() const noexcept	gum::HashTable< Key, Val >
cbegin() const	gum::HashTable< Key, Val >
cbeginSafe() const	gum::HashTable< Key, Val >
cend() const noexcept	gum::HashTable< Key, Val >
cendSafe() const noexcept	gum::HashTable< Key, Val >
clear()	gum::HashTable< Key, Val >
const_iterator typedef	gum::HashTable< Key, Val >
const_iterator_safe typedef	gum::HashTable< Key, Val >
const_pointer typedef	gum::HashTable< Key, Val >
const_reference typedef	gum::HashTable< Key, Val >
difference_type typedef	gum::HashTable< Key, Val >
emplace(Args &&... args)	gum::HashTable< Key, Val >
emplace(Args &&... args)	gum::HashTable< Key, Val >
empty() const noexcept	gum::HashTable< Key, Val >
end() noexcept	gum::HashTable< Key, Val >
end() const noexcept	gum::HashTable< Key, Val >
endSafe() noexcept	gum::HashTable< Key, Val >
endSafe() const noexcept	gum::HashTable< Key, Val >
erase(const Key &key)	gum::HashTable< Key, Val >
erase(const iterator_safe &iter)	gum::HashTable< Key, Val >
erase(const const_iterator_safe &iter)	gum::HashTable< Key, Val >
eraseAllVal(const Val &val)	gum::HashTable< Key, Val >
eraseByVal(const Val &val)	gum::HashTable< Key, Val >
exists(const Key &key) const	gum::HashTable< Key, Val >
getWithDefault(const Key &key, const Val &default_value)	gum::HashTable< Key, Val >
getWithDefault(Key &&key, Val &&default_value)	gum::HashTable< Key, Val >
HashTable(Size size_param=HashTableConst::default_size, bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy)	gum::HashTable< Key, Val >	explicit
HashTable(std::initializer_list< std::pair< Key, Val > > list)	gum::HashTable< Key, Val >	explicit
HashTable(const HashTable< Key, Val > &from)	gum::HashTable< Key, Val >
HashTable(HashTable< Key, Val > &&from)	gum::HashTable< Key, Val >
HashTableConstIterator< Key, Val > class	gum::HashTable< Key, Val >	friend
HashTableConstIteratorSafe< Key, Val > class	gum::HashTable< Key, Val >	friend
HashTableIterator< Key, Val > class	gum::HashTable< Key, Val >	friend
HashTableIteratorSafe< Key, Val > class	gum::HashTable< Key, Val >	friend
insert(const Key &key, const Val &val)	gum::HashTable< Key, Val >
insert(Key &&key, Val &&val)	gum::HashTable< Key, Val >
insert(const std::pair< Key, Val > &elt)	gum::HashTable< Key, Val >
insert(std::pair< Key, Val > &&elt)	gum::HashTable< Key, Val >
iterator typedef	gum::HashTable< Key, Val >
iterator_safe typedef	gum::HashTable< Key, Val >
key(const Key &key) const	gum::HashTable< Key, Val >
key_type typedef	gum::HashTable< Key, Val >
keyByVal(const Val &val) const	gum::HashTable< Key, Val >
keyUniquenessPolicy() const noexcept	gum::HashTable< Key, Val >
map(Mount(*f)(Val), Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const	gum::HashTable< Key, Val >
map(Mount(*f)(Val &), Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const	gum::HashTable< Key, Val >
map(Mount(*f)(const Val &), Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const	gum::HashTable< Key, Val >
map(const Mount &val, Size size=Size(0), bool resize_pol=HashTableConst::default_resize_policy, bool key_uniqueness_pol=HashTableConst::default_uniqueness_policy) const	gum::HashTable< Key, Val >
map(Mount(*f)(Val), Size size, bool resize_pol, bool key_uniqueness_pol) const	gum::HashTable< Key, Val >
map(Mount(*f)(Val &), Size size, bool resize_pol, bool key_uniqueness_pol) const	gum::HashTable< Key, Val >
map(Mount(*f)(const Val &), Size size, bool resize_pol, bool key_uniqueness_pol) const	gum::HashTable< Key, Val >
map(const Mount &val, Size size, bool resize_pol, bool key_uniqueness_pol) const	gum::HashTable< Key, Val >
mapped_type typedef	gum::HashTable< Key, Val >
operator!=(const HashTable< Key, Val > &from) const	gum::HashTable< Key, Val >
operator<<(std::ostream &s, const HashTable< Key, Val > &table)	gum::HashTable< Key, Val >	friend
operator<<(std::ostream &s, const HashTable< Key *, Val > &table)	gum::HashTable< Key, Val >	friend
operator=(const HashTable< Key, Val > &from)	gum::HashTable< Key, Val >
operator=(HashTable< Key, Val > &&from)	gum::HashTable< Key, Val >
operator==(const HashTable< Key, Val > &from) const	gum::HashTable< Key, Val >
operator[](const Key &key)	gum::HashTable< Key, Val >
operator[](const Key &key) const	gum::HashTable< Key, Val >
pointer typedef	gum::HashTable< Key, Val >
reference typedef	gum::HashTable< Key, Val >
reset(const Key &key)	gum::HashTable< Key, Val >
resize(Size new_size)	gum::HashTable< Key, Val >
resizePolicy() const noexcept	gum::HashTable< Key, Val >
set(const Key &key, const Val &default_value)	gum::HashTable< Key, Val >
setKeyUniquenessPolicy(const bool new_policy) noexcept	gum::HashTable< Key, Val >
setResizePolicy(const bool new_policy) noexcept	gum::HashTable< Key, Val >
size() const noexcept	gum::HashTable< Key, Val >
size_type typedef	gum::HashTable< Key, Val >
value_type typedef	gum::HashTable< Key, Val >
~HashTable()	gum::HashTable< Key, Val >