Stroika Library 3.0d24
 
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:
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:
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 // MakeIterator () walks fData_ from 0, so storage order IS iteration order. NB the span is of
57 // value_type - ie the KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>s - not of keys or of values.
58 virtual optional<span<const value_type>> PeekContiguousStorage () const override
59 {
61 return span<const value_type>{fData_.data (), fData_.size ()};
62 }
63 virtual size_t size () const override
64 {
66 return fData_.size ();
67 }
68 virtual bool empty () const override
69 {
71 return fData_.empty ();
72 }
73 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
74 {
76 fData_.Apply (doToElement, seq);
77 }
78 virtual Iterator<value_type> Find ([[maybe_unused]] bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
80 {
82 if (auto i = fData_.Find (that)) {
83 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
84 }
85 return nullptr;
86 }
87
88 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
89 public:
90 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
91 {
93 return fKeyEqualsComparer_;
94 }
96 {
98 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_); // keep comparer, but lose data
99 }
101 {
102 RequireNotNull (i);
104 auto result = Memory::MakeSharedPtr<Rep_> (*this);
105 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
106 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
107 i->Refresh (); // reflect updated rep
108 return result;
109 }
111 {
113 vector<mapped_type> result;
114 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.AtEnd (); ++it) {
115 if (fKeyEqualsComparer_ (it->fKey, key)) {
116 result.push_back (it->fValue);
117 }
118 }
119 return Iterable<mapped_type>{move (result)};
120 }
122 {
124 fData_.push_back (value_type{key, newElt});
125 fChangeCounts_.PerformedChange ();
126 }
127 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
128 {
130 for (typename DataStructureImplType_::ForwardIterator it (&fData_); not it.AtEnd (); ++it) {
131 if (fKeyEqualsComparer_ (it->fKey, key)) {
132 fData_.Remove (it);
133 fChangeCounts_.PerformedChange ();
134 return true;
135 }
136 }
137 return false;
138 }
139 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
140 {
142 auto& iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
143 if (nextI == nullptr) {
144 fData_.Remove (iterRep.fIterator);
145 fChangeCounts_.PerformedChange ();
146 }
147 else {
148 auto retI = fData_.erase (iterRep.fIterator);
149 fChangeCounts_.PerformedChange ();
151 }
152 }
154 {
156 const IteratorRep_& iterRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
158 if (nextI != nullptr) {
159 savedUnderlyingIndex = iterRep.fIterator.GetUnderlyingIteratorRep ();
160 }
161 fData_.PeekAt (iterRep.fIterator.CurrentIndex ())->fValue = newValue;
162 fChangeCounts_.PerformedChange ();
163 if (nextI != nullptr) {
165 }
166 }
167
168 private:
169 using DataStructureImplType_ = DataStructures::Array<value_type>;
170 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
171
172 private:
173 DataStructureImplType_ fData_;
174 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
175
176 private:
177 friend inherited; // for ArrayBasedContainerRepImpl
178 };
179
180 /*
181 ********************************************************************************
182 ************* Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE> *******************
183 ********************************************************************************
184 */
185 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
187 : Association_Array{equal_to<KEY_TYPE>{}}
188 {
189 AssertRepValidType_ ();
190 }
191 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
192 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
193 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
194 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
195 {
196 AssertRepValidType_ ();
197 }
198 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
199 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
200 : Association_Array{}
201 {
202 this->reserve (src.size ());
203 this->AddAll (src);
204 AssertRepValidType_ ();
205 }
206 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
207 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
208 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer,
209 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
210 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
211 {
212 this->reserve (src.size ());
213 this->AddAll (src);
214 AssertRepValidType_ ();
215 }
216#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
217 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
218 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
219 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
221 : Association_Array{}
222 {
223 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
224 this->reserve (src.size ());
225 }
226 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
227 AssertRepValidType_ ();
228 }
229#endif
230 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
231 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
232 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
233 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
234 {
235 reserve (src.size ());
237 AssertRepValidType_ ();
238 }
239 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
240 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
241 Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
242 : Association_Array{}
243 {
245 if (start != end) {
246 this->reserve (end - start);
247 }
248 }
250 AssertRepValidType_ ();
251 }
252 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
253 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
254 Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERATOR_OF_ADDABLE&& start,
255 ITERATOR_OF_ADDABLE&& end)
256 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
257 {
259 if (start != end) {
260 this->reserve (end - start);
261 }
262 }
264 AssertRepValidType_ ();
265 }
266 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
267 inline void Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
268 {
270 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
271 }
272 }
273
274}
#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:443
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY same as qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
Definition StdCompat.h:452
nonvirtual CONTAINER_OF_Key_T As() const
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...
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...
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that) const
Run the argument bool-returning function (or lambda) on the elements of the container,...
nonvirtual size_t size() const
Returns the number of items contained.
Definition Iterable.inl:311
nonvirtual void Apply(const function< void(ArgByValueType< T > item)> &doToElement) const
Run the argument function (or lambda) on each element of the container.
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:317
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:305
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...