std::unordered_set<K, Hash<K>> with the QSet-style names the CDT kernel uses.
More...
#include <meshkit/detail/storage.hpp>
|
| bool | remove (const K &k) |
| | Erase k.
|
| |
| bool | isEmpty () const |
| | True when the set has no elements.
|
| |
| bool | contains (const K &key) const |
| | Membership test.
|
| |
template<class K>
class meshkit::plan::Set< K >
std::unordered_set<K, Hash<K>> with the QSet-style names the CDT kernel uses.
- Template Parameters
-
◆ contains()
Membership test.
- Parameters
-
| [in] | key | Element to look for. |
- Returns
- True when
key is in the set.
◆ isEmpty()
True when the set has no elements.
◆ remove()
Erase k.
- Parameters
-
- Returns
- True when
k was present.
The documentation for this class was generated from the following file: