Stroika Library 3.0d24
 
Loading...
Searching...
No Matches
MultiSet_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. All rights reserved
3 */
4#include "Stroika/Foundation/Containers//Private/IteratorImplHelper.h"
5#include "Stroika/Foundation/Containers/DataStructures/Array.h"
9
11
12 /*
13 ********************************************************************************
14 ************************** MultiSet_Array<T, TRAITS>::Rep_ *********************
15 ********************************************************************************
16 */
17 template <typename T, typename TRAITS>
18 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IEqualsComparer<T>) EQUALS_COMPARER>
19 class MultiSet_Array<T, TRAITS>::Rep_ : public Private::ArrayBasedContainerRepImpl<Rep_<EQUALS_COMPARER>, IImplRepBase_>,
20 public Memory::UseBlockAllocationIfAppropriate<Rep_<EQUALS_COMPARER>> {
21 private:
22 using inherited = Private::ArrayBasedContainerRepImpl<Rep_<EQUALS_COMPARER>, IImplRepBase_>;
23
24 public:
25 static_assert (not is_reference_v<EQUALS_COMPARER>);
26
27 public:
28 Rep_ (const EQUALS_COMPARER& equalsComparer)
29 : fEqualsComparer_{equalsComparer}
30 {
31 }
32 Rep_ (const Rep_& from) = default;
33
34 public:
35 nonvirtual Rep_& operator= (const Rep_&) = delete;
36
37 private:
38 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS const EQUALS_COMPARER fEqualsComparer_;
39
40 // Iterable<typename TRAITS::CountedValueType>::_IRep overrides
41 public:
42 virtual shared_ptr<typename Iterable<typename TRAITS::CountedValueType>::_IRep> Clone () const override
43 {
45 return Memory::MakeSharedPtr<Rep_> (*this);
46 }
47 virtual size_t size () const override
48 {
50 return fData_.size ();
51 }
52 virtual bool empty () const override
53 {
55 return fData_.empty ();
56 }
57 virtual Iterator<value_type> MakeIterator () const override
58 {
60 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
61 }
62 // MakeIterator () walks fData_ from 0, so storage order IS iteration order. NB the span is of
63 // value_type - ie CountedValue<T>, the {value,count} pairs - not of bare T.
64 virtual optional<span<const value_type>> PeekContiguousStorage () const override
65 {
67 return span<const value_type>{fData_.data (), fData_.size ()};
68 }
69 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
70 {
72 fData_.Apply (doToElement, seq);
73 }
74 virtual Iterator<value_type> Find ([[maybe_unused]] bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
75 [[maybe_unused]] Execution::SequencePolicy seq) const override
76 {
78 if (auto i = fData_.Find (that)) {
79 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
80 }
81 return nullptr;
82 }
83
84 // MultiSet<T, TRAITS>::_IRep overrides
85 public:
86 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
87 {
89 return fEqualsComparer_;
90 }
91 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneEmpty () const override
92 {
94 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_); // keep same comparer, but no data
95 }
96 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
97 {
100 auto result = Memory::MakeSharedPtr<Rep_> (*this);
101 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
102 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
103 i->Refresh (); // reflect updated rep
104 return result;
105 }
106 virtual bool Equals (const typename MultiSet<T, TRAITS>::_IRep& rhs) const override
107 {
109 return this->_Equals_Reference_Implementation (rhs);
110 }
111 virtual bool Contains (ArgByValueType<T> item) const override
112 {
114 value_type tmp{item};
115 return Find_ (tmp) != kNotFound_;
116 }
117 virtual void Add (ArgByValueType<T> item, CounterType count) override
118 {
120 value_type tmp{item, count};
121 size_t index = Find_ (tmp);
122 if (index == kNotFound_) {
123 fData_.push_back (tmp);
124 }
125 else {
126 tmp.fCount += count;
127 fData_.SetAt (index, tmp);
128 }
129 fChangeCounts_.PerformedChange ();
130 }
131 virtual size_t RemoveIf (ArgByValueType<T> item, CounterType count) override
132 {
133 Require (count > 0);
135 value_type tmp{item};
136 size_t index = Find_ (tmp);
137 if (index != kNotFound_) {
138 Assert (index < fData_.size ());
140 if (tmp.fCount > count) {
141 tmp.fCount -= count;
142 Assert (tmp.fCount > 0);
143 fData_.SetAt (index, tmp);
144 result = count;
145 }
146 else {
147 fData_.Remove (index);
148 result = tmp.fCount;
149 }
150 fChangeCounts_.PerformedChange ();
151 return result;
152 }
153 return 0;
154 }
155 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
156 {
158 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
159 if (nextI == nullptr) {
160 fData_.Remove (mir.fIterator);
161 fChangeCounts_.PerformedChange ();
162 }
163 else {
164 auto retI = fData_.erase (mir.fIterator);
165 fChangeCounts_.PerformedChange ();
166 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
167 }
168 }
169 virtual void UpdateCount (const Iterator<value_type>& i, CounterType newCount, Iterator<value_type>* nextI) override
170 {
172 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
173 if (newCount == 0) {
174 if (nextI != nullptr) {
175 *nextI = i;
176 ++(*nextI);
177 }
178 fData_.Remove (mir.fIterator);
179 }
180 else {
181 value_type c = *mir.fIterator;
182 c.fCount = newCount;
183 fData_.SetAt (mir.fIterator, c);
184 if (nextI != nullptr) {
185 *nextI = i;
186 }
187 }
188 fChangeCounts_.PerformedChange ();
189 if (nextI != nullptr) {
190 Debug::UncheckedDynamicCast<IteratorRep_&> (nextI->GetRep ()).UpdateChangeCount ();
191 nextI->Refresh (); // update to reflect changes made to rep
192 }
193 }
194 virtual CounterType OccurrencesOf (ArgByValueType<T> item) const override
195 {
197 value_type tmp{item};
198 size_t index = Find_ (tmp);
199 if (index == kNotFound_) {
200 return 0;
201 }
202 Assert (index >= 0);
203 Assert (index < fData_.size ());
204 return fData_[index].fCount;
205 }
206
207 private:
208 using DataStructureImplType_ = DataStructures::Array<value_type>;
209 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
210
211 private:
212 DataStructureImplType_ fData_;
213 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
214
215 private:
216 static constexpr size_t kNotFound_ = (size_t)-1;
217
218 private:
219 nonvirtual size_t Find_ (value_type& item) const
220 {
221 // this code assumes locking done by callers
222 size_t length = fData_.size ();
223 for (size_t i = 0; i < length; ++i) {
224 if (fEqualsComparer_ (fData_.GetAt (i).fValue, item.fValue)) {
225 item = fData_.GetAt (i);
226 return i;
227 }
228 }
229 return kNotFound_;
230 }
231
232 private:
233 friend inherited;
234 };
235
236 /*
237 ********************************************************************************
238 ***************************** MultiSet_Array<T, TRAITS> ************************
239 ********************************************************************************
240 */
241 template <typename T, typename TRAITS>
243 : MultiSet_Array{equal_to<T>{}}
244 {
245 AssertRepValidType_ ();
246 }
247 template <typename T, typename TRAITS>
248 template <IEqualsComparer<T> EQUALS_COMPARER>
249 inline MultiSet_Array<T, TRAITS>::MultiSet_Array (EQUALS_COMPARER&& equalsComparer)
250 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<EQUALS_COMPARER>>> (forward<EQUALS_COMPARER> (equalsComparer))}
251 {
252 AssertRepValidType_ ();
253 }
254#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
255 template <typename T, typename TRAITS>
256 template <IIterableOfTo<typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
257 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, MultiSet_Array<T, TRAITS>>)
258 inline MultiSet_Array<T, TRAITS>::MultiSet_Array (ITERABLE_OF_ADDABLE&& src)
259 : MultiSet_Array{}
260 {
261 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
262 this->reserve (src.size ());
263 }
264 AddAll (forward<ITERABLE_OF_ADDABLE> (src));
265 AssertRepValidType_ ();
266 }
267#endif
268 template <typename T, typename TRAITS>
269 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
270 inline MultiSet_Array<T, TRAITS>::MultiSet_Array (EQUALS_COMPARER&& equalsComparer, ITERABLE_OF_ADDABLE&& src)
271 : MultiSet_Array{forward<EQUALS_COMPARER> (equalsComparer)}
272 {
273 this->reserve (src.size ());
274 AddAll (forward<ITERABLE_OF_ADDABLE> (src));
275 AssertRepValidType_ ();
276 }
277 template <typename T, typename TRAITS>
278 MultiSet_Array<T, TRAITS>::MultiSet_Array (const initializer_list<T>& src)
279 : MultiSet_Array{}
280 {
281 this->reserve (src.size ());
282 AddAll (src);
283 AssertRepValidType_ ();
284 }
285 template <typename T, typename TRAITS>
286 template <IEqualsComparer<T> EQUALS_COMPARER>
287 MultiSet_Array<T, TRAITS>::MultiSet_Array (EQUALS_COMPARER&& equalsComparer, const initializer_list<T>& src)
288 : MultiSet_Array{forward<EQUALS_COMPARER> (equalsComparer)}
289 {
290 this->reserve (src.size ());
291 AddAll (src);
292 AssertRepValidType_ ();
293 }
294 template <typename T, typename TRAITS>
295 MultiSet_Array<T, TRAITS>::MultiSet_Array (const initializer_list<value_type>& src)
296 : MultiSet_Array{}
297 {
298 this->reserve (src.size ());
299 AddAll (src);
300 AssertRepValidType_ ();
301 }
302 template <typename T, typename TRAITS>
303 template <IEqualsComparer<T> EQUALS_COMPARER>
304 MultiSet_Array<T, TRAITS>::MultiSet_Array (EQUALS_COMPARER&& equalsComparer, const initializer_list<value_type>& src)
305 : MultiSet_Array{forward<EQUALS_COMPARER> (equalsComparer)}
306 {
307 this->reserve (src.size ());
308 this->AddAll (src);
309 AssertRepValidType_ ();
310 }
311 template <typename T, typename TRAITS>
312 template <IInputIterator<typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
313 MultiSet_Array<T, TRAITS>::MultiSet_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
314 : MultiSet_Array{}
315 {
316 if constexpr (Common::has_minus_v<ITERATOR_OF_ADDABLE>) {
317 if (start != end) {
318 this->reserve (end - start);
319 }
320 }
321 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
322 AssertRepValidType_ ();
323 }
324 template <typename T, typename TRAITS>
325 template <IEqualsComparer<T> EQUALS_COMPARER, IInputIterator<typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
326 MultiSet_Array<T, TRAITS>::MultiSet_Array (EQUALS_COMPARER&& equalsComparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
327 : MultiSet_Array{forward<EQUALS_COMPARER> (equalsComparer)}
328 {
329 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
330 if (start != end) {
331 this->reserve (end - start);
332 }
333 }
334 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
335 AssertRepValidType_ ();
336 }
337 template <typename T, typename TRAITS>
338 inline void MultiSet_Array<T, TRAITS>::AssertRepValidType_ () const
339 {
341 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
342 }
343 }
344
345}
#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
bool Equals(const T *lhs, const T *rhs)
strcmp or wsccmp() as appropriate == 0
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS - used for the attribute [[no_unique_address]]
Definition StdCompat.h:433
#define qStroika_ATTRIBUTE_INDETERMINATE
qStroika_ATTRIBUTE_INDETERMINATE is used where you would use a C++ attribute for a variable that is i...
Definition StdCompat.h:393
#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
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...
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...