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_>;
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 ([[maybe_unused]]
bool findFirst,
const function<
bool (ArgByValueType<value_type> item)>& that,
71 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, fData_.Find ([&] (
auto arg) { return that (arg.fKey); }))};
73 virtual Iterator<value_type> Find_equal_to (
const ArgByValueType<value_type>& v, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
76 auto found = fData_.Find (v);
78 Ensure ((found == fData_.end () and this->inherited::Find_equal_to (v, seq) == Iterator<value_type>{nullptr}) or
79 (found == Debug::UncheckedDynamicCast<const IteratorRep_&> (this->inherited::Find_equal_to (v, seq).ConstGetRep ())
80 .fIterator.GetUnderlyingIteratorRep ()));
82 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, found)};
87 virtual KeyExtractorType GetKeyExtractor ()
const override
90 return fKeyExtractor_;
92 virtual KeyEqualityComparerType GetKeyEqualityComparer ()
const override
95 return Common::EqualsComparerAdapter<T, COMPARER>{fData_.key_comp ().fKeyComparer};
97 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneEmpty ()
const override
100 return Memory::MakeSharedPtr<Rep_> (this->fKeyExtractor_, fData_.key_comp ().fKeyComparer);
102 virtual shared_ptr<typename KeyedCollection<T, KEY_TYPE, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
106 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
107 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
108 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
112 virtual bool Lookup (ArgByValueType<KeyType> key, optional<value_type>* item)
const override
115 auto i = fData_.Find (key);
116 if (i == fData_.end ()) {
117 if (item !=
nullptr) {
123 if (item !=
nullptr) {
129 virtual bool Add (ArgByValueType<value_type> item)
override
132 size_t szBefore = fData_.size ();
134 fChangeCounts_.PerformedChange ();
135 return szBefore != fData_.size ();
137 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
139 Require (not i.AtEnd ());
141 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
142 mir.fIterator.AssertDataMatches (&fData_);
143 auto nextIResult = fData_.erase (mir.fIterator);
144 fChangeCounts_.PerformedChange ();
145 if (nextI !=
nullptr) {
146 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, nextIResult)};
149 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
152 auto i = fData_.Find (key);
153 if (i != fData_.end ()) {
155 fChangeCounts_.PerformedChange ();
163 virtual KeyThreeWayComparerType GetThreeWayKeyComparer ()
const override
166 return fData_.key_comp ().fKeyComparer;
170 using DataStructureImplType_ = SKIPLIST<COMPARER>;
171 struct IterTraits_ : Private::IteratorImplHelper_DefaultTraits<value_type, DataStructureImplType_> {
172 static constexpr value_type ConvertDataStructureIterationResult2ContainerIteratorResult (
const typename DataStructureImplType_::value_type& t)
177 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_, IterTraits_>;
180 DataStructureImplType_ fData_;
192 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
193 template <IThreeWayComparer<KEY_TYPE> COMPARER>
194 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (COMPARER&& keyComparer)
195 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
196 : SortedKeyedCollection_SkipList{KeyExtractorType{}, forward<COMPARER> (keyComparer)}
199 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
200 template <IThreeWayComparer<KEY_TYPE> COMPARER>
201 SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (
const KeyExtractorType& keyExtractor, COMPARER&& keyComparer)
202 : inherited{Memory::
MakeSharedPtr<Rep_<remove_cvref_t<COMPARER>>> (keyExtractor, forward<COMPARER> (keyComparer))}
204 AssertRepValidType_ ();
206#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
207 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
208 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
209 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS> and
210 not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>>)
211 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (ITERABLE_OF_ADDABLE&& src)
212 : SortedKeyedCollection_SkipList{KeyExtractorType{}, COMPARER{}}
215 AssertRepValidType_ ();
218 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
219 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
220 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (COMPARER&& keyComparer, ITERABLE_OF_ADDABLE&& src)
221 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
224 AssertRepValidType_ ();
226 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
227 template <IThreeWayComparer<KEY_TYPE> COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
228 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (
const KeyExtractorType& keyExtractor,
229 COMPARER&& keyComparer, ITERABLE_OF_ADDABLE&& src)
230 : SortedKeyedCollection_SkipList{keyExtractor, forward<COMPARER> (keyComparer)}
233 AssertRepValidType_ ();
235 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
236 template <IInputIterator<T> ITERATOR_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
237 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
238 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
239 : SortedKeyedCollection_SkipList{KeyExtractorType{}, COMPARER{}}
241 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
242 AssertRepValidType_ ();
244 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
245 template <IInputIterator<T> ITERATOR_OF_ADDABLE, IThreeWayComparer<KEY_TYPE> COMPARER>
246 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (COMPARER&& keyComparer, ITERATOR_OF_ADDABLE&& start,
247 ITERATOR_OF_ADDABLE&& end)
248 requires (IKeyedCollection_ExtractorCanBeDefaulted<T, KEY_TYPE, TRAITS>)
249 : SortedKeyedCollection_SkipList{KeyExtractorType{}, forward<COMPARER> (keyComparer)}
251 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
252 AssertRepValidType_ ();
254 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
255 template <IThreeWayComparer<KEY_TYPE> COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
256 inline SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::SortedKeyedCollection_SkipList (
const KeyExtractorType& keyExtractor,
257 COMPARER&& keyComparer, ITERATOR_OF_ADDABLE&& start,
258 ITERATOR_OF_ADDABLE&& end)
259 : SortedKeyedCollection_SkipList{keyExtractor, forward<COMPARER> (keyComparer)}
261 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
262 AssertRepValidType_ ();
264 template <
typename T,
typename KEY_TYPE,
typename TRAITS>
265 inline void SortedKeyedCollection_SkipList<T, KEY_TYPE, TRAITS>::AssertRepValidType_ ()
const
268 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...
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS - used for the attribute [[no_unique_address]]
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE
[[msvc::no_unique_address]] isn't always broken in MSVC. Annotate with this on things where its not b...
unique_lock< AssertExternallySynchronizedChecker > WriteContext
Instantiate AssertExternallySynchronizedChecker::WriteContext to designate an area of code where prot...
shared_lock< const AssertExternallySynchronizedChecker > ReadContext
Instantiate AssertExternallySynchronizedChecker::ReadContext to designate an area of code where prote...
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...