Go to the source code of this file.
|
| class | MinMax< T > |
| | A min/max value pair with additional methods. In addition to conveniently storing values, it can be used for logic operations or to modify data. A few global functions and functors are also provided. More...
|
| |
| class | HashSet< Key, Hash > |
| | A HashTable with keys but without contents that is similar to std::unordered_set. More...
|
| |
|
| | Foam |
| | Namespace for OpenFOAM.
|
| |
|
| label | min (const labelHashSet &set, label minValue=labelMax) |
| | Find the min value in labelHashSet, optionally limited by second argument. More...
|
| |
| label | max (const labelHashSet &set, label maxValue=labelMin) |
| | Find the max value in labelHashSet, optionally limited by second argument. More...
|
| |
| MinMax< label > | minMax (const labelHashSet &set) |
| | Find the min/max values of labelHashSet. More...
|
| |
| template<class Key , class Hash > |
| Ostream & | operator<< (Ostream &os, const HashSet< Key, Hash > &tbl) |
| | Write the list of HashSet keys. More...
|
| |
| template<class Key , class Hash > |
| HashSet< Key, Hash > | operator| (const HashSet< Key, Hash > &hash1, const HashSet< Key, Hash > &hash2) |
| | Combine entries from HashSets. More...
|
| |
| template<class Key , class Hash > |
| HashSet< Key, Hash > | operator& (const HashSet< Key, Hash > &hash1, const HashSet< Key, Hash > &hash2) |
| | Create a HashSet that only contains entries found in both HashSets. More...
|
| |
| template<class Key , class Hash > |
| HashSet< Key, Hash > | operator^ (const HashSet< Key, Hash > &hash1, const HashSet< Key, Hash > &hash2) |
| | Create a HashSet that only contains unique entries (xor) More...
|
| |
Original source file HashSet.H
Definition in file HashSet.H.