Namespaces | |
| namespace | example |
| namespace | hash_internal |
| namespace | hash_testing_internal |
| namespace | hashtable_debug_internal |
| namespace | internal_compressed_tuple |
| namespace | internal_layout |
| namespace | memory_internal |
Classes | |
| struct | Alloc |
| class | BitMask |
| struct | CommonAccess |
| class | CompressedTuple |
| class | CompressedTuple<> |
| class | ConstructorTest |
| class | CountingAllocator |
| struct | EraseFirst |
| struct | FlatHashMapPolicy |
| struct | FlatHashSetPolicy |
| struct | GroupPortableImpl |
| struct | hash_policy_traits |
| struct | HashEq |
| struct | HashEq< absl::string_view > |
| struct | HashEq< std::shared_ptr< T > > |
| struct | HashEq< std::string > |
| struct | HashEq< std::unique_ptr< T, D > > |
| struct | HashEq< T * > |
| struct | HashtableDebugProbeSummary |
| struct | HashtablezInfo |
| class | HashtablezInfoHandle |
| class | HashtablezInfoHandlePeer |
| class | HashtablezSampler |
| struct | InsertReturnType |
| struct | is_std_unordered_map |
| struct | is_std_unordered_map< std::unordered_map< T...> > |
| struct | is_std_unordered_set |
| struct | is_std_unordered_set< std::unordered_set< T...> > |
| struct | IsDecomposable |
| struct | IsDecomposable< absl::void_t< decltype(Policy::apply(RequireUsableKey< typename Policy::key_type, Hash, Eq >(), std::declval< Ts >()...))>, Policy, Hash, Eq, Ts...> |
| struct | IsTransparent |
| struct | IsTransparent< T, absl::void_t< typename T::is_transparent > > |
| struct | KeyArg |
| struct | KeyArg< false > |
| class | Layout |
| class | LookupTest |
| struct | map_slot_policy |
| class | map_slot_type |
| class | MembersTest |
| class | ModifiersTest |
| class | node_handle |
| class | node_handle< Policy, PolicyTraits, Alloc, absl::void_t< typename Policy::mapped_type > > |
| class | node_handle_base |
| struct | node_hash_policy |
| class | NodeHashMapPolicy |
| struct | NodeHashSetPolicy |
| struct | NonStandardLayout |
| class | probe_seq |
| class | raw_hash_map |
| class | raw_hash_set |
| struct | RawHashSetTestOnlyAccess |
| struct | RequireUsableKey |
| struct | StatefulTestingEqual |
| struct | StatefulTestingHash |
| struct | StringHash |
| struct | StringHashEq |
| class | Tracked |
Enumerations | |
| enum | Ctrl { kEmpty = -128, kDeleted = -2, kSentinel = -1 } |
Functions | |
| template<size_t Alignment, class Alloc > | |
| void * | Allocate (Alloc *alloc, size_t n) |
| template<typename C > | |
| size_t | AllocatedByteSize (const C &c) |
| template<typename TypeParam > | |
| void | AllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | AllocTest (std::true_type) |
| template<typename TypeParam > | |
| void | BucketCountAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | BucketCountAllocTest (std::true_type) |
| template<typename TypeParam > | |
| void | BucketCountHashAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | BucketCountHashAllocTest (std::true_type) |
| size_t | CapacityToGrowth (size_t capacity) |
| template<class Alloc , class T , class Tuple > | |
| void | ConstructFromTuple (Alloc *alloc, T *ptr, Tuple &&t) |
| void | ConvertDeletedToEmptyAndFullToDeleted (ctrl_t *ctrl, size_t capacity) |
| template<typename TypeParam > | |
| void | CopyConstructorAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | CopyConstructorAllocTest (std::true_type) |
| template<size_t Alignment, class Alloc > | |
| void | Deallocate (Alloc *alloc, void *p, size_t n) |
| template<class T , class Tuple , class F > | |
| decltype (std::declval< F >()(std::declval< T >())) WithConstructed(Tuple &&t | |
| template<class F , class Arg > | |
| decltype (std::declval< F >()(std::declval< const Arg & >(), std::declval< Arg >())) DecomposeValue(F &&f | |
| template<class F , class... Args> | |
| auto | DecomposePair (F &&f, Args &&...args)-> decltype(memory_internal |
| ctrl_t * | EmptyGroup () |
| template<typename C > | |
| size_t | GetHashtableDebugNumProbes (const C &c, const typename C::key_type &key) |
| template<typename C > | |
| std::vector< size_t > | GetHashtableDebugNumProbesHistogram (const C &container) |
| template<typename C > | |
| HashtableDebugProbeSummary | GetHashtableDebugProbeSummary (const C &container) |
| size_t | GrowthToLowerboundCapacity (size_t growth) |
| size_t | H1 (size_t hash, const ctrl_t *ctrl) |
| ctrl_t | H2 (size_t hash) |
| size_t | HashSeed (const ctrl_t *ctrl) |
| template<typename TypeParam > | |
| void | InitializerListBucketAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | InitializerListBucketAllocTest (std::true_type) |
| template<typename TypeParam > | |
| void | InitializerListBucketHashAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | InitializerListBucketHashAllocTest (std::true_type) |
| template<typename TypeParam > | |
| void | InputIteratorBucketAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | InputIteratorBucketAllocTest (std::true_type) |
| template<typename TypeParam > | |
| void | InputIteratorBucketHashAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | InputIteratorBucketHashAllocTest (std::true_type) |
| bool | IsDeleted (ctrl_t c) |
| bool | IsEmpty (ctrl_t c) |
| bool | IsEmptyOrDeleted (ctrl_t c) |
| bool | IsFull (ctrl_t c) |
| template<class T > | |
| constexpr bool | IsNoThrowSwappable () |
| bool | IsValidCapacity (size_t n) |
| template<class Map > | |
| auto | items (const Map &m)-> std |
| template<class Set > | |
| auto | keys (const Set &s)-> std |
| template<typename T > | |
| int | LeadingZeros (T x) |
| template<typename C > | |
| size_t | LowerBoundAllocatedByteSize (size_t num_elements) |
| template<typename TypeParam > | |
| void | MoveConstructorAllocTest (std::false_type) |
| template<typename TypeParam > | |
| void | MoveConstructorAllocTest (std::true_type) |
| size_t | NormalizeCapacity (size_t n) |
| std::tuple | PairArgs () |
| template<class F , class S > | |
| std::pair< std::tuple< F && > , std::tuple< S && > > | PairArgs (F &&f, S &&s) |
| template<class F , class S > | |
| std::pair< std::tuple< const F & > , std::tuple< const S & > > | PairArgs (const std::pair< F, S > &p) |
| template<class F , class S > | |
| std::pair< std::tuple< F && > , std::tuple< S && > > | PairArgs (std::pair< F, S > &&p) |
| template<class F , class S > | |
| auto | PairArgs (std::piecewise_construct_t, F &&f, S &&s)-> decltype(std |
| size_t | RandomSeed () |
| void | RecordEraseSlow (HashtablezInfo *info) |
| void | RecordInsertSlow (HashtablezInfo *info, size_t hash, size_t distance_from_desired) |
| void | RecordRehashSlow (HashtablezInfo *info, size_t total_probe_length) |
| void | RecordStorageChangedSlow (HashtablezInfo *info, size_t size, size_t capacity) |
| REGISTER_TYPED_TEST_CASE_P (LookupTest, Count, Find, EqualRange) | |
| REGISTER_TYPED_TEST_CASE_P (LookupTest, At, OperatorBracket, Count, Find, EqualRange) | |
| REGISTER_TYPED_TEST_CASE_P (ModifiersTest, Clear, Insert, InsertHint, InsertRange, Emplace, EmplaceHint, Erase, EraseRange, EraseKey, Swap) | |
| REGISTER_TYPED_TEST_CASE_P (ModifiersTest, Clear, Insert, InsertHint, InsertRange, InsertOrAssign, InsertOrAssignHint, Emplace, EmplaceHint, TryEmplace, TryEmplaceHint, Erase, EraseRange, EraseKey, Swap) | |
| REGISTER_TYPED_TEST_CASE_P (ConstructorTest, NoArgs, BucketCount, BucketCountHash, BucketCountHashEqual, BucketCountHashEqualAlloc, BucketCountAlloc, BucketCountHashAlloc, Alloc, InputIteratorBucketHashEqualAlloc, InputIteratorBucketAlloc, InputIteratorBucketHashAlloc, CopyConstructor, CopyConstructorAlloc, MoveConstructor, MoveConstructorAlloc, InitializerListBucketHashEqualAlloc, InitializerListBucketAlloc, InitializerListBucketHashAlloc, Assignment, MoveAssignment, AssignmentFromInitializerList, AssignmentOverwritesExisting, MoveAssignmentOverwritesExisting, AssignmentFromInitializerListOverwritesExisting, AssignmentOnSelf) | |
| REGISTER_TYPED_TEST_CASE_P (ConstructorTest, NoArgs, BucketCount, BucketCountHash, BucketCountHashEqual, BucketCountHashEqualAlloc, BucketCountAlloc, BucketCountHashAlloc, Alloc, InputIteratorBucketHashEqualAlloc, InputIteratorBucketAlloc, InputIteratorBucketHashAlloc, CopyConstructor, CopyConstructorAlloc, MoveConstructor, MoveConstructorAlloc, InitializerListBucketHashEqualAlloc, InitializerListBucketAlloc, InitializerListBucketHashAlloc, CopyAssignment, MoveAssignment, AssignmentFromInitializerList, AssignmentOverwritesExisting, MoveAssignmentOverwritesExisting, AssignmentFromInitializerListOverwritesExisting, AssignmentOnSelf) | |
| REGISTER_TYPED_TEST_SUITE_P (MembersTest, Typedefs, SimpleFunctions, BeginEnd) | |
| HashtablezInfoHandle | Sample () |
| HashtablezInfo * | SampleSlow (int64_t *next_sample) |
| void | SetHashtablezEnabled (bool enabled) |
| void | SetHashtablezMaxSamples (int32_t max) |
| void | SetHashtablezSampleParameter (int32_t rate) |
| bool | ShouldInsertBackwards (size_t hash, ctrl_t *ctrl) |
| static_assert (kEmpty &kDeleted &kSentinel &0x80,"Special markers need to have the MSB to make checking for them efficient") | |
| static_assert (kEmpty< kSentinel &&kDeleted< kSentinel,"kEmpty and kDeleted must be smaller than kSentinel to make the ""SIMD test of IsEmptyOrDeleted() efficient") | |
| static_assert (kSentinel==-1,"kSentinel must be -1 to elide loading it from memory into SIMD ""registers (pcmpeqd xmm, xmm)") | |
| static_assert (kEmpty==-128,"kEmpty must be -128 to make the SIMD check for its ""existence efficient (psignb xmm, xmm)") | |
| 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") | |
| static_assert (kDeleted==-2,"kDeleted must be -2 to make the implementation of ""ConvertSpecialToEmptyAndFullToDeleted efficient") | |
| template<typename T > | |
| int | TrailingZeros (T x) |
| TYPED_TEST_P (LookupTest, At) | |
| TYPED_TEST_P (ModifiersTest, Clear) | |
| TYPED_TEST_P (MembersTest, Typedefs) | |
| TYPED_TEST_P (ConstructorTest, NoArgs) | |
| TYPED_TEST_P (ConstructorTest, BucketCount) | |
| TYPED_TEST_P (LookupTest, OperatorBracket) | |
| TYPED_TEST_P (ModifiersTest, Insert) | |
| TYPED_TEST_P (ConstructorTest, BucketCountHash) | |
| TYPED_TEST_P (ModifiersTest, InsertHint) | |
| TYPED_TEST_P (ConstructorTest, BucketCountHashEqual) | |
| TYPED_TEST_P (LookupTest, Count) | |
| TYPED_TEST_P (MembersTest, SimpleFunctions) | |
| TYPED_TEST_P (ConstructorTest, BucketCountHashEqualAlloc) | |
| TYPED_TEST_P (ModifiersTest, InsertRange) | |
| TYPED_TEST_P (MembersTest, BeginEnd) | |
| TYPED_TEST_P (LookupTest, Find) | |
| TYPED_TEST_P (ModifiersTest, InsertOrAssign) | |
| TYPED_TEST_P (LookupTest, EqualRange) | |
| TYPED_TEST_P (ModifiersTest, InsertOrAssignHint) | |
| TYPED_TEST_P (ConstructorTest, BucketCountAlloc) | |
| TYPED_TEST_P (ModifiersTest, Emplace) | |
| TYPED_TEST_P (ModifiersTest, EmplaceHint) | |
| TYPED_TEST_P (ConstructorTest, BucketCountHashAlloc) | |
| TYPED_TEST_P (ModifiersTest, TryEmplace) | |
| TYPED_TEST_P (ConstructorTest, Alloc) | |
| TYPED_TEST_P (ModifiersTest, TryEmplaceHint) | |
| TYPED_TEST_P (ConstructorTest, InputIteratorBucketHashEqualAlloc) | |
| TYPED_TEST_P (ModifiersTest, Erase) | |
| TYPED_TEST_P (ConstructorTest, InputIteratorBucketAlloc) | |
| TYPED_TEST_P (ModifiersTest, EraseRange) | |
| TYPED_TEST_P (ConstructorTest, InputIteratorBucketHashAlloc) | |
| TYPED_TEST_P (ConstructorTest, CopyConstructor) | |
| TYPED_TEST_P (ModifiersTest, EraseKey) | |
| TYPED_TEST_P (ModifiersTest, Swap) | |
| TYPED_TEST_P (ConstructorTest, CopyConstructorAlloc) | |
| TYPED_TEST_P (ConstructorTest, MoveConstructor) | |
| TYPED_TEST_P (ConstructorTest, MoveConstructorAlloc) | |
| TYPED_TEST_P (ConstructorTest, InitializerListBucketHashEqualAlloc) | |
| TYPED_TEST_P (ConstructorTest, InitializerListBucketAlloc) | |
| TYPED_TEST_P (ConstructorTest, InitializerListBucketHashAlloc) | |
| TYPED_TEST_P (ConstructorTest, Assignment) | |
| TYPED_TEST_P (ConstructorTest, CopyAssignment) | |
| TYPED_TEST_P (ConstructorTest, MoveAssignment) | |
| TYPED_TEST_P (ConstructorTest, AssignmentFromInitializerList) | |
| TYPED_TEST_P (ConstructorTest, AssignmentOverwritesExisting) | |
| TYPED_TEST_P (ConstructorTest, MoveAssignmentOverwritesExisting) | |
| TYPED_TEST_P (ConstructorTest, AssignmentFromInitializerListOverwritesExisting) | |
| TYPED_TEST_P (ConstructorTest, AssignmentOnSelf) | |
| TYPED_TEST_SUITE_P (MembersTest) | |
| TYPED_TEST_SUITE_P (ModifiersTest) | |
| TYPED_TEST_SUITE_P (LookupTest) | |
| TYPED_TEST_SUITE_P (ConstructorTest) | |
| void | UnsampleSlow (HashtablezInfo *info) |
| template<typename T > | |
| void | UseType () |
Variables | |
| const bool | kAbslContainerInternalSampleEverything = false |
Definition at line 255 of file raw_hash_set.h.
| void* absl::container_internal::Allocate | ( | Alloc * | alloc, |
| size_t | n | ||
| ) |
Definition at line 47 of file container_memory.h.
| size_t absl::container_internal::AllocatedByteSize | ( | const C & | c | ) |
Definition at line 92 of file hashtable_debug.h.
| void absl::container_internal::AllocTest | ( | std::false_type | ) |
Definition at line 154 of file unordered_map_constructor_test.h.
| void absl::container_internal::AllocTest | ( | std::true_type | ) |
Definition at line 157 of file unordered_map_constructor_test.h.
| void absl::container_internal::BucketCountAllocTest | ( | std::false_type | ) |
Definition at line 104 of file unordered_map_constructor_test.h.
| void absl::container_internal::BucketCountAllocTest | ( | std::true_type | ) |
Definition at line 107 of file unordered_map_constructor_test.h.
| void absl::container_internal::BucketCountHashAllocTest | ( | std::false_type | ) |
Definition at line 122 of file unordered_map_constructor_test.h.
| void absl::container_internal::BucketCountHashAllocTest | ( | std::true_type | ) |
Definition at line 125 of file unordered_map_constructor_test.h.
| size_t absl::container_internal::CapacityToGrowth | ( | size_t | capacity | ) | [inline] |
Definition at line 478 of file raw_hash_set.h.
| void absl::container_internal::ConstructFromTuple | ( | Alloc * | alloc, |
| T * | ptr, | ||
| Tuple && | t | ||
| ) |
Definition at line 135 of file container_memory.h.
| void absl::container_internal::ConvertDeletedToEmptyAndFullToDeleted | ( | ctrl_t * | ctrl, |
| size_t | capacity | ||
| ) | [inline] |
Definition at line 459 of file raw_hash_set.h.
| void absl::container_internal::CopyConstructorAllocTest | ( | std::false_type | ) |
Definition at line 252 of file unordered_map_constructor_test.h.
| void absl::container_internal::CopyConstructorAllocTest | ( | std::true_type | ) |
Definition at line 255 of file unordered_map_constructor_test.h.
| void absl::container_internal::Deallocate | ( | Alloc * | alloc, |
| void * | p, | ||
| size_t | n | ||
| ) |
Definition at line 63 of file container_memory.h.
| absl::container_internal::decltype | ( | std::declval< F > | )(std::declval< T >() | ) |
| absl::container_internal::decltype | ( | std::declval< F > | )(std::declval< const Arg & >(), std::declval< Arg >() | ) |
| auto absl::container_internal::DecomposePair | ( | F && | f, |
| Args &&... | args | ||
| ) |
Definition at line 190 of file container_memory.h.
| ctrl_t* absl::container_internal::EmptyGroup | ( | ) | [inline] |
Definition at line 282 of file raw_hash_set.h.
| size_t absl::container_internal::GetHashtableDebugNumProbes | ( | const C & | c, |
| const typename C::key_type & | key | ||
| ) |
Definition at line 48 of file hashtable_debug.h.
| std::vector<size_t> absl::container_internal::GetHashtableDebugNumProbesHistogram | ( | const C & | container | ) |
Definition at line 57 of file hashtable_debug.h.
| HashtableDebugProbeSummary absl::container_internal::GetHashtableDebugProbeSummary | ( | const C & | container | ) |
Definition at line 78 of file hashtable_debug.h.
| size_t absl::container_internal::GrowthToLowerboundCapacity | ( | size_t | growth | ) | [inline] |
Definition at line 489 of file raw_hash_set.h.
| size_t absl::container_internal::H1 | ( | size_t | hash, |
| const ctrl_t * | ctrl | ||
| ) | [inline] |
Definition at line 304 of file raw_hash_set.h.
| ctrl_t absl::container_internal::H2 | ( | size_t | hash | ) | [inline] |
Definition at line 307 of file raw_hash_set.h.
| size_t absl::container_internal::HashSeed | ( | const ctrl_t * | ctrl | ) | [inline] |
Definition at line 297 of file raw_hash_set.h.
| void absl::container_internal::InitializerListBucketAllocTest | ( | std::false_type | ) |
Definition at line 343 of file unordered_map_constructor_test.h.
| void absl::container_internal::InitializerListBucketAllocTest | ( | std::true_type | ) |
Definition at line 346 of file unordered_map_constructor_test.h.
| void absl::container_internal::InitializerListBucketHashAllocTest | ( | std::false_type | ) |
Definition at line 363 of file unordered_map_constructor_test.h.
| void absl::container_internal::InitializerListBucketHashAllocTest | ( | std::true_type | ) |
Definition at line 366 of file unordered_map_constructor_test.h.
| void absl::container_internal::InputIteratorBucketAllocTest | ( | std::false_type | ) |
Definition at line 190 of file unordered_map_constructor_test.h.
| void absl::container_internal::InputIteratorBucketAllocTest | ( | std::true_type | ) |
Definition at line 193 of file unordered_map_constructor_test.h.
| void absl::container_internal::InputIteratorBucketHashAllocTest | ( | std::false_type | ) |
Definition at line 211 of file unordered_map_constructor_test.h.
| void absl::container_internal::InputIteratorBucketHashAllocTest | ( | std::true_type | ) |
Definition at line 214 of file unordered_map_constructor_test.h.
| bool absl::container_internal::IsDeleted | ( | ctrl_t | c | ) | [inline] |
Definition at line 311 of file raw_hash_set.h.
| bool absl::container_internal::IsEmpty | ( | ctrl_t | c | ) | [inline] |
Definition at line 309 of file raw_hash_set.h.
| bool absl::container_internal::IsEmptyOrDeleted | ( | ctrl_t | c | ) | [inline] |
Definition at line 312 of file raw_hash_set.h.
| bool absl::container_internal::IsFull | ( | ctrl_t | c | ) | [inline] |
Definition at line 310 of file raw_hash_set.h.
| constexpr bool absl::container_internal::IsNoThrowSwappable | ( | ) |
Definition at line 170 of file raw_hash_set.h.
| bool absl::container_internal::IsValidCapacity | ( | size_t | n | ) | [inline] |
Definition at line 449 of file raw_hash_set.h.
| auto absl::container_internal::items | ( | const Map & | m | ) |
Definition at line 146 of file hash_policy_testing.h.
| auto absl::container_internal::keys | ( | const Set & | s | ) |
Definition at line 156 of file hash_policy_testing.h.
| int absl::container_internal::LeadingZeros | ( | T | x | ) |
Definition at line 184 of file raw_hash_set.h.
| size_t absl::container_internal::LowerBoundAllocatedByteSize | ( | size_t | num_elements | ) |
Definition at line 100 of file hashtable_debug.h.
| void absl::container_internal::MoveConstructorAllocTest | ( | std::false_type | ) |
Definition at line 297 of file unordered_map_constructor_test.h.
| void absl::container_internal::MoveConstructorAllocTest | ( | std::true_type | ) |
Definition at line 300 of file unordered_map_constructor_test.h.
| size_t absl::container_internal::NormalizeCapacity | ( | size_t | n | ) | [inline] |
Definition at line 472 of file raw_hash_set.h.
| std::tuple absl::container_internal::PairArgs | ( | ) |
Definition at line 165 of file container_memory.h.
| std::pair<std::tuple<F&&>, std::tuple<S&&> > absl::container_internal::PairArgs | ( | F && | f, |
| S && | s | ||
| ) |
Definition at line 167 of file container_memory.h.
| std::pair<std::tuple<const F&>, std::tuple<const S&> > absl::container_internal::PairArgs | ( | const std::pair< F, S > & | p | ) |
Definition at line 172 of file container_memory.h.
| std::pair<std::tuple<F&&>, std::tuple<S&&> > absl::container_internal::PairArgs | ( | std::pair< F, S > && | p | ) |
Definition at line 177 of file container_memory.h.
| auto absl::container_internal::PairArgs | ( | std::piecewise_construct_t | , |
| F && | f, | ||
| S && | s | ||
| ) |
Definition at line 181 of file container_memory.h.
| size_t absl::container_internal::RandomSeed | ( | ) | [inline] |
Definition at line 28 of file raw_hash_set.cc.
| void absl::container_internal::RecordEraseSlow | ( | HashtablezInfo * | info | ) | [inline] |
Definition at line 122 of file hashtablez_sampler.h.
| void absl::container_internal::RecordInsertSlow | ( | HashtablezInfo * | info, |
| size_t | hash, | ||
| size_t | distance_from_desired | ||
| ) |
Definition at line 264 of file hashtablez_sampler.cc.
| void absl::container_internal::RecordRehashSlow | ( | HashtablezInfo * | info, |
| size_t | total_probe_length | ||
| ) | [inline] |
Definition at line 99 of file hashtablez_sampler.h.
| void absl::container_internal::RecordStorageChangedSlow | ( | HashtablezInfo * | info, |
| size_t | size, | ||
| size_t | capacity | ||
| ) | [inline] |
Definition at line 109 of file hashtablez_sampler.h.
| absl::container_internal::REGISTER_TYPED_TEST_CASE_P | ( | LookupTest | , |
| Count | , | ||
| Find | , | ||
| EqualRange | |||
| ) |
| absl::container_internal::REGISTER_TYPED_TEST_CASE_P | ( | LookupTest | , |
| At | , | ||
| OperatorBracket | , | ||
| Count | , | ||
| Find | , | ||
| EqualRange | |||
| ) |
| absl::container_internal::REGISTER_TYPED_TEST_CASE_P | ( | ModifiersTest | , |
| Clear | , | ||
| Insert | , | ||
| InsertHint | , | ||
| InsertRange | , | ||
| Emplace | , | ||
| EmplaceHint | , | ||
| Erase | , | ||
| EraseRange | , | ||
| EraseKey | , | ||
| Swap | |||
| ) |
| absl::container_internal::REGISTER_TYPED_TEST_CASE_P | ( | ModifiersTest | , |
| Clear | , | ||
| Insert | , | ||
| InsertHint | , | ||
| InsertRange | , | ||
| InsertOrAssign | , | ||
| InsertOrAssignHint | , | ||
| Emplace | , | ||
| EmplaceHint | , | ||
| TryEmplace | , | ||
| TryEmplaceHint | , | ||
| Erase | , | ||
| EraseRange | , | ||
| EraseKey | , | ||
| Swap | |||
| ) |
| absl::container_internal::REGISTER_TYPED_TEST_CASE_P | ( | ConstructorTest | , |
| NoArgs | , | ||
| BucketCount | , | ||
| BucketCountHash | , | ||
| BucketCountHashEqual | , | ||
| BucketCountHashEqualAlloc | , | ||
| BucketCountAlloc | , | ||
| BucketCountHashAlloc | , | ||
| Alloc | , | ||
| InputIteratorBucketHashEqualAlloc | , | ||
| InputIteratorBucketAlloc | , | ||
| InputIteratorBucketHashAlloc | , | ||
| CopyConstructor | , | ||
| CopyConstructorAlloc | , | ||
| MoveConstructor | , | ||
| MoveConstructorAlloc | , | ||
| InitializerListBucketHashEqualAlloc | , | ||
| InitializerListBucketAlloc | , | ||
| InitializerListBucketHashAlloc | , | ||
| Assignment | , | ||
| MoveAssignment | , | ||
| AssignmentFromInitializerList | , | ||
| AssignmentOverwritesExisting | , | ||
| MoveAssignmentOverwritesExisting | , | ||
| AssignmentFromInitializerListOverwritesExisting | , | ||
| AssignmentOnSelf | |||
| ) |
| absl::container_internal::REGISTER_TYPED_TEST_CASE_P | ( | ConstructorTest | , |
| NoArgs | , | ||
| BucketCount | , | ||
| BucketCountHash | , | ||
| BucketCountHashEqual | , | ||
| BucketCountHashEqualAlloc | , | ||
| BucketCountAlloc | , | ||
| BucketCountHashAlloc | , | ||
| Alloc | , | ||
| InputIteratorBucketHashEqualAlloc | , | ||
| InputIteratorBucketAlloc | , | ||
| InputIteratorBucketHashAlloc | , | ||
| CopyConstructor | , | ||
| CopyConstructorAlloc | , | ||
| MoveConstructor | , | ||
| MoveConstructorAlloc | , | ||
| InitializerListBucketHashEqualAlloc | , | ||
| InitializerListBucketAlloc | , | ||
| InitializerListBucketHashAlloc | , | ||
| CopyAssignment | , | ||
| MoveAssignment | , | ||
| AssignmentFromInitializerList | , | ||
| AssignmentOverwritesExisting | , | ||
| MoveAssignmentOverwritesExisting | , | ||
| AssignmentFromInitializerListOverwritesExisting | , | ||
| AssignmentOnSelf | |||
| ) |
| absl::container_internal::REGISTER_TYPED_TEST_SUITE_P | ( | MembersTest | , |
| Typedefs | , | ||
| SimpleFunctions | , | ||
| BeginEnd | |||
| ) |
| HashtablezInfoHandle absl::container_internal::Sample | ( | ) | [inline] |
Definition at line 188 of file hashtablez_sampler.h.
| HashtablezInfo * absl::container_internal::SampleSlow | ( | int64_t * | next_sample | ) |
Definition at line 231 of file hashtablez_sampler.cc.
| void absl::container_internal::SetHashtablezEnabled | ( | bool | enabled | ) |
Definition at line 285 of file hashtablez_sampler.cc.
| void absl::container_internal::SetHashtablezMaxSamples | ( | int32_t | max | ) |
Definition at line 298 of file hashtablez_sampler.cc.
| void absl::container_internal::SetHashtablezSampleParameter | ( | int32_t | rate | ) |
Definition at line 289 of file hashtablez_sampler.cc.
| bool absl::container_internal::ShouldInsertBackwards | ( | size_t | hash, |
| ctrl_t * | ctrl | ||
| ) |
Definition at line 39 of file raw_hash_set.cc.
| 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 | ( | 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" | |||
| ) |
| int absl::container_internal::TrailingZeros | ( | T | x | ) |
Definition at line 176 of file raw_hash_set.h.
| absl::container_internal::TYPED_TEST_P | ( | LookupTest | , |
| At | |||
| ) |
Definition at line 31 of file unordered_map_lookup_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| Clear | |||
| ) |
Definition at line 31 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | MembersTest | , |
| Typedefs | |||
| ) |
Definition at line 34 of file unordered_map_members_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| NoArgs | |||
| ) |
Definition at line 34 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| BucketCount | |||
| ) |
Definition at line 40 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | LookupTest | , |
| OperatorBracket | |||
| ) |
Definition at line 43 of file unordered_map_lookup_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| Insert | |||
| ) |
Definition at line 43 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| BucketCountHash | |||
| ) |
Definition at line 47 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| InsertHint | |||
| ) |
Definition at line 57 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| BucketCountHashEqual | |||
| ) |
Definition at line 57 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | LookupTest | , |
| Count | |||
| ) |
Definition at line 59 of file unordered_map_lookup_test.h.
| absl::container_internal::TYPED_TEST_P | ( | MembersTest | , |
| SimpleFunctions | |||
| ) |
Definition at line 68 of file unordered_map_members_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| BucketCountHashEqualAlloc | |||
| ) |
Definition at line 70 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| InsertRange | |||
| ) |
Definition at line 71 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | MembersTest | , |
| BeginEnd | |||
| ) |
Definition at line 72 of file unordered_map_members_test.h.
| absl::container_internal::TYPED_TEST_P | ( | LookupTest | , |
| Find | |||
| ) |
Definition at line 72 of file unordered_map_lookup_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| InsertOrAssign | |||
| ) |
Definition at line 81 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | LookupTest | , |
| EqualRange | |||
| ) |
Definition at line 90 of file unordered_map_lookup_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| InsertOrAssignHint | |||
| ) |
Definition at line 101 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| BucketCountAlloc | |||
| ) |
Definition at line 117 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| Emplace | |||
| ) |
Definition at line 120 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| EmplaceHint | |||
| ) |
Definition at line 136 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| BucketCountHashAlloc | |||
| ) |
Definition at line 138 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| TryEmplace | |||
| ) |
Definition at line 150 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| Alloc | |||
| ) |
Definition at line 166 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| TryEmplaceHint | |||
| ) |
Definition at line 168 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| InputIteratorBucketHashEqualAlloc | |||
| ) |
Definition at line 170 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| Erase | |||
| ) |
Definition at line 203 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| InputIteratorBucketAlloc | |||
| ) |
Definition at line 206 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| EraseRange | |||
| ) |
Definition at line 222 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| InputIteratorBucketHashAlloc | |||
| ) |
Definition at line 230 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| CopyConstructor | |||
| ) |
Definition at line 234 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| EraseKey | |||
| ) |
Definition at line 234 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ModifiersTest | , |
| Swap | |||
| ) |
Definition at line 247 of file unordered_map_modifiers_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| CopyConstructorAlloc | |||
| ) |
Definition at line 272 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| MoveConstructor | |||
| ) |
Definition at line 278 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| MoveConstructorAlloc | |||
| ) |
Definition at line 318 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| InitializerListBucketHashEqualAlloc | |||
| ) |
Definition at line 324 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| InitializerListBucketAlloc | |||
| ) |
Definition at line 358 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| InitializerListBucketHashAlloc | |||
| ) |
Definition at line 381 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| Assignment | |||
| ) |
Definition at line 385 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| CopyAssignment | |||
| ) |
Definition at line 396 of file unordered_set_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| MoveAssignment | |||
| ) |
Definition at line 405 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| AssignmentFromInitializerList | |||
| ) |
Definition at line 423 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| AssignmentOverwritesExisting | |||
| ) |
Definition at line 432 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| MoveAssignmentOverwritesExisting | |||
| ) |
Definition at line 441 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| AssignmentFromInitializerListOverwritesExisting | |||
| ) |
Definition at line 451 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_P | ( | ConstructorTest | , |
| AssignmentOnSelf | |||
| ) |
Definition at line 460 of file unordered_map_constructor_test.h.
| absl::container_internal::TYPED_TEST_SUITE_P | ( | MembersTest | ) |
| absl::container_internal::TYPED_TEST_SUITE_P | ( | ModifiersTest | ) |
| absl::container_internal::TYPED_TEST_SUITE_P | ( | LookupTest | ) |
| absl::container_internal::TYPED_TEST_SUITE_P | ( | ConstructorTest | ) |
| void absl::container_internal::UnsampleSlow | ( | HashtablezInfo * | info | ) |
Definition at line 260 of file hashtablez_sampler.cc.
| void absl::container_internal::UseType | ( | ) |
Definition at line 32 of file unordered_map_members_test.h.
| ABSL_ATTRIBUTE_WEAK const bool absl::container_internal::kAbslContainerInternalSampleEverything = false |
Definition at line 283 of file hashtablez_sampler.h.