raw_hash_set.h File Reference

#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <iterator>
#include <limits>
#include <memory>
#include <tuple>
#include <type_traits>
#include <utility>
#include "absl/base/internal/bits.h"
#include "absl/base/internal/endian.h"
#include "absl/base/port.h"
#include "absl/container/internal/common.h"
#include "absl/container/internal/compressed_tuple.h"
#include "absl/container/internal/container_memory.h"
#include "absl/container/internal/hash_policy_traits.h"
#include "absl/container/internal/hashtable_debug_hooks.h"
#include "absl/container/internal/hashtablez_sampler.h"
#include "absl/container/internal/have_sse.h"
#include "absl/container/internal/layout.h"
#include "absl/memory/memory.h"
#include "absl/meta/type_traits.h"
#include "absl/utility/utility.h"

Include dependency graph for raw_hash_set.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	absl::container_internal::BitMask< T, SignificantBits, Shift >
class	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::const_iterator
class	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::constructor
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::EmplaceDecomposable
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::EqualElement< K1 >
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::FindElement
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::FindInfo
struct	absl::container_internal::GroupPortableImpl
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::HashElement
struct	absl::container_internal::hashtable_debug_internal::HashtableDebugAccess< Set, absl::void_t< typename Set::raw_hash_set > >
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::InsertSlot< do_destroy >
struct	absl::container_internal::IsDecomposable< E, Policy, Hash, Eq, Ts >
struct	absl::container_internal::IsDecomposable< absl::void_t< decltype(Policy::apply(RequireUsableKey< typename Policy::key_type, Hash, Eq >(), std::declval< Ts >()...))>, Policy, Hash, Eq, Ts...>
class	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::iterator
class	absl::container_internal::probe_seq< Width >
class	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >
struct	absl::container_internal::RequireUsableKey< ContainerKey, Hash, Eq >
struct	absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >::SameAsElementReference< T >
Namespaces
namespace	absl
namespace	absl::container_internal
namespace	absl::container_internal::hashtable_debug_internal
Enumerations
enum	absl::container_internal::Ctrl { absl::container_internal::kEmpty = -128, absl::container_internal::kDeleted = -2, absl::container_internal::kSentinel = -1 }
Functions
size_t	absl::container_internal::CapacityToGrowth (size_t capacity)
void	absl::container_internal::ConvertDeletedToEmptyAndFullToDeleted (ctrl_t *ctrl, size_t capacity)
ctrl_t *	absl::container_internal::EmptyGroup ()
size_t	absl::container_internal::GrowthToLowerboundCapacity (size_t growth)
size_t	absl::container_internal::H1 (size_t hash, const ctrl_t *ctrl)
ctrl_t	absl::container_internal::H2 (size_t hash)
size_t	absl::container_internal::HashSeed (const ctrl_t *ctrl)
bool	absl::container_internal::IsDeleted (ctrl_t c)
bool	absl::container_internal::IsEmpty (ctrl_t c)
bool	absl::container_internal::IsEmptyOrDeleted (ctrl_t c)
bool	absl::container_internal::IsFull (ctrl_t c)
template<class T >
constexpr bool	absl::container_internal::IsNoThrowSwappable ()
bool	absl::container_internal::IsValidCapacity (size_t n)
template<typename T >
int	absl::container_internal::LeadingZeros (T x)
size_t	absl::container_internal::NormalizeCapacity (size_t n)
bool	absl::container_internal::ShouldInsertBackwards (size_t hash, ctrl_t *ctrl)
	absl::container_internal::static_assert (kEmpty &kDeleted &kSentinel &0x80,"Special markers need to have the MSB to make checking for them efficient")
	absl::container_internal::static_assert (kEmpty< kSentinel &&kDeleted< kSentinel,"kEmpty and kDeleted must be smaller than kSentinel to make the ""SIMD test of IsEmptyOrDeleted() efficient")
	absl::container_internal::static_assert (kSentinel==-1,"kSentinel must be -1 to elide loading it from memory into SIMD ""registers (pcmpeqd xmm, xmm)")
	absl::container_internal::static_assert (kEmpty==-128,"kEmpty must be -128 to make the SIMD check for its ""existence efficient (psignb xmm, xmm)")
	absl::container_internal::static_assert (~kEmpty &~kDeleted &kSentinel &0x7F,"kEmpty and kDeleted must share an unset bit that is not shared ""by kSentinel to make the scalar test for MatchEmptyOrDeleted() ""efficient")
	absl::container_internal::static_assert (kDeleted==-2,"kDeleted must be -2 to make the implementation of ""ConvertSpecialToEmptyAndFullToDeleted efficient")
template<typename T >
int	absl::container_internal::TrailingZeros (T x)