40 #ifndef Foam_edgeHashes_H 41 #define Foam_edgeHashes_H A HashTable with keys but without contents that is similar to std::unordered_set. ...
HashSet< edge, Hash< edge > > edgeHashSet
A HashSet with edge for its key. Hashing (and ==) on an edge is symmetric.
HashTable() noexcept
Default construct: empty without allocation (capacity=0)
A HashTable similar to std::unordered_map.
Map from edge (expressed as its endpoints) to value. Hashing (and ==) on an edge is symmetric...