|
struct | robin_hood::ROBIN_HOOD_STD::alignment_of< T > |
|
class | robin_hood::ROBIN_HOOD_STD::integer_sequence< T, Ints > |
|
struct | robin_hood::ROBIN_HOOD_STD::detail_::IntSeqImpl< T, Begin, End, bool > |
|
struct | robin_hood::ROBIN_HOOD_STD::detail_::IntSeqImpl< T, Begin, End, bool >::IntSeqCombiner< class, class > |
|
struct | robin_hood::ROBIN_HOOD_STD::detail_::IntSeqImpl< T, Begin, End, bool >::IntSeqCombiner< integer_sequence< TValue, Inds0... >, integer_sequence< TValue, Inds1... > > |
|
struct | robin_hood::ROBIN_HOOD_STD::detail_::IntSeqImpl< T, Begin, Begin, false > |
|
struct | robin_hood::ROBIN_HOOD_STD::detail_::IntSeqImpl< T, Begin, End, true > |
|
class | robin_hood::detail::BulkPoolAllocator< T, MinNumAllocs, MaxNumAllocs > |
|
struct | robin_hood::detail::NodeAllocator< T, MinSize, MaxSize, IsFlat > |
|
struct | robin_hood::detail::NodeAllocator< T, MinSize, MaxSize, true > |
|
struct | robin_hood::detail::NodeAllocator< T, MinSize, MaxSize, false > |
|
struct | robin_hood::detail::swappable::nothrow< T > |
|
struct | robin_hood::is_transparent_tag |
|
struct | robin_hood::pair< T1, T2 > |
|
struct | robin_hood::hash< T, Enable > |
|
struct | robin_hood::hash< std::basic_string< CharT > > |
|
struct | robin_hood::hash< T * > |
|
struct | robin_hood::hash< std::unique_ptr< T > > |
|
struct | robin_hood::hash< std::shared_ptr< T > > |
|
struct | robin_hood::hash< Enum, typename std::enable_if< std::is_enum< Enum >::value >::type > |
|
struct | robin_hood::detail::void_type< T > |
|
struct | robin_hood::detail::has_is_transparent< T, typename > |
|
struct | robin_hood::detail::has_is_transparent< T, typename void_type< typename T::is_transparent >::type > |
|
struct | robin_hood::detail::WrapHash< T > |
|
struct | robin_hood::detail::WrapKeyEqual< T > |
|
class | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual > |
|
class | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::DataNode< M, bool > |
|
class | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::DataNode< M, true > |
|
class | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::DataNode< M, false > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Cloner< M, UseMemcpy > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Cloner< M, true > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Cloner< M, false > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Destroyer< M, IsFlatAndTrivial > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Destroyer< M, true > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Destroyer< M, false > |
|
struct | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::fast_forward_tag |
|
class | robin_hood::detail::Table< IsFlat, MaxLoadFactor100, Key, T, Hash, KeyEqual >::Iter< IsConst > |
|
|
template<std::size_t... Inds> |
using | robin_hood::ROBIN_HOOD_STD::index_sequence = integer_sequence< std::size_t, Inds... > |
|
template<class T , T N> |
using | robin_hood::ROBIN_HOOD_STD::make_integer_sequence = typename detail_::IntSeqImpl< T, 0, N,(N - 0)==1 >::TResult |
|
template<std::size_t N> |
using | robin_hood::ROBIN_HOOD_STD::make_index_sequence = make_integer_sequence< std::size_t, N > |
|
template<class... T> |
using | robin_hood::ROBIN_HOOD_STD::index_sequence_for = make_index_sequence< sizeof...(T)> |
|
using | robin_hood::detail::SizeT = uint32_t |
|
template<typename Key , typename T , typename Hash = hash<Key>, typename KeyEqual = std::equal_to<Key>, size_t MaxLoadFactor100 = 80> |
using | robin_hood::unordered_flat_map = detail::Table< true, MaxLoadFactor100, Key, T, Hash, KeyEqual > |
|
template<typename Key , typename T , typename Hash = hash<Key>, typename KeyEqual = std::equal_to<Key>, size_t MaxLoadFactor100 = 80> |
using | robin_hood::unordered_node_map = detail::Table< false, MaxLoadFactor100, Key, T, Hash, KeyEqual > |
|
template<typename Key , typename T , typename Hash = hash<Key>, typename KeyEqual = std::equal_to<Key>, size_t MaxLoadFactor100 = 80> |
using | robin_hood::unordered_map = detail::Table< sizeof(robin_hood::pair< Key, T >)<=sizeof(size_t) *6 &&std::is_nothrow_move_constructible< robin_hood::pair< Key, T > >::value &&std::is_nothrow_move_assignable< robin_hood::pair< Key, T > >::value, MaxLoadFactor100, Key, T, Hash, KeyEqual > |
|
template<typename Key , typename Hash = hash<Key>, typename KeyEqual = std::equal_to<Key>, size_t MaxLoadFactor100 = 80> |
using | robin_hood::unordered_flat_set = detail::Table< true, MaxLoadFactor100, Key, void, Hash, KeyEqual > |
|
template<typename Key , typename Hash = hash<Key>, typename KeyEqual = std::equal_to<Key>, size_t MaxLoadFactor100 = 80> |
using | robin_hood::unordered_node_set = detail::Table< false, MaxLoadFactor100, Key, void, Hash, KeyEqual > |
|
template<typename Key , typename Hash = hash<Key>, typename KeyEqual = std::equal_to<Key>, size_t MaxLoadFactor100 = 80> |
using | robin_hood::unordered_set = detail::Table< sizeof(Key)<=sizeof(size_t) *6 &&std::is_nothrow_move_constructible< Key >::value &&std::is_nothrow_move_assignable< Key >::value, MaxLoadFactor100, Key, void, Hash, KeyEqual > |
|
|
template<typename T > |
T | robin_hood::detail::rotr (T x, unsigned k) |
|
template<typename T > |
T | robin_hood::detail::reinterpret_cast_no_cast_align_warning (void *ptr) noexcept |
|
template<typename T > |
T | robin_hood::detail::reinterpret_cast_no_cast_align_warning (void const *ptr) noexcept |
|
template<typename E , typename... Args> |
| robin_hood::detail::ROBIN_HOOD (NOINLINE) void doThrow(Args &&... ROBIN_HOOD_UNUSED(args)) |
|
template<typename E , typename T , typename... Args> |
T * | robin_hood::detail::assertNotNull (T *t, Args &&... args) |
|
template<typename T > |
T | robin_hood::detail::unaligned_load (void const *ptr) noexcept |
|
template<typename A , typename B > |
void | robin_hood::swap (pair< A, B > &a, pair< A, B > &b) noexcept(noexcept(std::declval< pair< A, B > & >().swap(std::declval< pair< A, B > & >()))) |
|
template<typename A , typename B > |
constexpr bool | robin_hood::operator== (pair< A, B > const &x, pair< A, B > const &y) |
|
template<typename A , typename B > |
constexpr bool | robin_hood::operator!= (pair< A, B > const &x, pair< A, B > const &y) |
|
template<typename A , typename B > |
constexpr bool | robin_hood::operator< (pair< A, B > const &x, pair< A, B > const &y) noexcept(noexcept(std::declval< A const & >()< std::declval< A const & >()) &&noexcept(std::declval< B const & >()< std::declval< B const & >())) |
|
template<typename A , typename B > |
constexpr bool | robin_hood::operator> (pair< A, B > const &x, pair< A, B > const &y) |
|
template<typename A , typename B > |
constexpr bool | robin_hood::operator<= (pair< A, B > const &x, pair< A, B > const &y) |
|
template<typename A , typename B > |
constexpr bool | robin_hood::operator>= (pair< A, B > const &x, pair< A, B > const &y) |
|
size_t | robin_hood::hash_bytes (void const *ptr, size_t len) noexcept |
|
size_t | robin_hood::hash_int (uint64_t x) noexcept |
|
| robin_hood::ROBIN_HOOD_HASH_INT (bool) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (char) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (signed char) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (unsigned char) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (char16_t) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (char32_t) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (wchar_t) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (short) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (unsigned short) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (int) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (unsigned int) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (long) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (long long) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (unsigned long) |
|
| robin_hood::ROBIN_HOOD_HASH_INT (unsigned long long) |
|