_inside_ | gum::Set< Key, Alloc > | private |
allocator_type typedef | gum::Set< Key, Alloc > | |
begin() const | gum::Set< Key, Alloc > | |
beginSafe() const | gum::Set< Key, Alloc > | |
capacity() const | gum::Set< Key, Alloc > | |
cbegin() const | gum::Set< Key, Alloc > | |
cbeginSafe() const | gum::Set< Key, Alloc > | |
cend() const noexcept | gum::Set< Key, Alloc > | |
cendSafe() const noexcept | gum::Set< Key, Alloc > | |
clear() | gum::Set< Key, Alloc > | |
const_iterator typedef | gum::Set< Key, Alloc > | |
const_iterator_safe typedef | gum::Set< Key, Alloc > | |
const_pointer typedef | gum::Set< Key, Alloc > | |
const_reference typedef | gum::Set< Key, Alloc > | |
constEnd4Statics() | gum::Set< Key, Alloc > | static |
constEndSafe4Statics() | gum::Set< Key, Alloc > | static |
contains(const Key &k) const | gum::Set< Key, Alloc > | |
difference_type typedef | gum::Set< Key, Alloc > | |
emplace(Args &&... args) | gum::Set< Key, Alloc > | |
emplace(Args &&... args) | gum::Set< Key, Alloc > | |
empty() const noexcept | gum::Set< Key, Alloc > | |
end() const noexcept | gum::Set< Key, Alloc > | |
end4Statics() | gum::Set< Key, Alloc > | static |
endSafe() const noexcept | gum::Set< Key, Alloc > | |
endSafe4Statics() | gum::Set< Key, Alloc > | static |
erase(const Key &k) | gum::Set< Key, Alloc > | |
erase(const iterator_safe &k) | gum::Set< Key, Alloc > | |
exists(const Key &k) const | gum::Set< Key, Alloc > | |
hashMap(NewKey(*f)(const Key &), Size capacity=0) const | gum::Set< Key, Alloc > | |
hashMap(const NewKey &val, Size size=0) const | gum::Set< Key, Alloc > | |
insert(const Key &k) | gum::Set< Key, Alloc > | |
insert(Key &&k) | gum::Set< Key, Alloc > | |
isProperSubsetOf(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isProperSubsetOf(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isProperSupersetOf(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isProperSupersetOf(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isSubsetOrEqual(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isSubsetOrEqual(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isSupersetOrEqual(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
isSupersetOrEqual(const Set< Key, OtherAlloc > &s) const | gum::Set< Key, Alloc > | |
iterator typedef | gum::Set< Key, Alloc > | |
iterator_safe typedef | gum::Set< Key, Alloc > | |
listMap(NewKey(*f)(const Key &)) const | gum::Set< Key, Alloc > | |
operator!=(const Set< Key, OtherAlloc > &s2) const | gum::Set< Key, Alloc > | |
operator!=(const Set< Key, OtherAlloc > &s2) const | gum::Set< Key, Alloc > | |
operator*(const Set< Key, OtherAlloc > &s2) const | gum::Set< Key, Alloc > | |
operator*=(const Set< Key, OtherAlloc > &s2) | gum::Set< Key, Alloc > | |
operator+(const Set< Key, OtherAlloc > &s2) const | gum::Set< Key, Alloc > | |
operator+=(const Set< Key, OtherAlloc > &s2) | gum::Set< Key, Alloc > | |
operator-(const Set< Key, OtherAlloc > &s2) const | gum::Set< Key, Alloc > | |
operator<<(const Key &k) | gum::Set< Key, Alloc > | |
operator<<(Key &&k) | gum::Set< Key, Alloc > | |
operator=(const Set< Key, Alloc > &from) | gum::Set< Key, Alloc > | |
operator=(const Set< Key, OtherAlloc > &from) | gum::Set< Key, Alloc > | |
operator=(Set< Key, Alloc > &&from) | gum::Set< Key, Alloc > | |
operator==(const Set< Key, OtherAlloc > &s2) const | gum::Set< Key, Alloc > | |
operator>>(const Key &k) | gum::Set< Key, Alloc > | |
pointer typedef | gum::Set< Key, Alloc > | |
reference typedef | gum::Set< Key, Alloc > | |
resize(Size new_capacity) | gum::Set< Key, Alloc > | |
resizePolicy() const | gum::Set< Key, Alloc > | |
Set class | gum::Set< Key, Alloc > | friend |
Set(Size capacity=HashTableConst::default_size, bool resize_policy=true) | gum::Set< Key, Alloc > | explicit |
Set(std::initializer_list< Key > list) | gum::Set< Key, Alloc > | |
Set(const Set< Key, Alloc > &aHT) | gum::Set< Key, Alloc > | |
Set(const Set< Key, OtherAlloc > &aHT) | gum::Set< Key, Alloc > | |
Set(Set< Key, Alloc > &&aHT) | gum::Set< Key, Alloc > | |
Set(const HashTable< Key, bool, Alloc > &h) | gum::Set< Key, Alloc > | private |
Set(const Set< Key, OtherAlloc > &s) | gum::Set< Key, Alloc > | |
SetIterator< Key > class | gum::Set< Key, Alloc > | friend |
SetIteratorSafe< Key > class | gum::Set< Key, Alloc > | friend |
setResizePolicy(const bool new_policy) | gum::Set< Key, Alloc > | |
size() const noexcept | gum::Set< Key, Alloc > | |
size_type typedef | gum::Set< Key, Alloc > | |
toString() const | gum::Set< Key, Alloc > | |
value_type typedef | gum::Set< Key, Alloc > | |
~Set() | gum::Set< Key, Alloc > | |