Stroika Library 3.0d20
 
Loading...
Searching...
No Matches
Mapping_HashTable.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8
10
11 /*
12 ********************************************************************************
13 *********** Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ ***************
14 ********************************************************************************
15 */
16 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (DataStructures::HashTable_Support::IValidTraits<KEY_TYPE, MAPPED_VALUE_TYPE>) HASH_TABLE_TRAITS>
18#if !qCompilerAndStdLib_template_ConstraintDiffersInTemplateRedeclaration_Buggy
19 requires (HASH_TABLE_TRAITS::kAddOrExtendOrReplace == AddOrExtendOrReplaceMode::eAddReplaces)
20#endif
21 class Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
22 : public Private::HashTableBasedContainerRepImpl<Rep_<HASH_TABLE_TRAITS>, IImplRepBase_>,
23 public Memory::UseBlockAllocationIfAppropriate<Rep_<HASH_TABLE_TRAITS>> {
24 private:
25 using inherited = Private::HashTableBasedContainerRepImpl<Rep_<HASH_TABLE_TRAITS>, IImplRepBase_>;
26
27 public:
28 Rep_ (const typename HASH_TABLE_TRAITS::KeyHasherType& hashFun, const typename HASH_TABLE_TRAITS::KeyEqualsComparerType& equalsComparer)
29 : fData_{hashFun, equalsComparer}
30 {
31 }
32 Rep_ (HASHTABLE<HASH_TABLE_TRAITS>&& src)
33 : fData_{move (src)}
34 {
35 }
36 Rep_ (const Rep_& from) = default;
37
38 public:
39 nonvirtual Rep_& operator= (const Rep_&) = delete;
40
41 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
42 public:
43 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
44 {
46 return Memory::MakeSharedPtr<Rep_> (*this);
47 }
48 virtual Iterator<value_type> MakeIterator () const override
49 {
51 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
52 }
53 virtual size_t size () const override
54 {
56 fData_.Invariant ();
57 return fData_.size ();
58 }
59 virtual bool empty () const override
60 {
62 fData_.Invariant ();
63 return fData_.empty ();
64 }
65 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
66 {
68 fData_.Apply (doToElement);
69 }
70 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
71 [[maybe_unused]] Execution::SequencePolicy seq) const override
72 {
74 return this->inherited::Find (that, seq); // @todo rewrite to use fData
75 }
76
77 // Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
78 public:
79 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
80 {
82 return fData_.key_eq ();
83 }
84 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
85 {
87 // @todo UNCLEAR if this should also clone # buckets - but probably not
88 return Memory::MakeSharedPtr<Rep_> (fData_.hash_function (), fData_.key_eq ()); // keep hash/comparer, but lose data
89 }
90 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
91 {
94 auto result = Memory::MakeSharedPtr<Rep_> (*this);
95 result->fData_.MoveIteratorHereAfterClone (&Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ()).fIterator, &fData_);
96 i->Refresh (); // reflect updated rep
97 return result;
98 }
99 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item) const override
100 {
102 auto i = fData_.find (key);
103 if (i == fData_.end ()) {
104 if (item != nullptr) {
105 *item = nullopt;
106 }
107 return false;
108 }
109 else {
110 if (item != nullptr) {
111 *item = i->fValue;
112 }
113 return true;
114 }
115 }
116 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt, AddReplaceMode addReplaceMode) override
117 {
119 fData_.Invariant ();
120 bool result{};
121 // NOTE BOOL RESULT MEANDING DIFFERS BETWEEN MAPPING AND HASHTABLE!!!!
122 switch (addReplaceMode) {
124 // HashTable returns true iff change, but Mapping returns true if size enlarged
125 size_t oldSize = fData_.size ();
126 fData_.Add (key, newElt);
127 result = oldSize != fData_.size ();
128 } break;
130 auto i = fData_.find (key);
131 if (i == fData_.end ()) {
132 result = fData_.Add (key, newElt);
133 Assert (result);
134 }
135 } break;
136 default:
138 }
139 fChangeCounts_.PerformedChange ();
140 fData_.Invariant ();
141 return result;
142 }
143 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
144 {
146 fData_.Invariant ();
147 auto i = fData_.find (key);
148 if (i != fData_.end ()) {
149 fData_.Remove (i);
150 fChangeCounts_.PerformedChange ();
151 return true;
152 }
153 return false;
154 }
155 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
156 {
157 Require (not i.Done ());
159 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
160 mir.fIterator.AssertDataMatches (&fData_);
161 if (nextI == nullptr) {
162 fData_.Remove (mir.fIterator);
163 fChangeCounts_.PerformedChange ();
164 }
165 else {
166 typename DataStructureImplType_::ForwardIterator hNextI;
167 fData_.Remove (mir.fIterator, &hNextI);
168 fChangeCounts_.PerformedChange ();
169 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, hNextI.GetUnderlyingIteratorRep ())};
170 }
171 }
172 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
173 {
175 auto iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
176 fData_.Update (iterRep.fIterator, newValue); // doesn't invalidate iterator
177 fChangeCounts_.PerformedChange ();
178 if (nextI != nullptr) {
179 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iterRep.fIterator.GetUnderlyingIteratorRep ())};
180 }
181 }
182
183 private:
184 using DataStructureImplType_ = HASHTABLE<HASH_TABLE_TRAITS>;
185 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
186
187 private:
188 DataStructureImplType_ fData_;
189 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
190
191 private:
192 friend inherited; // for HashTableBasedContainerRepImpl
193 };
194
195 /*
196 ********************************************************************************
197 **************** Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE> ****************
198 ********************************************************************************
199 */
200 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
202 requires (Cryptography::Digest::IHashFunction<std::hash<KEY_TYPE>, KEY_TYPE> and IEqualsComparer<std::equal_to<KEY_TYPE>, KEY_TYPE>)
203 : Mapping_HashTable{std::hash<KEY_TYPE>{}, std::equal_to<KEY_TYPE>{}}
204 {
205 AssertRepValidType_ ();
206 }
207 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
208 template <DataStructures::HashTable_Support::IValidTraits<KEY_TYPE, MAPPED_VALUE_TYPE> HASH_TABLE_TRAITS>
209 requires (HASH_TABLE_TRAITS::kAddOrExtendOrReplace == AddOrExtendOrReplaceMode::eAddReplaces)
210 inline Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (HASHTABLE<HASH_TABLE_TRAITS>&& src)
211 : inherited{Memory::MakeSharedPtr<Rep_<HASH_TABLE_TRAITS>> (move (src))}
212 {
213#if qCompilerAndStdLib_requires_breaks_soemtimes_but_static_assert_ok_Buggy
214 static_assert (default_initializable<Mapping_HashTable>);
215#endif
216 AssertRepValidType_ ();
217 }
218 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
219 template <Cryptography::Digest::IHashFunction<KEY_TYPE> HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
220 inline Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (HASH&& hasher, KEY_EQUALS_COMPARER&& keyComparer)
221 : inherited{Memory::MakeSharedPtr<Rep_<DefaultTraits<remove_cvref_t<HASH>, remove_cvref_t<KEY_EQUALS_COMPARER>>>> (
222 forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer))}
223 {
224 AssertRepValidType_ ();
225 }
226 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
227 inline Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
228#if !qCompilerAndStdLib_requires_breaks_soemtimes_but_static_assert_ok_Buggy
229 requires (default_initializable<Mapping_HashTable>)
230#endif
231 : Mapping_HashTable{}
232 {
233#if qCompilerAndStdLib_requires_breaks_soemtimes_but_static_assert_ok_Buggy
234 static_assert (default_initializable<Mapping_HashTable>);
235#endif
236 this->AddAll (src);
237 AssertRepValidType_ ();
238 }
239 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
240 template <typename HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
241 requires (Cryptography::Digest::IHashFunction<HASH, KEY_TYPE>)
242 inline Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (HASH&& hasher, KEY_EQUALS_COMPARER&& keyComparer,
243 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
244 : Mapping_HashTable{forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer)}
245 {
246 this->AddAll (src);
247 AssertRepValidType_ ();
248 }
249#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
250 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
251 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
252 requires (
253#if qCompilerAndStdLib_default_initializable_broken_Buggy
254 is_default_constructible_v<Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>
255#else
256 default_initializable<Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>
257#endif
258 and not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>)
260 : Mapping_HashTable{}
261 {
262 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
263 AssertRepValidType_ ();
264 }
265#endif
266#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
267 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
268 template <typename HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
269 inline Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (HASH&& hasher, KEY_EQUALS_COMPARER&& keyComparer, ITERABLE_OF_ADDABLE&& src)
270 requires (Cryptography::Digest::IHashFunction<HASH, KEY_TYPE> and
271 not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>)
272 : Mapping_HashTable{forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer)}
273 {
274 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
275 AssertRepValidType_ ();
276 }
277#endif
278 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
279 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
280 Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
281#if !qCompilerAndStdLib_requires_breaks_soemtimes_but_static_assert_ok_Buggy
282 requires (default_initializable<Mapping_HashTable>)
283#endif
284 : Mapping_HashTable{}
285 {
286#if qCompilerAndStdLib_requires_breaks_soemtimes_but_static_assert_ok_Buggy
287 static_assert (default_initializable<Mapping_HashTable>);
288#endif
289 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
290 AssertRepValidType_ ();
291 }
292 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
293 template <typename HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
294 Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (HASH&& hasher, KEY_EQUALS_COMPARER&& keyComparer,
295 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
296 requires (Cryptography::Digest::IHashFunction<HASH, KEY_TYPE>)
297 : Mapping_HashTable{forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer)}
298 {
299 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
300 AssertRepValidType_ ();
301 }
302 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
303 inline void Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
304 {
306 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
307 }
308 }
309
310}
#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
#define AssertNotReached()
Definition Assertions.h:355
auto MakeSharedPtr(ARGS_TYPE &&... args) -> shared_ptr< T >
same as make_shared, but if type T has block allocation, then use block allocation for the 'shared pa...
conditional_t< qStroika_Foundation_Memory_PreferBlockAllocation and andTrueCheck, BlockAllocationUseHelper< T >, Common::Empty > UseBlockAllocationIfAppropriate
Use this to enable block allocation for a particular class. Beware of subclassing.
Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is a HashTable based concrete implementation o...
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
AddReplaceMode
Mode flag to say if Adding to a container replaces, or if the first addition wins.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...
STL namespace.