|
| | Map (const label size=128) |
| | Construct given initial size. More...
|
| |
| | Map (Istream &is) |
| | Construct from Istream. More...
|
| |
| | Map (const Map< T > &map) |
| | Construct as copy. More...
|
| |
| | Map (const Xfer< Map< T >> &map) |
| | Construct by transferring the parameter contents. More...
|
| |
| | Map (const Xfer< HashTable< T, label, Hash< label >>> &map) |
| | Construct by transferring the parameter contents. More...
|
| |
| | Map (std::initializer_list< Tuple2< label, T >> map) |
| | Construct from an initializer list. More...
|
| |
| bool | set (const label &, const T &newElmt) |
| | Assign a new hashedEntry, overwriting existing entries. More...
|
| |
| | HashTable (const label size=128) |
| | Construct given initial table size. More...
|
| |
| | HashTable (Istream &, const label size=128) |
| | Construct from Istream. More...
|
| |
| | HashTable (const HashTable< T, label, Hash< label > > &) |
| | Construct as copy. More...
|
| |
| | HashTable (const Xfer< HashTable< T, label, Hash< label > >> &) |
| | Construct by transferring the parameter contents. More...
|
| |
| | HashTable (std::initializer_list< Tuple2< label, T >>) |
| | Construct from an initializer list. More...
|
| |
| | ~HashTable () |
| | Destructor. More...
|
| |
| label | capacity () const |
| | The size of the underlying table. More...
|
| |
| label | size () const |
| | Return number of elements in table. More...
|
| |
| bool | empty () const |
| | Return true if the hash table is empty. More...
|
| |
| bool | found (const label &) const |
| | Return true if hashedEntry is found in table. More...
|
| |
| iterator | find (const label &) |
| | Find and return an iterator set at the hashedEntry. More...
|
| |
| const_iterator | find (const label &) const |
| | Find and return an const_iterator set at the hashedEntry. More...
|
| |
| List< label > | toc () const |
| | Return the table of contents. More...
|
| |
| List< label > | sortedToc () const |
| | Return the table of contents as a sorted list. More...
|
| |
| Ostream & | printInfo (Ostream &) const |
| | Print information. More...
|
| |
| bool | insert (const label &, const T &newElmt) |
| | Insert a new hashedEntry. More...
|
| |
| bool | erase (const iterator &) |
| | Erase a hashedEntry specified by given iterator. More...
|
| |
| bool | erase (const label &) |
| | Erase a hashedEntry specified by the given key. More...
|
| |
| label | erase (const UList< label > &) |
| | Remove entries given by the listed keys from this HashTable. More...
|
| |
| label | erase (const HashTable< AnyType, label, AnyHash > &) |
| | Remove entries given by the given keys from this HashTable. More...
|
| |
| Foam::label | erase (const HashTable< AnyType, label, AnyHash > &rhs) |
| |
| void | resize (const label newSize) |
| | Resize the hash table for efficiency. More...
|
| |
| void | clear () |
| | Clear all entries from table. More...
|
| |
| void | clearStorage () |
| | Clear the table entries and the table itself. More...
|
| |
| void | shrink () |
| | Shrink the allocated table to approx. twice number of elements. More...
|
| |
| void | transfer (HashTable< T, label, Hash< label > > &) |
| | Transfer the contents of the argument table into this table. More...
|
| |
| Xfer< HashTable< T, label, Hash< label > > > | xfer () |
| | Transfer contents to the Xfer container. More...
|
| |
| T & | operator[] (const label &) |
| | Find and return a hashedEntry. More...
|
| |
| const T & | operator[] (const label &) const |
| | Find and return a hashedEntry. More...
|
| |
| T & | operator() (const label &) |
| | Find and return a hashedEntry, create it null if not present. More...
|
| |
| void | operator= (const HashTable< T, label, Hash< label > > &) |
| | Assignment. More...
|
| |
| void | operator= (std::initializer_list< Tuple2< label, T >>) |
| | Assignment to an initializer list. More...
|
| |
| bool | operator== (const HashTable< T, label, Hash< label > > &) const |
| | Equality. Hash tables are equal if the keys and values are equal. More...
|
| |
| bool | operator!= (const HashTable< T, label, Hash< label > > &) const |
| | The opposite of the equality operation. Takes linear time. More...
|
| |
| iterator | begin () |
| | Iterator set to the beginning of the HashTable. More...
|
| |
| const_iterator | begin () const |
| | const_iterator set to the beginning of the HashTable More...
|
| |
| const_iterator | cbegin () const |
| | const_iterator set to the beginning of the HashTable More...
|
| |
| | HashTableCore () |
| | Construct null. More...
|
| |
| | ClassName ("HashTable") |
| | Define template name and debug. More...
|
| |
template<class T>
class Foam::Map< T >
A HashTable to objects of type <T> with a label key.
- See also
- PtrMap
Definition at line 49 of file Map.H.