Jolt Physics
A multi core friendly Game Physics Engine
|
#include <UnorderedSet.h>
Additional Inherited Members | |
Public Types inherited from HashTable< Key, KeyValue, HashTableDetail, Hash, KeyEqual > | |
using | value_type = KeyValue |
Properties. | |
using | size_type = uint32 |
using | difference_type = ptrdiff_t |
Public Member Functions inherited from HashTable< Key, KeyValue, HashTableDetail, Hash, KeyEqual > | |
HashTable ()=default | |
Default constructor. | |
HashTable (const HashTable &inRHS) | |
Copy constructor. | |
HashTable (HashTable &&ioRHS) noexcept | |
Move constructor. | |
HashTable & | operator= (const HashTable &inRHS) |
Assignment operator. | |
~HashTable () | |
Destructor. | |
void | reserve (size_type inMaxSize) |
Reserve memory for a certain number of elements. | |
void | clear () |
Destroy the entire hash table. | |
iterator | begin () |
Iterator to first element. | |
iterator | end () |
Iterator to one beyond last element. | |
const_iterator | begin () const |
Iterator to first element. | |
const_iterator | end () const |
Iterator to one beyond last element. | |
const_iterator | cbegin () const |
Iterator to first element. | |
const_iterator | cend () const |
Iterator to one beyond last element. | |
bool | empty () const |
Check if there are no elements in the table. | |
size_type | size () const |
Number of elements in the table. | |
std::pair< iterator, bool > | insert (const value_type &inValue) |
Insert a new element, returns iterator and if the element was inserted. | |
const_iterator | find (const Key &inKey) const |
Find an element, returns iterator to element or end() if not found. | |
void | erase (const const_iterator &inIterator) |
Erase an element by iterator. | |
size_type | erase (const Key &inKey) |
Erase an element by key. | |
void | swap (HashTable &ioRHS) noexcept |
Swap the contents of two hash tables. | |
Protected Member Functions inherited from HashTable< Key, KeyValue, HashTableDetail, Hash, KeyEqual > | |
KeyValue & | GetElement (size_type inIndex) const |
Get an element by index. | |
template<bool AllowDeleted = true> | |
bool | InsertKey (const Key &inKey, size_type &outIndex) |
Hash Set class