Unigine::Hash class

Hash Class

Members

bool is_need_realloc()

void shrink()

Data * do_append(const Key & key)

Arguments

• const Key & key

void rehash(Counter new_capacity)

Arguments

• Counter new_capacity

Iterator begin()

ConstIterator end()

Vector<Key> keys()

bool remove(const ConstIterator & it)

Arguments

• const ConstIterator & it

Counter space()

Data * do_append(Key && key)

Arguments

• Key && key

bool erase(const ConstIterator & it)

Arguments

• const ConstIterator & it

bool erase(const Iterator & it)

Arguments

• const Iterator & it

Counter round_up(Counter v)

Arguments

• Counter v

void swap(Hash<Key, Data, HashType, Counter> & hash)

Arguments

• Hash<Key, Data, HashType, Counter> & hash

Data * do_append(HashType hash, const Key & key)

Arguments

• HashType hash
• const Key & key

void rehash_data(Counter index)

Arguments

• Counter index

Counter empty()

bool contains(const Key & key)

Arguments

• const Key & key

void clear()

bool do_remove(HashType hash, const Key & key)

Arguments

• HashType hash
• const Key & key

void getKeys(Vector<Key> & keys)

Arguments

• Vector<Key> & keys

void reserve(Counter size)

Arguments

• Counter size

bool erase(const Key & key)

Arguments

• const Key & key

Data ** do_find(const Key & key)

Arguments

• const Key & key

void realloc()

bool remove(const Key & key)

Arguments

• const Key & key

bool remove(const Iterator & it)

Arguments

• const Iterator & it

void destroy()

Counter size()

Iterator end()

ConstIterator begin()

ConstIterator find(const Key & key)

Arguments

• const Key & key

Iterator find(const Key & key)

Arguments

• const Key & key