5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
16 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (DataStructures::HashTable_Support::IVal
idTraits<KEY_TYPE, MAPPED_VALUE_TYPE>) HASH_TABLE_TRAITS>
18#if !qCompilerAndStdLib_template_ConstraintDiffersInTemplateRedeclaration_Buggy
21 class Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
22 : public Private::HashTableBasedContainerRepImpl<Rep_<HASH_TABLE_TRAITS>, IImplRepBase_>,
25 using inherited = Private::HashTableBasedContainerRepImpl<Rep_<HASH_TABLE_TRAITS>, IImplRepBase_>;
28 Rep_ (
const typename HASH_TABLE_TRAITS::KeyHasherType& hashFun,
const typename HASH_TABLE_TRAITS::KeyEqualsComparerType& equalsComparer)
29 : fData_{hashFun, equalsComparer}
32 Rep_ (HASHTABLE<HASH_TABLE_TRAITS>&& src)
36 Rep_ (
const Rep_& from) =
default;
39 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
43 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone ()
const override
46 return Memory::MakeSharedPtr<Rep_> (*
this);
48 virtual Iterator<value_type> MakeIterator ()
const override
51 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
53 virtual size_t size ()
const override
57 return fData_.size ();
59 virtual bool empty ()
const override
63 return fData_.empty ();
65 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
68 fData_.Apply (doToElement);
70 virtual Iterator<value_type> Find (
bool findFirst,
const function<
bool (ArgByValueType<value_type> item)>& that,
74 return this->inherited::Find (findFirst, that, seq);
79 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
82 return fData_.key_eq ();
84 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
88 return Memory::MakeSharedPtr<Rep_> (fData_.hash_function (), fData_.key_eq ());
90 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
94 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
95 result->fData_.MoveIteratorHereAfterClone (&Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ()).fIterator, &fData_);
99 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item)
const override
102 auto i = fData_.find (key);
103 if (i == fData_.end ()) {
104 if (item !=
nullptr) {
110 if (item !=
nullptr) {
116 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt,
AddReplaceMode addReplaceMode)
override
122 switch (addReplaceMode) {
125 size_t oldSize = fData_.size ();
126 fData_.Add (key, newElt);
127 result = oldSize != fData_.size ();
130 auto i = fData_.find (key);
131 if (i == fData_.end ()) {
132 result = fData_.Add (key, newElt);
139 fChangeCounts_.PerformedChange ();
143 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
147 auto i = fData_.find (key);
148 if (i != fData_.end ()) {
150 fChangeCounts_.PerformedChange ();
155 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
157 Require (not i.AtEnd ());
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 ();
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 ())};
172 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
175 auto iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
176 fData_.Update (iterRep.fIterator, newValue);
177 fChangeCounts_.PerformedChange ();
178 if (nextI !=
nullptr) {
179 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iterRep.fIterator.GetUnderlyingIteratorRep ())};
184 using DataStructureImplType_ = HASHTABLE<HASH_TABLE_TRAITS>;
185 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
188 DataStructureImplType_ fData_;
200 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
205 AssertRepValidType_ ();
207 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
208 template <DataStructures::HashTable_Support::IVal
idTraits<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))}
213 AssertRepValidType_ ();
215 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
216 template <Cryptography::Digest::IHashFunction<KEY_TYPE> HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
217 inline Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_HashTable (HASH&& hasher, KEY_EQUALS_COMPARER&& keyComparer)
219 forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer))}
221 AssertRepValidType_ ();
223 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
225#if !qCompilerAndStdLib_requires_breaks_sometimes_but_static_assert_ok_Buggy
226 requires (default_initializable<Mapping_HashTable>)
228 : Mapping_HashTable{}
230#if qCompilerAndStdLib_requires_breaks_sometimes_but_static_assert_ok_Buggy
231 static_assert (default_initializable<Mapping_HashTable>);
234 AssertRepValidType_ ();
236 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
237 template <
typename HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
238 requires (Cryptography::Digest::IHashFunction<HASH, KEY_TYPE>)
240 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
241 : Mapping_HashTable{forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer)}
244 AssertRepValidType_ ();
246#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
247 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
248 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
250#if qCompilerAndStdLib_default_initializable_broken_Buggy
251 is_default_constructible_v<Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>
253 default_initializable<Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>
255 and not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>)
257 : Mapping_HashTable{}
259 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
260 AssertRepValidType_ ();
263#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
264 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
265 template <
typename HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
267 requires (Cryptography::Digest::IHashFunction<HASH, KEY_TYPE> and
268 not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>>)
269 : Mapping_HashTable{forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer)}
271 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
272 AssertRepValidType_ ();
275 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
276 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
278#if !qCompilerAndStdLib_requires_breaks_sometimes_but_static_assert_ok_Buggy
279 requires (default_initializable<Mapping_HashTable>)
281 : Mapping_HashTable{}
283#if qCompilerAndStdLib_requires_breaks_sometimes_but_static_assert_ok_Buggy
284 static_assert (default_initializable<Mapping_HashTable>);
286 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
287 AssertRepValidType_ ();
289 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
290 template <
typename HASH, IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
292 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
293 requires (Cryptography::Digest::IHashFunction<HASH, KEY_TYPE>)
294 : Mapping_HashTable{forward<HASH> (hasher), forward<KEY_EQUALS_COMPARER> (keyComparer)}
296 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
297 AssertRepValidType_ ();
299 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
300 inline void Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
303 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{
this};
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
#define RequireNotNull(p)
#define AssertNotReached()
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.
#define Stroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE
[[msvc::no_unique_address]] isn't always broken in MSVC. Annotate with this on things where its not b...
Mapping_HashTable<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is a HashTable based concrete implementation o...
unique_lock< AssertExternallySynchronizedChecker > WriteContext
Instantiate AssertExternallySynchronizedChecker::WriteContext to designate an area of code where prot...
shared_lock< const AssertExternallySynchronizedChecker > ReadContext
Instantiate AssertExternallySynchronizedChecker::ReadContext to designate an area of code where prote...
check argument FUNCTION is callable with a HASHABLE_T, and produces (something convertible to) size_t
ExplicitTraits< KEY, VALUE, InternallySynchronized::eNotKnownInternallySynchronized, equal_to< KEY >, nullptr_t, Statistics::StatsType_DEFAULT > DefaultTraits
Default choices for LRUCache, if you don't specify anything else.
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,...