EdgeMap< T > Class Template Reference

Map from edge (expressed as its endpoints) to value. More...

Inheritance diagram for EdgeMap< T >:
Collaboration diagram for EdgeMap< T >:

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...
 
- Public Member Functions inherited from HashTable< T, edge, Hash< edge > >
bool set (const edge &, const T &newElmt)
 Set a new hashedEntry, overwriting existing entries. More...
 
void set (const HashTable< T, edge, Hash< edge > > &)
 Insert all the entries from the given HashTable,. More...
 
 HashTable (const label size=128)
 Construct given initial table size. More...
 
 HashTable (Istream &, const label size=128)
 Construct from Istream. More...
 
 HashTable (const UList< edge > &keyList, const UList< T > &elmtList)
 Construct from a list of keys and list of elements. More...
 
 HashTable (const HashTable< T, edge, Hash< edge > > &)
 Copy constructor. More...
 
 HashTable (HashTable< T, edge, Hash< edge > > &&)
 Move constructor. More...
 
 HashTable (std::initializer_list< Tuple2< edge, T >>)
 Construct from an initialiser 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< edgetoc () const
 Return the table of contents. More...
 
List< edgesortedToc () const
 Return the table of contents as a sorted list. More...
 
List< const_iteratorsorted () const
 Return a sorted list of constant iterators. More...
 
OstreamprintInfo (Ostream &) const
 Print information. More...
 
bool insert (const edge &, const T &newElmt)
 Insert a new hashedEntry. More...
 
void insert (const HashTable< T, edge, Hash< edge > > &)
 Insert all the entries from the given HashTable. 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...
 
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 operator. More...
 
void operator= (HashTable< T, edge, Hash< edge > > &&)
 Move assignment operator. More...
 
void operator= (std::initializer_list< Tuple2< edge, T >>)
 Assignment to an initialiser 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...
 
- 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...
 

Detailed Description

template<class T>
class Foam::EdgeMap< T >

Map from edge (expressed as its endpoints) to value.

Definition at line 47 of file EdgeMap.H.


The documentation for this class was generated from the following file: