Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
Mapping_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#include "Stroika/Foundation/Containers/DataStructures/Array.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
9
11
12 /*
13 ********************************************************************************
14 ************ Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ ******************
15 ********************************************************************************
16 */
17 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
18 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IEqualsComparer<KEY_TYPE>) KEY_EQUALS_COMPARER>
19 class Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ : public Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>,
20 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_EQUALS_COMPARER>> {
21 private:
22 using inherited = Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>;
23
24 public:
25 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
26
27 public:
28 Rep_ (const KEY_EQUALS_COMPARER& keyEqualsComparer)
29 : fKeyEqualsComparer_{keyEqualsComparer}
30 {
31 }
32 Rep_ (const Rep_& from) = default;
33
34 public:
35 nonvirtual Rep_& operator= (const Rep_&) = delete;
36
37 private:
38 [[no_unique_address]] const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
39
40 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
41 public:
42 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
43 {
45 return Memory::MakeSharedPtr<Rep_> (*this);
46 }
47 virtual Iterator<value_type> MakeIterator () const override
48 {
50 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
51 }
52 virtual size_t size () const override
53 {
55 return fData_.size ();
56 }
57 virtual bool empty () const override
58 {
60 return fData_.empty ();
61 }
62 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
63 {
65 fData_.Apply (doToElement, seq);
66 }
67 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
68 [[maybe_unused]] Execution::SequencePolicy seq) const override
69 {
71 if (auto i = fData_.Find (that)) {
72 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
73 }
74 return nullptr;
75 }
76
77 // Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
78 public:
79 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
80 {
82 return fKeyEqualsComparer_;
83 }
84 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
85 {
87 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_); // keep comparer, but lose data
88 }
89 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
90 {
93 auto result = Memory::MakeSharedPtr<Rep_> (*this);
94 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
95 result->fData_.MoveIteratorHereAfterClone (&mir.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 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
103 if (fKeyEqualsComparer_ (it->fKey, key)) {
104 if (item != nullptr) {
105 *item = it->fValue;
106 }
107 return true;
108 }
109 }
110 if (item != nullptr) {
111 *item = nullopt;
112 }
113 return false;
114 }
115 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt, AddReplaceMode addReplaceMode) override
116 {
118 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
119 if (fKeyEqualsComparer_ (it->fKey, key)) {
120 switch (addReplaceMode) {
122 fData_[it.CurrentIndex ()].fValue = newElt;
123 fChangeCounts_.PerformedChange ();
124 break;
126 break;
127 default:
129 }
130 return false;
131 }
132 }
133 fData_.push_back (value_type{key, newElt});
134 fChangeCounts_.PerformedChange ();
135 return true;
136 }
137 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
138 {
140 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
141 if (fKeyEqualsComparer_ (it->fKey, key)) {
142 fData_.RemoveAt (it.CurrentIndex ());
143 fChangeCounts_.PerformedChange ();
144 return true;
145 }
146 }
147 return false;
148 }
149 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
150 {
152 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
153 if (nextI == nullptr) {
154 fData_.Remove (mir.fIterator);
155 fChangeCounts_.PerformedChange ();
156 }
157 else {
158 auto retI = fData_.erase (mir.fIterator);
159 fChangeCounts_.PerformedChange ();
160 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
161 }
162 }
163 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
164 {
166 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
167 if (nextI != nullptr) {
168 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
169 }
170 fData_.PeekAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ())->fValue = newValue;
171 fChangeCounts_.PerformedChange ();
172 if (nextI != nullptr) {
173 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
174 }
175 }
176
177 private:
178 using DataStructureImplType_ = DataStructures::Array<value_type>;
179 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
180
181 private:
182 DataStructureImplType_ fData_;
183 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
184
185 private:
186 friend inherited;
187 };
188
189 /*
190 ********************************************************************************
191 ***************** Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE> *******************
192 ********************************************************************************
193 */
194 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
196 : Mapping_Array{equal_to<KEY_TYPE>{}}
197 {
198 AssertRepValidType_ ();
199 }
200 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
201 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
202 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
203 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
204 {
205 AssertRepValidType_ ();
206 }
207 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
208 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
209 : Mapping_Array{}
210 {
211 this->reserve (src.size ());
212 this->AddAll (src);
213 AssertRepValidType_ ();
214 }
215 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
216 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
217 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer,
218 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
219 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
220 {
221 this->reserve (src.size ());
222 this->AddAll (src);
223 AssertRepValidType_ ();
224 }
225#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
226 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
227 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
228 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
229 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (ITERABLE_OF_ADDABLE&& src)
230 : Mapping_Array{}
231 {
232 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
233 this->reserve (src.size ());
234 }
235 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
236 AssertRepValidType_ ();
237 }
238#endif
239 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
240 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
241 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
242 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
243 {
244 this->reserve (src.size ());
245 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
246 AssertRepValidType_ ();
247 }
248 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
249 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
250 Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
251 : Mapping_Array{}
252 {
253 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
254 if (start != end) {
255 this->reserve (end - start);
256 }
257 }
258 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
259 AssertRepValidType_ ();
260 }
261 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
262 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
263 Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERATOR_OF_ADDABLE&& start,
264 ITERATOR_OF_ADDABLE&& end)
265 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
266 {
267 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
268 if (start != end) {
269 this->reserve (end - start);
270 }
271 }
272 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
273 AssertRepValidType_ ();
274 }
275 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
276 inline void Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
277 {
279 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
280 }
281 }
282
283}
#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
Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an Array-based concrete implementation of the M...
nonvirtual bool Add(ArgByValueType< key_type > key, ArgByValueType< mapped_type > newElt, AddReplaceMode addReplaceMode=AddReplaceMode::eAddReplaces)
Definition Mapping.inl:190
nonvirtual optional< mapped_type > Lookup(ArgByValueType< key_type > key) const
Definition Mapping.inl:144
nonvirtual unsigned int AddAll(ITERABLE_OF_ADDABLE &&items, AddReplaceMode addReplaceMode=AddReplaceMode::eAddReplaces)
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< mapped_type > newValue, Iterator< value_type > *nextI=nullptr)
Definition Mapping.inl:312
nonvirtual bool RemoveIf(ArgByValueType< key_type > key)
Remove the given item, if it exists. Return true if found and removed.
Definition Mapping.inl:237
nonvirtual void Remove(ArgByValueType< key_type > key)
Remove the given item (which must exist).
Definition Mapping.inl:225
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:300
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:306
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:294
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,...