Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
SortedMapping_SkipList.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
9
11
12 /*
13 ********************************************************************************
14 ******** SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ *************
15 ********************************************************************************
16 */
17 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
18 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IThreeWayComparer<KEY_TYPE>) KEY_THREEWAY_COMPARER>
19 class SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
20 : public Private::SkipListBasedContainerRepImpl<Rep_<KEY_THREEWAY_COMPARER>, IImplRepBase_>,
21 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_THREEWAY_COMPARER>> {
22 public:
23 static_assert (not is_reference_v<KEY_THREEWAY_COMPARER>);
24
25 private:
26 using inherited = Private::SkipListBasedContainerRepImpl<Rep_<KEY_THREEWAY_COMPARER>, IImplRepBase_>;
27
28 public:
29 Rep_ (const KEY_THREEWAY_COMPARER& inorderComparer)
30 : fData_{inorderComparer}
31 {
32 }
33 Rep_ (SKIPLIST<KEY_THREEWAY_COMPARER>&& src)
34 : fData_{move (src)}
35 {
36 }
37 Rep_ (const Rep_& from) = default;
38
39 public:
40 nonvirtual Rep_& operator= (const Rep_&) = delete;
41
42 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
43 public:
44 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
45 {
47 return Memory::MakeSharedPtr<Rep_> (*this);
48 }
49 virtual Iterator<value_type> MakeIterator () const override
50 {
52 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
53 }
54 virtual size_t size () const override
55 {
57 fData_.Invariant ();
58 return fData_.size ();
59 }
60 virtual bool empty () const override
61 {
63 fData_.Invariant ();
64 return fData_.empty ();
65 }
66 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
67 {
69 fData_.Apply (doToElement);
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 return this->inherited::Find (that, seq); // @todo rewrite to use fData
76 }
77
78 // Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
79 public:
80 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
81 {
83 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_THREEWAY_COMPARER>{fData_.key_comp ()};
84 }
85 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
86 {
88 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data
89 }
90 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
91 {
94 auto result = Memory::MakeSharedPtr<Rep_> (*this);
95 result->fData_.MoveIteratorHereAfterClone (&Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ()).fIterator, &fData_);
96 i->Refresh (); // reflect updated rep
97 return result;
98 }
99 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item) const override
100 {
102 auto i = fData_.Find (key);
103 if (i == fData_.end ()) {
104 if (item != nullptr) {
105 *item = nullopt;
106 }
107 return false;
108 }
109 else {
110 if (item != nullptr) {
111 *item = i->fValue;
112 }
113 return true;
114 }
115 }
116 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt, AddReplaceMode addReplaceMode) override
117 {
119 fData_.Invariant ();
120 bool result{};
121 [[maybe_unused]] auto&& cleanup = Execution::Finally ([this] () noexcept { fChangeCounts_.PerformedChange (); });
122 switch (addReplaceMode) {
124 static_assert (DataStructureImplType_::TraitsType::kAddOrExtendOrReplaceMode == AddOrExtendOrReplaceMode::eAddReplaces);
125 result = fData_.Add (key, newElt);
126 break;
128 // not ideally most efficient - maybe add AddIfMissing (variation) to SkipList API (if not compiled that way) - as I used to have
129 if (fData_.Find (key)) {
130 result = false;
131 }
132 else {
133 fData_.Add (key, newElt);
134 result = true;
135 }
136 } break;
137 default:
139 }
140 fData_.Invariant ();
141 return result;
142 }
143 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
144 {
146 fData_.Invariant ();
147 if (auto i = fData_.Find (key)) {
148 fData_.Remove (i);
149 fChangeCounts_.PerformedChange ();
150 return true;
151 }
152 return false;
153 }
154 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
155 {
156 Require (not i.Done ());
158 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
159 mir.fIterator.AssertDataMatches (&fData_);
160 if (nextI == nullptr) {
161 fData_.Remove (mir.fIterator);
162 fChangeCounts_.PerformedChange ();
163 }
164 else {
165 auto ret = fData_.erase (mir.fIterator);
166 fChangeCounts_.PerformedChange ();
167 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
168 }
169 }
170 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
171 {
173 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
174 if (nextI != nullptr) {
175 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
176 }
177 fData_.Update (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator, newValue);
178 fChangeCounts_.PerformedChange ();
179 if (nextI != nullptr) {
180 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
181 }
182 }
183
184 // SortedMapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
185 public:
186 virtual KeyThreeWayComparerType GetKeyThreeWayComparer () const override
187 {
189 return fData_.key_comp ();
190 }
191
192 private:
193 using DataStructureImplType_ = SKIPLIST<KEY_THREEWAY_COMPARER>;
194 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
195
196 private:
197 DataStructureImplType_ fData_;
198 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
199
200 private:
201 friend inherited;
202 };
203
204 /*
205 ********************************************************************************
206 ************ SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE> ***************
207 ********************************************************************************
208 */
209 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
211 requires (three_way_comparable<KEY_TYPE>)
212 : SortedMapping_SkipList{compare_three_way{}}
213 {
214 AssertRepValidType_ ();
215 }
216 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
217 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER>
218 inline SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_SkipList (SKIPLIST<KEY_THREEWAY_COMPARER>&& src)
219 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_THREEWAY_COMPARER>>> (move (src))}
220 {
221 AssertRepValidType_ ();
222 }
223 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
224 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER>
225 inline SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_SkipList (KEY_THREEWAY_COMPARER&& keyComparer)
226 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_THREEWAY_COMPARER>>> (keyComparer)}
227 {
228 AssertRepValidType_ ();
229 }
230 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
231 inline SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_SkipList (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
232 requires (three_way_comparable<KEY_TYPE>)
233 : SortedMapping_SkipList{}
234 {
235 this->AddAll (src);
236 AssertRepValidType_ ();
237 }
238 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
239 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER>
240 inline SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_SkipList (KEY_THREEWAY_COMPARER&& keyComparer,
241 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
242 : SortedMapping_SkipList{forward<KEY_THREEWAY_COMPARER> (keyComparer)}
243 {
244 this->AddAll (src);
245 AssertRepValidType_ ();
246 }
247#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
248 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
249 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
250 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>>)
252 requires (three_way_comparable<KEY_TYPE>)
253 : SortedMapping_SkipList{}
254 {
255 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
256 AssertRepValidType_ ();
257 }
258#endif
259 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
260 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
261 inline SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_SkipList (KEY_THREEWAY_COMPARER&& keyComparer, ITERABLE_OF_ADDABLE&& src)
262 : SortedMapping_SkipList{forward<KEY_THREEWAY_COMPARER> (keyComparer)}
263 {
264 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
265 AssertRepValidType_ ();
266 }
267 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
268 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
269 SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_SkipList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
270 requires (three_way_comparable<KEY_TYPE>)
271 : SortedMapping_SkipList{}
272 {
273 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
274 AssertRepValidType_ ();
275 }
276 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
277 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
279 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
280 : SortedMapping_SkipList{forward<KEY_THREEWAY_COMPARER> (keyComparer)}
281 {
282 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
283 AssertRepValidType_ ();
284 }
285 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
286 inline void SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
287 {
289 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
290 }
291 }
292
293}
#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
#define AssertNotReached()
Definition Assertions.h:355
SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an SkipList-based concrete implementat...
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:310
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
nonvirtual KeyThreeWayComparerType GetKeyThreeWayComparer() const
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:302
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:308
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:296
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,...
auto Finally(FUNCTION &&f) -> Private_::FinallySentry< FUNCTION >
Definition Finally.inl:31