Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
SortedMultiSet_SkipList.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8
10
11 /**
12 */
13 template <typename T, typename TRAITS>
14 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IThreeWayComparer<T>) COMPARER>
15 class SortedMultiSet_SkipList<T, TRAITS>::Rep_ : public Private::SkipListBasedContainerRepImpl<Rep_<COMPARER>, IImplRepBase_>,
16 public Memory::UseBlockAllocationIfAppropriate<Rep_<COMPARER>> {
17 private:
18 using inherited = Private::SkipListBasedContainerRepImpl<Rep_<COMPARER>, IImplRepBase_>;
19
20 public:
21 static_assert (not is_reference_v<COMPARER>);
22
23 public:
24 Rep_ (const COMPARER& comparer)
25 : fData_{comparer}
26 {
27 }
28 Rep_ (const Rep_& from) = default;
29
30 public:
31 nonvirtual Rep_& operator= (const Rep_&) = delete;
32
33 // Iterable<typename TRAITS::CountedValueType>::_IRep overrides
34 public:
35 virtual shared_ptr<typename Iterable<typename TRAITS::CountedValueType>::_IRep> Clone () const override
36 {
38 return Memory::MakeSharedPtr<Rep_> (*this);
39 }
40 virtual size_t size () const override
41 {
43 return fData_.size ();
44 }
45 virtual bool empty () const override
46 {
48 return fData_.empty ();
49 }
50 virtual Iterator<value_type> MakeIterator () const override
51 {
53 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
54 }
55 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
56 {
58 return this->inherited::Find (that, seq); // @todo rewrite to use fData
59 }
60
61 // MultiSet<T, TRAITS>::_IRep overrides
62 public:
63 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
64 {
66 return Common::EqualsComparerAdapter<T, COMPARER>{fData_.key_comp ()};
67 }
68 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneEmpty () const override
69 {
71 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data
72 }
73 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
74 {
77 auto result = Memory::MakeSharedPtr<Rep_> (*this);
78 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
79 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
80 i->Refresh (); // reflect updated rep
81 return result;
82 }
83 virtual bool Equals (const typename MultiSet<T, TRAITS>::_IRep& rhs) const override
84 {
86 return this->_Equals_Reference_Implementation (rhs);
87 }
88 virtual bool Contains (ArgByValueType<T> item) const override
89 {
90 value_type tmp{item};
92 return fData_.Find (item) != fData_.end ();
93 }
94 virtual void Add (ArgByValueType<T> item, CounterType count) override
95 {
96 if (count == 0) [[unlikely]] {
97 return;
98 }
100 auto i = fData_.Find (item);
101 if (i == fData_.end ()) {
102 fData_.Add ({item, count});
103 }
104 else {
105 i.UpdateValue (i->fValue + count);
106 }
107 fChangeCounts_.PerformedChange ();
108 }
109 virtual size_t RemoveIf (ArgByValueType<T> item, CounterType count) override
110 {
111 Require (count != 0);
113 auto i = fData_.Find (item);
114 Require (i != fData_.end ());
115 if (i != fData_.end ()) {
116 size_t result; // intentionally uninitialized
117 if (i->fValue > count) {
118 i.UpdateValue (i->fValue - count);
119 result = count;
120 }
121 else {
122 result = i->fValue;
123 fData_.erase (i);
124 }
125 fChangeCounts_.PerformedChange ();
126 return result;
127 }
128 return 0;
129 }
130 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
131 {
132 Require (not i.Done ());
134 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
135 mir.fIterator.AssertDataMatches (&fData_);
136 auto nextIRes = fData_.erase (mir.fIterator);
137 fChangeCounts_.PerformedChange ();
138 if (nextI != nullptr) {
139 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, nextIRes)};
140 }
141 }
142 virtual void UpdateCount (const Iterator<value_type>& i, CounterType newCount, Iterator<value_type>* nextI) override
143 {
145 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
146 if (newCount == 0) {
147 if (nextI == nullptr) {
148 fData_.Remove (mir.fIterator);
149 }
150 else {
151 auto nextIRes = fData_.erase (mir.fIterator);
152 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, nextIRes)};
153 }
154 }
155 else {
156 fData_.Update (mir.fIterator, newCount);
157 if (nextI != nullptr) {
158 *nextI = i; // update doesn't affect iterators
159 }
160 }
161 fChangeCounts_.PerformedChange ();
162 if (nextI != nullptr) {
163 Debug::UncheckedDynamicCast<IteratorRep_&> (nextI->GetRep ()).UpdateChangeCount ();
164 nextI->Refresh (); // update to reflect changes made to rep
165 }
166 }
167 virtual CounterType OccurrencesOf (ArgByValueType<T> item) const override
168 {
170 auto i = fData_.Find (item);
171 if (i == fData_.end ()) {
172 return 0;
173 }
174 return i->fValue;
175 }
176
177 // SortedMultiSet<T,TRAITS>::_IRep overrides
178 public:
179 virtual ElementThreeWayComparerType GetElementThreeWayComparer () const override
180 {
182 return fData_.key_comp ();
183 }
184
185 private:
186 using DataStructureImplType_ = SKIPLIST<COMPARER>;
187 struct IteratorRep_ : Private::IteratorImplHelper_<value_type, DataStructureImplType_> {
188 using inherited = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
189 using inherited::inherited; // forward base class constructors
190 // override to map just the key part to 'T'
191 virtual void More (optional<value_type>* result, bool advance) override
192 {
193 RequireNotNull (result);
194 this->ValidateChangeCount ();
195 if (advance) [[likely]] {
196 Require (not this->fIterator.Done ());
197 ++this->fIterator;
198 }
199 if (this->fIterator.Done ()) [[unlikely]] {
200 *result = nullopt;
201 }
202 else {
203 *result = value_type{this->fIterator->fKey, this->fIterator->fValue};
204 }
205 }
206 virtual auto Clone () const -> unique_ptr<typename Iterator<value_type>::IRep> override
207 {
208 this->ValidateChangeCount ();
209 return make_unique<IteratorRep_> (*this);
210 }
211 };
212
213 private:
214 DataStructureImplType_ fData_;
215 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
216
217 private:
218 friend inherited;
219 };
220
221 /*
222 ********************************************************************************
223 ********************** SortedMultiSet_SkipList<T, TRAITS> **********************
224 ********************************************************************************
225 */
226 template <typename T, typename TRAITS>
227 inline SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList ()
228 : SortedMultiSet_SkipList{compare_three_way{}}
229 {
230 AssertRepValidType_ ();
231 }
232 template <typename T, typename TRAITS>
233 template <IThreeWayComparer<T> COMPARER>
234 inline SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (COMPARER&& comparer)
235 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<COMPARER>>> (forward<COMPARER> (comparer))}
236 {
237 AssertRepValidType_ ();
238 }
239 template <typename T, typename TRAITS>
240 SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (const initializer_list<T>& src)
241 : SortedMultiSet_SkipList{}
242 {
243 this->AddAll (src);
244 AssertRepValidType_ ();
245 }
246 template <typename T, typename TRAITS>
247 template <IThreeWayComparer<T> COMPARER>
248 SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (COMPARER&& comparer, const initializer_list<T>& src)
249 : SortedMultiSet_SkipList{forward<COMPARER> (comparer)}
250 {
251 this->AddAll (src);
252 AssertRepValidType_ ();
253 }
254 template <typename T, typename TRAITS>
255 SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (const initializer_list<value_type>& src)
256 : SortedMultiSet_SkipList{}
257 {
258 this->AddAll (src);
259 AssertRepValidType_ ();
260 }
261 template <typename T, typename TRAITS>
262 template <IThreeWayComparer<T> COMPARER>
263 SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (COMPARER&& comparer, const initializer_list<value_type>& src)
264 : SortedMultiSet_SkipList{forward<COMPARER> (comparer)}
265 {
266 this->AddAll (src);
267 AssertRepValidType_ ();
268 }
269#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
270 template <typename T, typename TRAITS>
271 template <IIterableOfTo<typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
272 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMultiSet_SkipList<T, TRAITS>>)
273 inline SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (ITERABLE_OF_ADDABLE&& src)
274 : SortedMultiSet_SkipList{}
275 {
276 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
277 AssertRepValidType_ ();
278 }
279#endif
280 template <typename T, typename TRAITS>
281 template <IThreeWayComparer<T> COMPARER, IIterableOfTo<typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
282 inline SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (COMPARER&& comparer, ITERABLE_OF_ADDABLE&& src)
283 : SortedMultiSet_SkipList{forward<COMPARER> (comparer)}
284 {
285 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
286 AssertRepValidType_ ();
287 }
288 template <typename T, typename TRAITS>
289 template <IInputIterator<typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
290 SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
291 : SortedMultiSet_SkipList{}
292 {
293 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
294 AssertRepValidType_ ();
295 }
296 template <typename T, typename TRAITS>
297 template <IThreeWayComparer<T> COMPARER, IInputIterator<typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
298 SortedMultiSet_SkipList<T, TRAITS>::SortedMultiSet_SkipList (COMPARER&& comparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
299 : SortedMultiSet_SkipList{forward<COMPARER> (comparer)}
300 {
301 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
302 AssertRepValidType_ ();
303 }
304 template <typename T, typename TRAITS>
305 inline void SortedMultiSet_SkipList<T, TRAITS>::AssertRepValidType_ () const
306 {
308 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
309 }
310 }
311
312}
#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
auto MakeSharedPtr(ARGS_TYPE &&... args) -> shared_ptr< T >
same as make_shared, but if type T has block allocation, then use block allocation for the 'shared pa...
bool Equals(const T *lhs, const T *rhs)
strcmp or wsccmp() as appropriate == 0
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...
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...