gum::Set< Key > Member List

This is the complete list of members for gum::Set< Key >, including all inherited members.

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