40#ifndef Foam_edgeHashes_H
41#define Foam_edgeHashes_H
Map from edge (expressed as its endpoints) to value. Hashing (and ==) on an edge is symmetric.
A HashTable with keys but without contents that is similar to std::unordered_set.
constexpr HashTable() noexcept
An edge is a list of two vertex labels. This can correspond to a directed graph edge or an edge on a ...
HashSet< edge, Hash< edge > > edgeHashSet
A HashSet with edge for its key. Hashing (and ==) on an edge is symmetric.
void T(FieldField< Field, Type > &f1, const FieldField< Field, Type > &f2)
Hash function class. The default definition is for primitives. Non-primitives used to hash entries on...