Stroika Library 3.0d23
 
Loading...
Searching...
No Matches
Association_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. 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 // [ RUN ] Foundation_Containers_Association.Association_Array
41 // unknown file: error: SEH exception with code 0xc0000005 thrown in the test body.
42 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
43
44 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
45 public:
46 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
47 {
49 return Memory::MakeSharedPtr<Rep_> (*this);
50 }
51 virtual Iterator<value_type> MakeIterator () const override
52 {
54 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
55 }
56 virtual size_t size () const override
57 {
59 return fData_.size ();
60 }
61 virtual bool empty () const override
62 {
64 return fData_.empty ();
65 }
66 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
67 {
69 fData_.Apply (doToElement, seq);
70 }
71 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
72 [[maybe_unused]] Execution::SequencePolicy seq) const override
73 {
75 if (auto i = fData_.Find (that)) {
76 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
77 }
78 return nullptr;
79 }
80
81 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
82 public:
83 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
84 {
86 return fKeyEqualsComparer_;
87 }
88 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
89 {
91 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_); // keep comparer, but lose data
92 }
93 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
94 {
97 auto result = Memory::MakeSharedPtr<Rep_> (*this);
98 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
99 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
100 i->Refresh (); // reflect updated rep
101 return result;
102 }
103 virtual Iterable<mapped_type> Lookup (ArgByValueType<KEY_TYPE> key) const override
104 {
106 vector<mapped_type> result;
107 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
108 if (fKeyEqualsComparer_ (it->fKey, key)) {
109 result.push_back (it->fValue);
110 }
111 }
112 return Iterable<mapped_type>{move (result)};
113 }
114 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt) override
115 {
117 fData_.push_back (value_type{key, newElt});
118 fChangeCounts_.PerformedChange ();
119 }
120 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
121 {
123 for (typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
124 if (fKeyEqualsComparer_ (it->fKey, key)) {
125 fData_.Remove (it);
126 fChangeCounts_.PerformedChange ();
127 return true;
128 }
129 }
130 return false;
131 }
132 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
133 {
135 auto& iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
136 if (nextI == nullptr) {
137 fData_.Remove (iterRep.fIterator);
138 fChangeCounts_.PerformedChange ();
139 }
140 else {
141 auto retI = fData_.erase (iterRep.fIterator);
142 fChangeCounts_.PerformedChange ();
143 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
144 }
145 }
146 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
147 {
149 const IteratorRep_& iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
150 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
151 if (nextI != nullptr) {
152 savedUnderlyingIndex = iterRep.fIterator.GetUnderlyingIteratorRep ();
153 }
154 fData_.PeekAt (iterRep.fIterator.CurrentIndex ())->fValue = newValue;
155 fChangeCounts_.PerformedChange ();
156 if (nextI != nullptr) {
157 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
158 }
159 }
160
161 private:
162 using DataStructureImplType_ = DataStructures::Array<value_type>;
163 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
164
165 private:
166 DataStructureImplType_ fData_;
167 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
168
169 private:
170 friend inherited; // for ArrayBasedContainerRepImpl
171 };
172
173 /*
174 ********************************************************************************
175 ************* Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE> *******************
176 ********************************************************************************
177 */
178 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
180 : Association_Array{equal_to<KEY_TYPE>{}}
181 {
182 AssertRepValidType_ ();
183 }
184 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
185 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
186 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
187 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
188 {
189 AssertRepValidType_ ();
190 }
191 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
192 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
193 : Association_Array{}
194 {
195 this->reserve (src.size ());
196 this->AddAll (src);
197 AssertRepValidType_ ();
198 }
199 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
200 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
201 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer,
202 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
203 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
204 {
205 this->reserve (src.size ());
206 this->AddAll (src);
207 AssertRepValidType_ ();
208 }
209#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
210 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
211 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
212 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
214 : Association_Array{}
215 {
216 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
217 this->reserve (src.size ());
218 }
219 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
220 AssertRepValidType_ ();
221 }
222#endif
223 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
224 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
225 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
226 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
227 {
228 reserve (src.size ());
229 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
230 AssertRepValidType_ ();
231 }
232 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
233 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
234 Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
235 : Association_Array{}
236 {
237 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
238 if (start != end) {
239 this->reserve (end - start);
240 }
241 }
242 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
243 AssertRepValidType_ ();
244 }
245 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
246 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
247 Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERATOR_OF_ADDABLE&& start,
248 ITERATOR_OF_ADDABLE&& end)
249 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
250 {
251 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
252 if (start != end) {
253 this->reserve (end - start);
254 }
255 }
256 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
257 AssertRepValidType_ ();
258 }
259 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
260 inline void Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
261 {
263 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
264 }
265 }
266
267}
#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 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
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: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
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...