4#include "Stroika/Foundation/Common/Concepts.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
16 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_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>> {
21 static_assert (not is_reference_v<COMPARER>);
24 using inherited = Private::SkipListBasedContainerRepImpl<Rep_<COMPARER>, IImplRepBase_>;
27 [[no_unique_address]]
const KeyExtractorType fKeyExtractor_;
30 Rep_ (
const KeyExtractorType& keyExtractor,
const COMPARER& comparer)
31 : fKeyExtractor_{keyExtractor}
32 , fData_{SKIPLIST_ELT_COMPARER<COMPARER>{keyExtractor, comparer}}
35 Rep_ (
const Rep_& from) =
default;
38 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
42 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
45 return Memory::MakeSharedPtr<Rep_> (*
this);
47 virtual Iterator<value_type> MakeIterator ()
const override
50 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
52 virtual size_t size ()
const override
55 return fData_.size ();
57 virtual bool empty ()
const override
60 return fData_.empty ();
62 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
65 fData_.Apply ([&] (
auto arg) { doToElement (arg.fKey); });
67 virtual Iterator<T> Find (
const function<
bool (ArgByValueType<value_type> item)>& that, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
70 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, fData_.Find ([&] (
auto arg) { return that (arg.fKey); }))};
72 virtual Iterator<value_type> Find_equal_to (
const ArgByValueType<value_type>& v, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
75 auto found = fData_.Find (v);
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 ()));
81 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, found)};
86 virtual KeyExtractorType GetKeyExtractor ()
const override
89 return fKeyExtractor_;
91 virtual KeyEqualityComparerType GetKeyEqualityComparer ()
const override
94 return Common::EqualsComparerAdapter<T, COMPARER>{fData_.key_comp ().fKeyComparer};
96 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneEmpty ()
const override
99 return Memory::MakeSharedPtr<Rep_> (this->fKeyExtractor_, fData_.key_comp ().fKeyComparer);
101 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
105 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
106 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
107 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
111 virtual bool Lookup (ArgByValueType<KeyType> key, optional<value_type>* item)
const override
114 auto i = fData_.Find (key);
115 if (i == fData_.end ()) {
116 if (item !=
nullptr) {
122 if (item !=
nullptr) {
128 virtual bool Add (ArgByValueType<value_type> item)
override
131 size_t szBefore = fData_.size ();
133 fChangeCounts_.PerformedChange ();
134 return szBefore != fData_.size ();
136 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
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)};
148 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
151 auto i = fData_.Find (key);
152 if (i != fData_.end ()) {
154 fChangeCounts_.PerformedChange ();
162 virtual KeyThreeWayComparerType GetThreeWayKeyComparer ()
const override
165 return fData_.key_comp ().fKeyComparer;
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)
176 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_, IterTraits_>;
179 DataStructureImplType_ fData_;
180 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
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)}
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))}
203 AssertRepValidType_ ();
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{}}
214 AssertRepValidType_ ();
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>)
223 AssertRepValidType_ ();
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)}
232 AssertRepValidType_ ();
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{}}
240 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
241 AssertRepValidType_ ();
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)}
250 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
251 AssertRepValidType_ ();
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)}
260 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
261 AssertRepValidType_ ();
263 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
264 inline void SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::AssertRepValidType_ ()
const
267 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{
this};
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
#define RequireNotNull(p)
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,...