|
| UT_Set (const Hasher &hf=Hasher(), const Equal &eql=Equal()) |
|
template<typename InputIt > |
| UT_Set (InputIt first, InputIt last, const Hasher &hf=Hasher(), const Equal &eql=Equal()) |
|
| UT_Set (const K &k, const Hasher &hf=Hasher(), const Equal &eql=Equal()) |
|
| UT_Set (std::initializer_list< K > init, const Hasher &hf=Hasher(), const Equal &eql=Equal()) |
|
int64 | getMemoryUsage (bool inclusive) const |
|
bool | contains (const K &key) const |
|
bool | contains (const UT_Set< K > &src) const |
|
void | clear () |
|
UT_Set< K, H, P > & | operator|= (const UT_Set< K, H, P > &src) |
| Set-wise boolean operations. More...
|
|
UT_Set< K, H, P > & | operator&= (const UT_Set< K, H, P > &src) |
|
UT_Set< K, H, P > & | operator-= (const UT_Set< K, H, P > &src) |
|
template<typename K, typename H = hboost::hash<K>, typename P = std::equal_to<K>>
class UT_Set< K, H, P >
- Examples:
- field3d/f3d_io.C.
Definition at line 58 of file UT_Set.h.
template<typename K, typename H = hboost::hash<K>, typename P = std::equal_to<K>>
The implementation of clear() is O(bucket_count()), not O(size()), which can cause unexpected performance issues if the map has a large capacity. For std::unordered_map this was defect 2550 (http://cplusplus.github.io/LWG/lwg-defects.html#2550) When updating or changing the underlying implemention, verify if this is still necessary.
Definition at line 124 of file UT_Set.h.