Classes | Namespaces | Macros | Typedefs | Enumerations | Functions
abseil-cpp/absl/container/internal/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/config.h"
#include "absl/base/internal/endian.h"
#include "absl/base/internal/prefetch.h"
#include "absl/base/optimization.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/memory/memory.h"
#include "absl/meta/type_traits.h"
#include "absl/numeric/bits.h"
#include "absl/utility/utility.h"
Include dependency graph for abseil-cpp/absl/container/internal/raw_hash_set.h:

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::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::NonIterableBitMask< T, SignificantBits, Shift >
 
class  absl::container_internal::probe_seq< Width >
 
class  absl::container_internal::raw_hash_set< Policy, Hash, Eq, Alloc >
 
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

 absl
 
 absl::container_internal
 
 absl::container_internal::hashtable_debug_internal
 

Macros

#define ABSL_INTERNAL_ASSERT_IS_FULL(ctrl, msg)   ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) && msg)
 

Typedefs

using absl::container_internal::Group = GroupPortableImpl
 
using absl::container_internal::h2_t = uint8_t
 

Enumerations

enum  absl::container_internal::ctrl_t : int8_t { absl::container_internal::kEmpty = -128, absl::container_internal::kDeleted = -2, absl::container_internal::kSentinel = -1 }
 

Functions

size_t absl::container_internal::AllocSize (size_t capacity, size_t slot_size, size_t slot_align)
 
void absl::container_internal::AssertIsValid (ctrl_t *ctrl)
 
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 ()
 
template<typename P , typename H , typename E , typename A , typename Predicate >
raw_hash_set< P, H, E, A >::size_type absl::container_internal::EraseIf (Predicate &pred, raw_hash_set< P, H, E, A > *c)
 
template FindInfo absl::container_internal::find_first_non_full (const ctrl_t *, size_t, size_t)
 
size_t absl::container_internal::GrowthToLowerboundCapacity (size_t growth)
 
size_t absl::container_internal::H1 (size_t hash, const ctrl_t *ctrl)
 
h2_t absl::container_internal::H2 (size_t hash)
 
bool absl::container_internal::is_small (size_t capacity)
 
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 (std::false_type)
 
template<class T >
constexpr bool absl::container_internal::IsNoThrowSwappable (std::true_type={})
 
bool absl::container_internal::IsValidCapacity (size_t n)
 
size_t absl::container_internal::NormalizeCapacity (size_t n)
 
constexpr size_t absl::container_internal::NumClonedBytes ()
 
size_t absl::container_internal::PerTableSalt (const ctrl_t *ctrl)
 
probe_seq< Group::kWidth > absl::container_internal::probe (const ctrl_t *ctrl, size_t hash, size_t capacity)
 
void absl::container_internal::ResetCtrl (size_t capacity, ctrl_t *ctrl, const void *slot, size_t slot_size)
 
template<class InputIter >
size_t absl::container_internal::SelectBucketCountForIterRange (InputIter first, InputIter last, size_t bucket_count)
 
void absl::container_internal::SetCtrl (size_t i, ctrl_t h, size_t capacity, ctrl_t *ctrl, const void *slot, size_t slot_size)
 
void absl::container_internal::SetCtrl (size_t i, h2_t h, size_t capacity, ctrl_t *ctrl, const void *slot, size_t slot_size)
 
bool absl::container_internal::ShouldInsertBackwards (size_t hash, const ctrl_t *ctrl)
 
size_t absl::container_internal::SlotOffset (size_t capacity, size_t slot_align)
 
template<typename AllocType >
void absl::container_internal::SwapAlloc (AllocType &, AllocType &, std::false_type)
 
template<typename AllocType >
void absl::container_internal::SwapAlloc (AllocType &lhs, AllocType &rhs, std::true_type)
 
template<typename T >
uint32_t absl::container_internal::TrailingZeros (T x)
 

Macro Definition Documentation

◆ ABSL_INTERNAL_ASSERT_IS_FULL

#define ABSL_INTERNAL_ASSERT_IS_FULL (   ctrl,
  msg 
)    ABSL_HARDENING_ASSERT((ctrl != nullptr && IsFull(*ctrl)) && msg)


grpc
Author(s):
autogenerated on Fri May 16 2025 03:01:27