Aleph::FlatMap< Key, T, Compare > Member List

This is the complete list of members for Aleph::FlatMap< Key, T, Compare >, including all inherited members.

at(const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
at(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
begin() noexcept	Aleph::FlatMap< Key, T, Compare >	inline
begin() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
capacity() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
cbegin() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
cend() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
clear() noexcept	Aleph::FlatMap< Key, T, Compare >	inline
cmp_	Aleph::FlatMap< Key, T, Compare >	private
const_iterator typedef	Aleph::FlatMap< Key, T, Compare >
contains(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
count(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
emplace(KArgs &&...kargs)	Aleph::FlatMap< Key, T, Compare >	inline
empty() noexcept	Aleph::FlatMap< Key, T, Compare >	inline
end() noexcept	Aleph::FlatMap< Key, T, Compare >	inline
end() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
equal_range(const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
equal_range(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
erase(const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
erase(const_iterator it)	Aleph::FlatMap< Key, T, Compare >	inline
find(const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
find(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
FlatMap(size_t cap=MemArray< Key >::Min_Dim)	Aleph::FlatMap< Key, T, Compare >	inlineexplicit
FlatMap(const Compare &cmp, size_t cap=MemArray< Key >::Min_Dim)	Aleph::FlatMap< Key, T, Compare >	inlineexplicit
FlatMap(It first, It last, const Compare &cmp=Compare())	Aleph::FlatMap< Key, T, Compare >	inline
FlatMap(std::initializer_list< std::pair< Key, T > > l, const Compare &cmp=Compare())	Aleph::FlatMap< Key, T, Compare >	inline
FlatMap(const FlatMap &)=default	Aleph::FlatMap< Key, T, Compare >
FlatMap(FlatMap &&) noexcept=default	Aleph::FlatMap< Key, T, Compare >
insert(const Key &k, const T &v)	Aleph::FlatMap< Key, T, Compare >	inline
insert(Key &&k, T &&v)	Aleph::FlatMap< Key, T, Compare >	inline
insert(const std::pair< Key, T > &p)	Aleph::FlatMap< Key, T, Compare >	inline
insert(std::pair< Key, T > &&p)	Aleph::FlatMap< Key, T, Compare >	inline
insert_or_assign(const Key &k, const T &v)	Aleph::FlatMap< Key, T, Compare >	inline
insert_or_assign(Key &&k, T &&v)	Aleph::FlatMap< Key, T, Compare >	inline
is_empty() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
Item_Type typedef	Aleph::FlatMap< Key, T, Compare >
iterator typedef	Aleph::FlatMap< Key, T, Compare >
key_compare typedef	Aleph::FlatMap< Key, T, Compare >
Key_Type typedef	Aleph::FlatMap< Key, T, Compare >
key_type typedef	Aleph::FlatMap< Key, T, Compare >
keys() const	Aleph::FlatMap< Key, T, Compare >	inline
keys_	Aleph::FlatMap< Key, T, Compare >	private
keys_data() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
lower_bound(const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
lower_bound(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
lower_idx(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inlineprivate
make_room(const size_t pos)	Aleph::FlatMap< Key, T, Compare >	inlineprivate
mapped_type typedef	Aleph::FlatMap< Key, T, Compare >
match_at(size_t pos, const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inlineprivate
nth_key(size_t i) const	Aleph::FlatMap< Key, T, Compare >	inline
nth_value(size_t i)	Aleph::FlatMap< Key, T, Compare >	inline
nth_value(size_t i) const	Aleph::FlatMap< Key, T, Compare >	inline
operator!=(const FlatMap &m) const	Aleph::FlatMap< Key, T, Compare >	inline
operator=(const FlatMap &)=default	Aleph::FlatMap< Key, T, Compare >
operator=(FlatMap &&) noexcept=default	Aleph::FlatMap< Key, T, Compare >
operator==(const FlatMap &m) const	Aleph::FlatMap< Key, T, Compare >	inline
operator[](const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
operator[](Key &&k)	Aleph::FlatMap< Key, T, Compare >	inline
remove_at(const size_t pos)	Aleph::FlatMap< Key, T, Compare >	inlineprivate
reserve(size_t cap)	Aleph::FlatMap< Key, T, Compare >	inline
size() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
size_type typedef	Aleph::FlatMap< Key, T, Compare >
sort_and_unique()	Aleph::FlatMap< Key, T, Compare >	inlineprivate
swap(FlatMap &m) noexcept(std::is_nothrow_swappable_v< Compare >)	Aleph::FlatMap< Key, T, Compare >	inline
traverse(Operation operation)	Aleph::FlatMap< Key, T, Compare >	inline
traverse(Operation operation) const	Aleph::FlatMap< Key, T, Compare >	inline
upper_bound(const Key &k)	Aleph::FlatMap< Key, T, Compare >	inline
upper_bound(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inline
upper_idx(const Key &k) const	Aleph::FlatMap< Key, T, Compare >	inlineprivate
vals_	Aleph::FlatMap< Key, T, Compare >	private
value_type typedef	Aleph::FlatMap< Key, T, Compare >
values() const	Aleph::FlatMap< Key, T, Compare >	inline
values_data() noexcept	Aleph::FlatMap< Key, T, Compare >	inline
values_data() const noexcept	Aleph::FlatMap< Key, T, Compare >	inline
~FlatMap()=default	Aleph::FlatMap< Key, T, Compare >