Stroika Library 3.0d23
 
Loading...
Searching...
No Matches
Mapping_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. 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 // ./Builds/Release/Tests/Test17.exe
39 // [ RUN ] Foundation_Containers_Mapping.Mapping_Array
40 // unknown file: error: SEH exception with code 0xc0000005 thrown in the test body.
41 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
42
43 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
44 public:
45 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
46 {
48 return Memory::MakeSharedPtr<Rep_> (*this);
49 }
50 virtual Iterator<value_type> MakeIterator () const override
51 {
53 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
54 }
55 virtual size_t size () const override
56 {
58 return fData_.size ();
59 }
60 virtual bool empty () const override
61 {
63 return fData_.empty ();
64 }
65 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
66 {
68 fData_.Apply (doToElement, seq);
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 if (auto i = fData_.Find (that)) {
75 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
76 }
77 return nullptr;
78 }
79
80 // Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
81 public:
82 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
83 {
85 return fKeyEqualsComparer_;
86 }
87 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
88 {
90 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_); // keep comparer, but lose data
91 }
92 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
93 {
96 auto result = Memory::MakeSharedPtr<Rep_> (*this);
97 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
98 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
99 i->Refresh (); // reflect updated rep
100 return result;
101 }
102 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item) const override
103 {
105 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
106 if (fKeyEqualsComparer_ (it->fKey, key)) {
107 if (item != nullptr) {
108 *item = it->fValue;
109 }
110 return true;
111 }
112 }
113 if (item != nullptr) {
114 *item = nullopt;
115 }
116 return false;
117 }
118 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt, AddReplaceMode addReplaceMode) override
119 {
121 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
122 if (fKeyEqualsComparer_ (it->fKey, key)) {
123 switch (addReplaceMode) {
125 fData_[it.CurrentIndex ()].fValue = newElt;
126 fChangeCounts_.PerformedChange ();
127 break;
129 break;
130 default:
132 }
133 return false;
134 }
135 }
136 fData_.push_back (value_type{key, newElt});
137 fChangeCounts_.PerformedChange ();
138 return true;
139 }
140 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
141 {
143 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
144 if (fKeyEqualsComparer_ (it->fKey, key)) {
145 fData_.Remove (it);
146 fChangeCounts_.PerformedChange ();
147 return true;
148 }
149 }
150 return false;
151 }
152 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
153 {
155 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
156 if (nextI == nullptr) {
157 fData_.Remove (mir.fIterator);
158 fChangeCounts_.PerformedChange ();
159 }
160 else {
161 auto retI = fData_.erase (mir.fIterator);
162 fChangeCounts_.PerformedChange ();
163 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
164 }
165 }
166 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
167 {
169 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
170 if (nextI != nullptr) {
171 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
172 }
173 fData_.PeekAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ())->fValue = newValue;
174 fChangeCounts_.PerformedChange ();
175 if (nextI != nullptr) {
176 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
177 }
178 }
179
180 private:
181 using DataStructureImplType_ = DataStructures::Array<value_type>;
182 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
183
184 private:
185 DataStructureImplType_ fData_;
186 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
187
188 private:
189 friend inherited;
190 };
191
192 /*
193 ********************************************************************************
194 ***************** Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE> *******************
195 ********************************************************************************
196 */
197 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
199 : Mapping_Array{equal_to<KEY_TYPE>{}}
200 {
201 AssertRepValidType_ ();
202 }
203 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
204 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
205 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
206 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
207 {
208 AssertRepValidType_ ();
209 }
210 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
211 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
212 : Mapping_Array{}
213 {
214 this->reserve (src.size ());
215 this->AddAll (src);
216 AssertRepValidType_ ();
217 }
218 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
219 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
220 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer,
221 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
222 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
223 {
224 this->reserve (src.size ());
225 this->AddAll (src);
226 AssertRepValidType_ ();
227 }
228#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
229 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
230 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
231 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
232 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (ITERABLE_OF_ADDABLE&& src)
233 : Mapping_Array{}
234 {
235 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
236 this->reserve (src.size ());
237 }
238 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
239 AssertRepValidType_ ();
240 }
241#endif
242 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
243 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
244 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
245 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
246 {
247 this->reserve (src.size ());
248 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
249 AssertRepValidType_ ();
250 }
251 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
252 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
253 Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
254 : Mapping_Array{}
255 {
256 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
257 if (start != end) {
258 this->reserve (end - start);
259 }
260 }
261 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
262 AssertRepValidType_ ();
263 }
264 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
265 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
266 Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERATOR_OF_ADDABLE&& start,
267 ITERATOR_OF_ADDABLE&& end)
268 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
269 {
270 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
271 if (start != end) {
272 this->reserve (end - start);
273 }
274 }
275 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
276 AssertRepValidType_ ();
277 }
278 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
279 inline void Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
280 {
282 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
283 }
284 }
285
286}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:49
#define RequireNotNull(p)
Definition Assertions.h:348
#define AssertNotReached()
Definition Assertions.h:356
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE
[[msvc::no_unique_address]] isn't always broken in MSVC. Annotate with this on things where its not b...
Definition StdCompat.h:445
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY same as qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
Definition StdCompat.h:454
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:188
nonvirtual optional< mapped_type > Lookup(ArgByValueType< key_type > key) const
Definition Mapping.inl:142
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:235
nonvirtual void Remove(ArgByValueType< key_type > key)
Remove the given item (which must exist).
Definition Mapping.inl:223
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:303
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:309
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:297
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,...