Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
Association_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
6
7#include "Stroika/Foundation/Containers/DataStructures/Array.h"
9#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
10
12
13 /*
14 ********************************************************************************
15 ************ Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ **************
16 ********************************************************************************
17 */
18 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
19 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IEqualsComparer<KEY_TYPE>) KEY_EQUALS_COMPARER>
20 class Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
21 : public Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>,
22 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_EQUALS_COMPARER>> {
23 private:
24 using inherited = Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>;
25
26 public:
27 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
28
29 public:
30 Rep_ (const KEY_EQUALS_COMPARER& keyEqualsComparer)
31 : fKeyEqualsComparer_{keyEqualsComparer}
32 {
33 }
34 Rep_ (const Rep_& from) = default;
35
36 public:
37 nonvirtual Rep_& operator= (const Rep_&) = delete;
38
39 private:
40 [[no_unique_address]] const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
41
42 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
43 public:
44 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_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 (doToElement, seq);
68 }
69 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
70 [[maybe_unused]] Execution::SequencePolicy seq) const override
71 {
73 if (auto i = fData_.Find (that)) {
74 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
75 }
76 return nullptr;
77 }
78
79 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
80 public:
81 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
82 {
84 return fKeyEqualsComparer_;
85 }
86 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
87 {
89 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_); // keep comparer, but lose data
90 }
91 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
92 {
95 auto result = Memory::MakeSharedPtr<Rep_> (*this);
96 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
97 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
98 i->Refresh (); // reflect updated rep
99 return result;
100 }
101 virtual Iterable<mapped_type> Lookup (ArgByValueType<KEY_TYPE> key) const override
102 {
104 vector<mapped_type> result;
105 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
106 if (fKeyEqualsComparer_ (it->fKey, key)) {
107 result.push_back (it->fValue);
108 }
109 }
110 return Iterable<mapped_type>{move (result)};
111 }
112 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt) override
113 {
115 fData_.push_back (value_type{key, newElt});
116 fChangeCounts_.PerformedChange ();
117 }
118 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
119 {
121 for (typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
122 if (fKeyEqualsComparer_ (it->fKey, key)) {
123 fData_.Remove (it);
124 fChangeCounts_.PerformedChange ();
125 return true;
126 }
127 }
128 return false;
129 }
130 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
131 {
133 auto& iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
134 if (nextI == nullptr) {
135 fData_.Remove (iterRep.fIterator);
136 fChangeCounts_.PerformedChange ();
137 }
138 else {
139 auto retI = fData_.erase (iterRep.fIterator);
140 fChangeCounts_.PerformedChange ();
141 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
142 }
143 }
144 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
145 {
147 const IteratorRep_& iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
148 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
149 if (nextI != nullptr) {
150 savedUnderlyingIndex = iterRep.fIterator.GetUnderlyingIteratorRep ();
151 }
152 fData_.PeekAt (iterRep.fIterator.CurrentIndex ())->fValue = newValue;
153 fChangeCounts_.PerformedChange ();
154 if (nextI != nullptr) {
155 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
156 }
157 }
158
159 private:
160 using DataStructureImplType_ = DataStructures::Array<value_type>;
161 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
162
163 private:
164 DataStructureImplType_ fData_;
165 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
166
167 private:
168 friend inherited; // for ArrayBasedContainerRepImpl
169 };
170
171 /*
172 ********************************************************************************
173 ************* Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE> *******************
174 ********************************************************************************
175 */
176 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
178 : Association_Array{equal_to<KEY_TYPE>{}}
179 {
180 AssertRepValidType_ ();
181 }
182 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
183 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
184 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
185 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
186 {
187 AssertRepValidType_ ();
188 }
189 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
190 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
191 : Association_Array{}
192 {
193 this->reserve (src.size ());
194 this->AddAll (src);
195 AssertRepValidType_ ();
196 }
197 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
198 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
199 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer,
200 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
201 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
202 {
203 this->reserve (src.size ());
204 this->AddAll (src);
205 AssertRepValidType_ ();
206 }
207#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
208 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
209 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
210 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
212 : Association_Array{}
213 {
214 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
215 this->reserve (src.size ());
216 }
217 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
218 AssertRepValidType_ ();
219 }
220#endif
221 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
222 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
223 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
224 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
225 {
226 reserve (src.size ());
227 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
228 AssertRepValidType_ ();
229 }
230 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
231 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
232 Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
233 : Association_Array{}
234 {
235 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
236 if (start != end) {
237 this->reserve (end - start);
238 }
239 }
240 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
241 AssertRepValidType_ ();
242 }
243 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
244 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
245 Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERATOR_OF_ADDABLE&& start,
246 ITERATOR_OF_ADDABLE&& end)
247 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
248 {
249 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
250 if (start != end) {
251 this->reserve (end - start);
252 }
253 }
254 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
255 AssertRepValidType_ ();
256 }
257 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
258 inline void Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
259 {
261 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
262 }
263 }
264
265}
#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
nonvirtual bool RemoveIf(ArgByValueType< key_type > key)
Remove the given item, if it exists. Return true if found and removed.
nonvirtual void Remove(ArgByValueType< key_type > key)
Remove the given item (which must exist).
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< mapped_type > newValue, Iterator< value_type > *nextI=nullptr)
nonvirtual void Add(ArgByValueType< key_type > key, ArgByValueType< mapped_type > newElt)
nonvirtual void AddAll(ITERABLE_OF_ADDABLE &&items)
nonvirtual Traversal::Iterable< mapped_type > Lookup(ArgByValueType< key_type > key) const
Return an Iterable<mapped_type> of all the associated items (can be empty if none)....
Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an Array-based concrete implementation of t...
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...
nonvirtual void Apply(const function< void(ArgByValueType< T > item)> &doToElement, Execution::SequencePolicy seq=Execution::SequencePolicy::eDEFAULT) const
Run the argument function (or lambda) on each element of the container.
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that, Execution::SequencePolicy seq=Execution::SequencePolicy::eDEFAULT) const
Run the argument bool-returning function (or lambda) on each element of the container,...
nonvirtual size_t size() const
Returns the number of items contained.
Definition Iterable.inl:302
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:308
static constexpr default_sentinel_t end() noexcept
Support for ranged for, and STL syntax in general.
nonvirtual Iterator< T > MakeIterator() const
Create an iterator object which can be used to traverse the 'Iterable'.
Definition Iterable.inl:296
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...