Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
SortedAssociation_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 ****** SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ ***********
14 ********************************************************************************
15 */
16 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IThreeWayComparer<KEY_TYPE>) KEY_COMPARER>
18 class SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
19 : public Private::SkipListBasedContainerRepImpl<Rep_<KEY_COMPARER>, IImplRepBase_>,
20 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_COMPARER>> {
21 private:
22 using inherited = Private::SkipListBasedContainerRepImpl<Rep_<KEY_COMPARER>, IImplRepBase_>;
23
24 public:
25 static_assert (not is_reference_v<KEY_COMPARER>);
26
27 public:
28 Rep_ (const KEY_COMPARER& comparer)
29 : fData_{comparer}
30 {
31 }
32 Rep_ (SKIPLIST<KEY_COMPARER>&& src)
33 : fData_{move (src)}
34 {
35 }
36 Rep_ (const Rep_& from) = default;
37
38 public:
39 nonvirtual Rep_& operator= (const Rep_&) = delete;
40
41 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
42 public:
43 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
44 {
46 return Memory::MakeSharedPtr<Rep_> (*this);
47 }
48 virtual Iterator<value_type> MakeIterator () const override
49 {
51 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
52 }
53 virtual size_t size () const override
54 {
56 fData_.Invariant ();
57 return fData_.size ();
58 }
59 virtual bool empty () const override
60 {
62 fData_.Invariant ();
63 return fData_.empty ();
64 }
65 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
66 {
68 fData_.Apply (doToElement);
69 }
70 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
71 {
73 return this->inherited::Find (that, seq); // @todo rewrite to use fData
74 }
75
76 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
77 public:
78 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
79 {
81 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_COMPARER>{fData_.key_comp ()};
82 }
83 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
84 {
86 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data in clone
87 }
88 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
89 {
92 auto result = Memory::MakeSharedPtr<Rep_> (*this);
93 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
95 i->Refresh (); // reflect updated rep
96 return result;
97 }
98 virtual Iterable<mapped_type> Lookup (ArgByValueType<KEY_TYPE> key) const override
99 {
100 // @todo consider doing custom class here, or using CreateGenerator
102 auto i = fData_.Find (key); // returns iterator to first matching key
103 vector<mapped_type> result;
104 if (i != fData_.end ()) {
105 Assert (GetKeyEqualsComparer () (key, i->fKey));
106 result.push_back (i->fValue);
107 // the items in a multimap are all in order so we know the current i->key is not less
108 Assert (fData_.key_comp () (key, i->fKey) == strong_ordering::equal);
109 for (++i; i != fData_.end () and fData_.key_comp () (key, i->fKey) == strong_ordering::equal; ++i) {
110 result.push_back (i->fValue);
111 }
112 }
113 return Iterable<mapped_type>{move (result)};
114 }
115 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt) override
116 {
118 fData_.Invariant ();
119 (void)fData_.Add (key, newElt);
120 fChangeCounts_.PerformedChange ();
121 fData_.Invariant ();
122 }
123 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
124 {
126 fData_.Invariant ();
127 auto i = fData_.Find (key);
128 if (i != fData_.end ()) {
129 fData_.Remove (i);
130 fChangeCounts_.PerformedChange ();
131 return true;
132 }
133 return false;
134 }
135 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
136 {
138 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator);
139 fChangeCounts_.PerformedChange ();
140 if (nextI != nullptr) {
141 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, newI)};
142 }
143 }
144 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
145 {
147 optional<Iterator<value_type>> savedNextI;
148 if (nextI != nullptr) {
149 *nextI = i;
150 }
151 fData_.Update (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator, newValue);
152 fChangeCounts_.PerformedChange ();
153 if (nextI != nullptr) {
154 savedNextI->Refresh ();
155 }
156 }
157
158 // SortedAssociation<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
159 public:
160 virtual KeyThreeWayComparerType GetKeyThreeWayComparer () const override
161 {
163 return fData_.key_comp ();
164 }
165
166 private:
167 using DataStructureImplType_ = SKIPLIST<KEY_COMPARER>;
168 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
169
170 private:
171 DataStructureImplType_ fData_;
172 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
173
174 private:
175 friend inherited;
176 };
177
178 /*
179 ********************************************************************************
180 ********* SortedAssociation_SkipList<KEY_TYPE,MAPPED_VALUE_TYPE> ***************
181 ********************************************************************************
182 */
183 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
185 : SortedAssociation_SkipList{compare_three_way{}}
186 {
187 AssertRepValidType_ ();
188 }
189 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
190 template <IThreeWayComparer<KEY_TYPE> KEY_COMPARER>
192 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_COMPARER>>> (forward<KEY_COMPARER> (comparer))}
193 {
194 AssertRepValidType_ ();
195 }
196 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
197 template <IThreeWayComparer<KEY_TYPE> KEY_COMPARER>
199 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_COMPARER>>> (move (src))}
200 {
201 AssertRepValidType_ ();
202 }
203 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
204 template <IThreeWayComparer<KEY_TYPE> KEY_COMPARER>
206 KEY_COMPARER&& comparer, const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
207 : SortedAssociation_SkipList{forward<KEY_COMPARER> (comparer)}
208 {
209 this->AddAll (src);
210 AssertRepValidType_ ();
211 }
212#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
213 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
214 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
215 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>>)
217 : SortedAssociation_SkipList{}
218 {
219 AssertRepValidType_ ();
220 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
221 AssertRepValidType_ ();
222 }
223#endif
224 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
225 template <IThreeWayComparer<KEY_TYPE> KEY_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
226 inline SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedAssociation_SkipList (KEY_COMPARER&& comparer, ITERABLE_OF_ADDABLE&& src)
227 : SortedAssociation_SkipList{forward<KEY_COMPARER> (comparer)}
228 {
229 AssertRepValidType_ ();
230 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
231 AssertRepValidType_ ();
232 }
233 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
234 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
235 SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedAssociation_SkipList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
236 : SortedAssociation_SkipList{}
237 {
238 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
239 AssertRepValidType_ ();
240 }
241 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
242 template <IThreeWayComparer<KEY_TYPE> KEY_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
243 SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedAssociation_SkipList (KEY_COMPARER&& comparer, ITERATOR_OF_ADDABLE&& start,
244 ITERATOR_OF_ADDABLE&& end)
245 : SortedAssociation_SkipList{forward<KEY_COMPARER> (comparer)}
246 {
247 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
248 AssertRepValidType_ ();
249 }
250 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
251 inline void SortedAssociation_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
252 {
254 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
255 }
256 }
257
258}
#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
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)....
SortedAssociation_SkipList<KEY_TYPE,MAPPED_VALUE_TYPE> is an SkipList-based concrete implementation o...
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:300
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:306
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:294
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...