|
| label | min (const labelHashSet &set, label minValue=labelMax) |
| | Find the min value in labelHashSet, optionally limited by second argument.
|
| label | max (const labelHashSet &set, label maxValue=labelMin) |
| | Find the max value in labelHashSet, optionally limited by second argument.
|
| MinMax< label > | minMax (const labelHashSet &set) |
| | Find the min/max values of labelHashSet.
|
| template<class Key, class Hash> |
| Ostream & | operator<< (Ostream &os, const HashSet< Key, Hash > &rhs) |
| | Write the list of HashSet keys.
|
| template<class Key, class Hash> |
| HashSet< Key, Hash > | operator| (const HashSet< Key, Hash > &a, const HashSet< Key, Hash > &b) |
| | Combine entries (OR) for two HashSets.
|
| template<class Key, class Hash> |
| HashSet< Key, Hash > | operator& (const HashSet< Key, Hash > &a, const HashSet< Key, Hash > &b) |
| | Subset (AND) intersection of two HashSet.
|
| template<class Key, class Hash> |
| HashSet< Key, Hash > | operator^ (const HashSet< Key, Hash > &a, const HashSet< Key, Hash > &b) |
| | Create a HashSet that only contains unique entries (XOR).
|
| template<class Key, class Hash> |
| HashSet< Key, Hash > | operator- (const HashSet< Key, Hash > &a, const HashSet< Key, Hash > &b) |
| | Subset difference of two HashSets.
|
Original source file HashSet.H
Definition in file HashSet.H.