Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
SortedKeyedCollection_SkipList.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#include "Stroika/Foundation/Common/Concepts.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8
10
11 /*
12 ********************************************************************************
13 ********** SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::Rep_ ***********
14 ********************************************************************************
15 */
16 template <typename T, typename KEY_TYPE, typename TRAITS>
17 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IThreeWayComparer<KEY_TYPE>) COMPARER>
18 class SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::Rep_ : public Private::SkipListBasedContainerRepImpl<Rep_<COMPARER>, IImplRepBase_>,
19 public Memory::UseBlockAllocationIfAppropriate<Rep_<COMPARER>> {
20 public:
21 static_assert (not is_reference_v<COMPARER>);
22
23 private:
24 using inherited = Private::SkipListBasedContainerRepImpl<Rep_<COMPARER>, IImplRepBase_>;
25
26 private:
27 [[no_unique_address]] const KeyExtractorType fKeyExtractor_;
28
29 public:
30 Rep_ (const KeyExtractorType& keyExtractor, const COMPARER& comparer)
31 : fKeyExtractor_{keyExtractor}
32 , fData_{SKIPLIST_ELT_COMPARER<COMPARER>{keyExtractor, comparer}}
33 {
34 }
35 Rep_ (const Rep_& from) = default;
36
37 public:
38 nonvirtual Rep_& operator= (const Rep_&) = delete;
39
40 // Iterable<T>::_IRep overrides
41 public:
42 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
43 {
45 return Memory::MakeSharedPtr<Rep_> (*this);
46 }
47 virtual Iterator<value_type> MakeIterator () const override
48 {
50 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
51 }
52 virtual size_t size () const override
53 {
55 return fData_.size ();
56 }
57 virtual bool empty () const override
58 {
60 return fData_.empty ();
61 }
62 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
63 {
65 fData_.Apply ([&] (auto arg) { doToElement (arg.fKey); });
66 }
67 virtual Iterator<T> Find (const function<bool (ArgByValueType<value_type> item)>& that, [[maybe_unused]] Execution::SequencePolicy seq) const override
68 {
70 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, fData_.Find ([&] (auto arg) { return that (arg.fKey); }))};
71 }
72 virtual Iterator<value_type> Find_equal_to (const ArgByValueType<value_type>& v, [[maybe_unused]] Execution::SequencePolicy seq) const override
73 {
74 // if doing a find by 'equals-to' - we already have this indexed
75 auto found = fData_.Find (v);
76#if 0
77 Ensure ((found == fData_.end () and this->inherited::Find_equal_to (v, seq) == Iterator<value_type>{nullptr}) or
78 (found == Debug::UncheckedDynamicCast<const IteratorRep_&> (this->inherited::Find_equal_to (v, seq).ConstGetRep ())
79 .fIterator.GetUnderlyingIteratorRep ()));
80#endif
81 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, found)};
82 }
83
84 // KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep overrides
85 public:
86 virtual KeyExtractorType GetKeyExtractor () const override
87 {
89 return fKeyExtractor_;
90 }
91 virtual KeyEqualityComparerType GetKeyEqualityComparer () const override
92 {
94 return Common::EqualsComparerAdapter<T, COMPARER>{fData_.key_comp ().fKeyComparer};
95 }
96 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneEmpty () const override
97 {
99 return Memory::MakeSharedPtr<Rep_> (this->fKeyExtractor_, fData_.key_comp ().fKeyComparer); // keep extractor/comparer but lose data in clone
100 }
101 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
102 {
103 RequireNotNull (i);
105 auto result = Memory::MakeSharedPtr<Rep_> (*this);
106 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
107 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
108 i->Refresh (); // reflect updated rep
109 return result;
110 }
111 virtual bool Lookup (ArgByValueType<KeyType> key, optional<value_type>* item) const override
112 {
114 auto i = fData_.Find (key);
115 if (i == fData_.end ()) {
116 if (item != nullptr) {
117 *item = nullopt;
118 }
119 return false;
120 }
121 else {
122 if (item != nullptr) {
123 *item = i->fKey;
124 }
125 return true;
126 }
127 }
128 virtual bool Add (ArgByValueType<value_type> item) override
129 {
131 size_t szBefore = fData_.size ();
132 fData_.Add (item); // note return value says if changed, doesn't report if added, so check size for that
133 fChangeCounts_.PerformedChange ();
134 return szBefore != fData_.size ();
135 }
136 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
137 {
138 Require (not i.Done ());
140 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
141 mir.fIterator.AssertDataMatches (&fData_);
142 auto nextIResult = fData_.erase (mir.fIterator);
143 fChangeCounts_.PerformedChange ();
144 if (nextI != nullptr) {
145 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, nextIResult)};
146 }
147 }
148 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
149 {
151 auto i = fData_.Find (key);
152 if (i != fData_.end ()) {
153 fData_.Remove (i);
154 fChangeCounts_.PerformedChange ();
155 return true;
156 }
157 return false;
158 }
159
160 // SortedKeyedCollection<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
161 public:
162 virtual KeyThreeWayComparerType GetThreeWayKeyComparer () const override
163 {
165 return fData_.key_comp ().fKeyComparer;
166 }
167
168 private:
169 using DataStructureImplType_ = SKIPLIST<COMPARER>;
170 struct IterTraits_ : Private::IteratorImplHelper_DefaultTraits<value_type, DataStructureImplType_> {
171 static constexpr value_type ConvertDataStructureIterationResult2ContainerIteratorResult (const typename DataStructureImplType_::value_type& t)
172 {
173 return t.fKey;
174 }
175 };
176 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_, IterTraits_>;
177
178 private:
179 DataStructureImplType_ fData_;
180 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
181
182 private:
183 friend inherited;
184 };
185
186 /*
187 ********************************************************************************
188 ********** SortedKeyedCollection_SkipList<KEY_TYPE,MAPPED_VALUE_TYPE> **********
189 ********************************************************************************
190 */
191 template <typename T, typename KEY_TYPE, typename TRAITS>
192 template <IThreeWayComparer<KEY_TYPE> COMPARER>
193 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (COMPARER&& keyComparer)
194 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
195 : SortedKeyedCollection_SkipList{KeyExtractorType{}, forward<COMPARER> (keyComparer)}
196 {
197 }
198 template <typename T, typename KEY_TYPE, typename TRAITS>
199 template <IThreeWayComparer<KEY_TYPE> COMPARER>
200 SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (const KeyExtractorType& keyExtractor, COMPARER&& keyComparer)
201 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<COMPARER>>> (keyExtractor, forward<COMPARER> (keyComparer))}
202 {
203 AssertRepValidType_ ();
204 }
205#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
206 template <typename T, typename KEY_TYPE, typename TRAITS>
207 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
208 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS> and
209 not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>>)
210 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (ITERABLE_OF_ADDABLE&& src)
211 : SortedKeyedCollection_SkipList{KeyExtractorType{}, COMPARER{}}
212 {
213 this->AddAll (src);
214 AssertRepValidType_ ();
215 }
216#endif
217 template <typename T, typename KEY_TYPE, typename TRAITS>
218 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
219 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (COMPARER&& keyComparer, ITERABLE_OF_ADDABLE&& src)
220 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
221 {
222 this->AddAll (src);
223 AssertRepValidType_ ();
224 }
225 template <typename T, typename KEY_TYPE, typename TRAITS>
226 template <IThreeWayComparer<KEY_TYPE> COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
227 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (const KeyExtractorType& keyExtractor,
228 COMPARER&& keyComparer, ITERABLE_OF_ADDABLE&& src)
229 : SortedKeyedCollection_SkipList{keyExtractor, forward<COMPARER> (keyComparer)}
230 {
231 this->AddAll (src);
232 AssertRepValidType_ ();
233 }
234 template <typename T, typename KEY_TYPE, typename TRAITS>
235 template <IInputIterator<T> ITERATOR_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
236 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
237 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
238 : SortedKeyedCollection_SkipList{KeyExtractorType{}, COMPARER{}}
239 {
240 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
241 AssertRepValidType_ ();
242 }
243 template <typename T, typename KEY_TYPE, typename TRAITS>
244 template <IInputIterator<T> ITERATOR_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
245 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (COMPARER&& keyComparer, ITERATOR_OF_ADDABLE&& start,
246 ITERATOR_OF_ADDABLE&& end)
247 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
248 : SortedKeyedCollection_SkipList{KeyExtractorType{}, forward<COMPARER> (keyComparer)}
249 {
250 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
251 AssertRepValidType_ ();
252 }
253 template <typename T, typename KEY_TYPE, typename TRAITS>
254 template <IThreeWayComparer<KEY_TYPE> COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
255 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (const KeyExtractorType& keyExtractor,
256 COMPARER&& keyComparer, ITERATOR_OF_ADDABLE&& start,
257 ITERATOR_OF_ADDABLE&& end)
258 : SortedKeyedCollection_SkipList{keyExtractor, forward<COMPARER> (keyComparer)}
259 {
260 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
261 AssertRepValidType_ ();
262 }
263 template <typename T, typename KEY_TYPE, typename TRAITS>
264 inline void SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::AssertRepValidType_ () const
265 {
267 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
268 }
269 }
270
271}
#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...
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,...