Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
KeyedCollection_HashTable.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#include "Stroika/Foundation/Common/Concepts.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
9
11
12 /*
13 ********************************************************************************
14 *********** KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::Rep_ ***************
15 ********************************************************************************
16 */
17 template <typename T, typename KEY_TYPE, typename TRAITS>
18 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (KeyedCollection_HashTable_Support::IValidHashTableTraits<T, KEY_TYPE>) HASH_TABLE_TRAITS>
19 class KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::Rep_
20 : public Private::HashTableBasedContainerRepImpl<KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::Rep_<HASH_TABLE_TRAITS>, IImplRepBase_>,
21 public Memory::UseBlockAllocationIfAppropriate<Rep_<HASH_TABLE_TRAITS>> {
22
23 private:
24 using inherited =
25 Private::HashTableBasedContainerRepImpl<KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::Rep_<HASH_TABLE_TRAITS>, IImplRepBase_>;
26
27 private:
28 // these are stored inside fData_ (often zero sized so no matter) - but if not zero sized - @todo just re-use the space inside fData_
29 [[no_unique_address]] const KeyExtractorType fKeyExtractor_;
30
31 public:
32 Rep_ (const KeyExtractorType& keyExtractor, HASHTABLE<HASH_TABLE_TRAITS>&& src)
33 : fKeyExtractor_{keyExtractor}
34 , fData_{move (src)}
35 {
36 }
37 Rep_ (const Rep_& from) = default;
38
39 public:
40 nonvirtual Rep_& operator= (const Rep_&) = delete;
41
42 // Iterable<T>::_IRep overrides
43 public:
44 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
45 {
47 return Memory::MakeSharedPtr<Rep_> (*this);
48 }
49 virtual Iterator<value_type> MakeIterator () const override
50 {
52 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
53 }
54 virtual size_t size () const override
55 {
57 return fData_.size ();
58 }
59 virtual bool empty () const override
60 {
62 return fData_.empty ();
63 }
64 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
65 {
67 fData_.Apply ([&] (auto i) { doToElement (i.fKey); }, seq); // the 'fKey' part of the hash-table elements contain our entire object - there is no fValue
68 }
69 virtual Iterator<T> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
70 {
72 return this->inherited::Find (that, seq); // @todo rewrite to use fData
73 }
74 virtual Iterator<value_type> Find_equal_to (const ArgByValueType<value_type>& v, [[maybe_unused]] Execution::SequencePolicy seq) const override
75 {
76 // if doing a find by 'equals-to' - we already have this indexed
77 auto found = fData_.find (v);
78 Ensure ((found == fData_.end () and this->inherited::Find_equal_to (v, seq) == Iterator<value_type>{nullptr}) or
79 (found == Debug::UncheckedDynamicCast<const IteratorRep_&> (this->inherited::Find_equal_to (v, seq).ConstGetRep ()).fIterator));
80 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, found.GetUnderlyingIteratorRep ())};
81 }
82
83 // KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep overrides
84 public:
85 virtual KeyExtractorType GetKeyExtractor () const override
86 {
88 return fKeyExtractor_;
89 }
90 virtual KeyEqualityComparerType GetKeyEqualityComparer () const override
91 {
93 return fData_.key_eq ().fKeyComparer;
94 }
95 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneEmpty () const override
96 {
98 // lose data but keep compare/extractor functions
99 return Memory::MakeSharedPtr<Rep_> (this->fKeyExtractor_, HASHTABLE<HASH_TABLE_TRAITS>{fData_.hash_function (), fData_.key_eq ()});
100 }
101 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
102 {
103 RequireNotNull (i);
105 auto result = Memory::MakeSharedPtr<Rep_> (*this);
106 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
107 result->fData_.MoveIteratorHereAfterClone (&iteratorRep.fIterator, &fData_);
108 i->Refresh (); // reflect updated rep
109 return result;
110 }
111 virtual bool Lookup (ArgByValueType<KeyType> key, optional<value_type>* item) const override
112 {
114 static_assert (same_as<value_type, typename DataStructureImplType_::key_type>);
115 auto i = fData_.find (key); // using AlternateFindType overload of find()
116 if (i == fData_.end ()) {
117 if (item != nullptr) {
118 *item = nullopt;
119 }
120 return false;
121 }
122 else {
123 if (item != nullptr) {
124 *item = i->fKey; // the key in the HashTable is the whole object because of how we declared it
125 }
126 return true;
127 }
128 return false;
129 }
130 virtual bool Add (ArgByValueType<value_type> item) override
131 {
133 size_t oldSize = this->size ();
134 static_assert (DataStructureImplType_::TraitsType::kAddOrExtendOrReplace == AddOrExtendOrReplaceMode::eAddReplaces); // here we count on this setting
135 (void)fData_.Add (item); // returns if there was a change, but this KeyedCollection returns true iff collection changed size
136 bool newItemAdded = this->size () != oldSize;
137 fChangeCounts_.PerformedChange ();
138 return newItemAdded;
139 }
140 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
141 {
143 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
144 auto nextStdI = fData_.erase (iteratorRep.fIterator.GetUnderlyingIteratorRep ());
145 fChangeCounts_.PerformedChange ();
146 if (nextI != nullptr) {
147 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, nextStdI)};
148 }
149 }
150 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
151 {
153 auto i = fData_.find (key);
154 if (i != fData_.end ()) {
155 fData_.erase (i);
156 return true;
157 }
158 return false;
159 }
160
161 private:
162 static_assert (same_as<value_type, remove_cvref_t<value_type>>);
163 using DataStructureImplType_ = HASHTABLE<HASH_TABLE_TRAITS>;
164 struct IterTraits_ : Private::IteratorImplHelper_DefaultTraits<value_type, DataStructureImplType_> {
165 static_assert (same_as<typename DataStructureImplType_::value_type, Common::KeyValuePair<value_type, void>>);
166 static constexpr value_type ConvertDataStructureIterationResult2ContainerIteratorResult (const typename DataStructureImplType_::value_type& t)
167 {
168 return t.fKey;
169 }
170 };
171 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_, IterTraits_>;
172
173 private:
174 DataStructureImplType_ fData_;
175 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
176
177 private:
178 friend inherited; // for HashTableBasedContainerRepImpl
179 };
180
181 /*
182 ********************************************************************************
183 ************ KeyedCollection_HashTable<KEY_TYPE,MAPPED_VALUE_TYPE> *************
184 ********************************************************************************
185 */
186 template <typename T, typename KEY_TYPE, typename TRAITS>
193 template <typename T, typename KEY_TYPE, typename TRAITS>
194 template <KeyedCollection_HashTable_Support::IValidHashTableTraits<T, KEY_TYPE> HASH_TABLE_TRAITS>
195 KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::KeyedCollection_HashTable (const KeyExtractorType& keyExtractor, HASHTABLE<HASH_TABLE_TRAITS>&& src)
196 : inherited{Memory::MakeSharedPtr<Rep_<HASH_TABLE_TRAITS>> (keyExtractor, move (src))}
197 {
198 }
199 template <typename T, typename KEY_TYPE, typename TRAITS>
200 template <KeyedCollection_HashTable_Support::IValidHashTableTraits<T, KEY_TYPE> HASH_TABLE_TRAITS>
202#if !qCompilerAndStdLib_template_ConstraintDiffersInTemplateRedeclaration_Buggy
203 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
204#endif
205 : KeyedCollection_HashTable{KeyExtractorType{}, move (src)}
206 {
207 }
208 template <typename T, typename KEY_TYPE, typename TRAITS>
209 template <Cryptography::Digest::IHashFunction<KEY_TYPE> KEY_HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
210 KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::KeyedCollection_HashTable (const KeyExtractorType& keyExtractor, KEY_HASH&& keyHasher,
211 KEY_EQUALS_COMPARER&& keyComparer)
212 : KeyedCollection_HashTable{keyExtractor, DataStructures::HashTable<T, void, DefaultTraits<KEY_HASH, KEY_EQUALS_COMPARER>>{
213 ElementHash<KEY_HASH>{keyExtractor, keyHasher},
214 ElementEqualsComparer<KEY_EQUALS_COMPARER>{keyExtractor, keyComparer}}}
215 {
216 }
217 template <typename T, typename KEY_TYPE, typename TRAITS>
218 inline void KeyedCollection_HashTable<T, KEY_TYPE, TRAITS>::AssertRepValidType_ () const
219 {
221 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
222 }
223 }
224
225}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
#define RequireNotNull(p)
Definition Assertions.h:347
KeyedCollection_HashTable<T,KEY_TYPE> is a HashTable based concrete implementation of the KeyedCollec...
implement hash table support in a lightweight standard template library style. Use traits to describe...
Definition HashTable.h:132
shared_lock< const AssertExternallySynchronizedMutex > ReadContext
Instantiate AssertExternallySynchronizedMutex::ReadContext to designate an area of code where protect...
unique_lock< AssertExternallySynchronizedMutex > WriteContext
Instantiate AssertExternallySynchronizedMutex::WriteContext to designate an area of code where protec...
check argument FUNCTION is callable with a HASHABLE_T, and produces (something convertible to) size_t
Definition HashBase.h:28
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...