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 edge &, 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, edge, Hash< edge > > &) | |
| Construct as copy. More... | |
| HashTable (const Xfer< HashTable< T, edge, Hash< edge > >> &) | |
| Construct by transferring the parameter contents. More... | |
| HashTable (std::initializer_list< Tuple2< edge, 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 edge &) const |
| Return true if hashedEntry is found in table. More... | |
| iterator | find (const edge &) |
| Find and return an iterator set at the hashedEntry. More... | |
| const_iterator | find (const edge &) const |
| Find and return an const_iterator set at the hashedEntry. More... | |
| List< edge > | toc () const |
| Return the table of contents. More... | |
| List< edge > | sortedToc () const |
| Return the table of contents as a sorted list. More... | |
| Ostream & | printInfo (Ostream &) const |
| Print information. More... | |
| bool | insert (const edge &, const T &newElmt) |
| Insert a new hashedEntry. More... | |
| bool | erase (const iterator &) |
| Erase a hashedEntry specified by given iterator. More... | |
| bool | erase (const edge &) |
| Erase a hashedEntry specified by the given key. More... | |
| label | erase (const UList< edge > &) |
| Remove entries given by the listed keys from this HashTable. More... | |
| label | erase (const HashTable< AnyType, edge, AnyHash > &) |
| Remove entries given by the given keys from this HashTable. More... | |
| Foam::label | erase (const HashTable< AnyType, edge, 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, edge, Hash< edge > > &) |
| Transfer the contents of the argument table into this table. More... | |
| Xfer< HashTable< T, edge, Hash< edge > > > | xfer () |
| Transfer contents to the Xfer container. More... | |
| T & | operator[] (const edge &) |
| Find and return a hashedEntry. More... | |
| const T & | operator[] (const edge &) const |
| Find and return a hashedEntry. More... | |
| T & | operator() (const edge &) |
| Find and return a hashedEntry, create it null if not present. More... | |
| void | operator= (const HashTable< T, edge, Hash< edge > > &) |
| Assignment. More... | |
| void | operator= (std::initializer_list< Tuple2< edge, T >>) |
| Assignment to an initializer list. More... | |
| bool | operator== (const HashTable< T, edge, Hash< edge > > &) const |
| Equality. Hash tables are equal if the keys and values are equal. More... | |
| bool | operator!= (const HashTable< T, edge, Hash< edge > > &) 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... | |
| Public Member Functions inherited from HashTableCore | |
| HashTableCore () | |
| Construct null. More... | |
| ClassName ("HashTable") | |
| Define template name and debug. 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 const T & | const_reference |
| Type that can be used for storing into constant. More... | |
| typedef label | size_type |
| The type that can represent the size of a HashTable. More... | |
| Static Public Member Functions inherited from HashTableCore | |
| static label | canonicalSize (const label) |
| Return a canonical (power-of-two) size. More... | |
| static iteratorEnd | cend () |
| iteratorEnd set to beyond the end of any HashTable More... | |
| static iteratorEnd | end () |
| iteratorEnd set to beyond the end of any HashTable More... | |
| Static Public Attributes inherited from HashTableCore | |
| static const label | maxTableSize |
| Maximum allowable table size. More... | |
Map from edge (expressed as its endpoints) to value.
1.8.13
