Map from edge (expressed as its endpoints) to value. More...
Public Member Functions | |
| EdgeMap (const label size=128) | |
| Construct given initial map size. More... | |
| EdgeMap (Istream &is) | |
| Construct from Istream. More... | |
| EdgeMap (const EdgeMap< T > &map) | |
| Construct as copy. More... | |
 Public Member Functions inherited from HashTable< T, edge, Hash< edge > > | |
| bool | set (const Key &, 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, Key, Hash > &) | |
| Construct as copy. More... | |
| HashTable (const Xfer< HashTable< T, Key, Hash > > &) | |
| Construct by transferring the parameter contents. 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 Key &) const |
| Return true if hashedEntry is found in table. More... | |
| iterator | find (const Key &) |
| Find and return an iterator set at the hashedEntry. More... | |
| const_iterator | find (const Key &) const |
| Find and return an const_iterator set at the hashedEntry. More... | |
| List< Key > | toc () const |
| Return the table of contents. More... | |
| List< Key > | sortedToc () const |
| Return the table of contents as a sorted list. More... | |
| Ostream & | printInfo (Ostream &) const |
| Print information. More... | |
| bool | insert (const Key &, const T &newElmt) |
| Insert a new hashedEntry. More... | |
| bool | erase (const iterator &) |
| Erase a hashedEntry specified by given iterator. More... | |
| bool | erase (const Key &) |
| Erase a hashedEntry specified by the given key. More... | |
| label | erase (const UList< Key > &) |
| Remove entries given by the listed keys from this HashTable. More... | |
| label | erase (const HashTable< AnyType, Key, AnyHash > &) |
| Remove entries given by the given keys from this HashTable. More... | |
| Foam::label | erase (const HashTable< AnyType, Key, 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, Key, Hash > &) |
| Transfer the contents of the argument table into this table. More... | |
| Xfer< HashTable< T, Key, Hash > > | xfer () |
| Transfer contents to the Xfer container. More... | |
| T & | operator[] (const Key &) |
| Find and return a hashedEntry. More... | |
| const T & | operator[] (const Key &) const |
| Find and return a hashedEntry. More... | |
| T & | operator() (const Key &) |
| Find and return a hashedEntry, create it null if not present. More... | |
| void | operator= (const HashTable< T, Key, Hash > &) |
| Assignment. More... | |
| bool | operator== (const HashTable< T, Key, Hash > &) const |
| Equality. Hash tables are equal if the keys and values are equal. More... | |
| bool | operator!= (const HashTable< T, Key, Hash > &) 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... | |
Additional Inherited Members | |
| Public Types inherited from HashTable< T, edge, Hash< edge > > | |
| typedef T | value_type |
| Type of values the HashTable contains. More... | |
| typedef T & | reference |
| Type that can be used for storing into HashTable::value_type. More... | |
| typedef label | size_type |
| The type that can represent the size of a HashTable. More... | |
| Data Fields inherited from HashTable< T, edge, Hash< edge > > | |
| const typedef T & | const_reference |
| Type that can be used for storing into constant. More... | |
Map from edge (expressed as its endpoints) to value.
Copyright © 2011-2018 OpenFOAM | OPENFOAM® is a registered trademark of OpenCFD Ltd.
Generated by
1.8.17
