5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
17 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
18 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_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>> {
23 static_assert (not is_reference_v<KEY_THREEWAY_COMPARER>);
26 using inherited = Private::SkipListBasedContainerRepImpl<Rep_<KEY_THREEWAY_COMPARER>, IImplRepBase_>;
29 Rep_ (
const KEY_THREEWAY_COMPARER& inorderComparer)
30 : fData_{inorderComparer}
33 Rep_ (SKIPLIST<KEY_THREEWAY_COMPARER>&& src)
37 Rep_ (
const Rep_& from) =
default;
40 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
44 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone ()
const override
47 return Memory::MakeSharedPtr<Rep_> (*
this);
49 virtual Iterator<value_type>
MakeIterator ()
const override
52 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
54 virtual size_t size ()
const override
58 return fData_.size ();
60 virtual bool empty ()
const override
64 return fData_.empty ();
66 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
69 fData_.Apply (doToElement);
71 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
80 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
83 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_THREEWAY_COMPARER>{fData_.key_comp ()};
85 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
88 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
90 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
94 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
95 result->fData_.MoveIteratorHereAfterClone (&Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ()).fIterator, &fData_);
99 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item)
const override
102 auto i = fData_.Find (key);
103 if (i == fData_.end ()) {
104 if (item !=
nullptr) {
110 if (item !=
nullptr) {
116 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt,
AddReplaceMode addReplaceMode)
override
121 [[maybe_unused]]
auto&& cleanup =
Execution::Finally ([
this] ()
noexcept { fChangeCounts_.PerformedChange (); });
122 switch (addReplaceMode) {
125 result = fData_.Add (key, newElt);
128 result = fData_.Add (key, newElt);
130 if (fData_.Find (key)) {
133 auto r = fData_.Add (key, newElt);
142 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
146 if (
auto i = fData_.Find (key)) {
148 fChangeCounts_.PerformedChange ();
153 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
155 Require (not i.Done ());
157 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
158 mir.fIterator.AssertDataMatches (&fData_);
159 if (nextI ==
nullptr) {
160 fData_.Remove (mir.fIterator);
161 fChangeCounts_.PerformedChange ();
164 auto ret = fData_.erase (mir.fIterator);
165 fChangeCounts_.PerformedChange ();
166 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
169 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
172 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
173 if (nextI !=
nullptr) {
174 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
176 fData_.Update (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator, newValue);
177 fChangeCounts_.PerformedChange ();
178 if (nextI !=
nullptr) {
179 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
188 return fData_.key_comp ();
192 using DataStructureImplType_ = SKIPLIST<KEY_THREEWAY_COMPARER>;
193 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
196 DataStructureImplType_ fData_;
197 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
208 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
210 requires (three_way_comparable<KEY_TYPE>)
213 AssertRepValidType_ ();
215 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
216 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER>
218 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_THREEWAY_COMPARER>>> (move (src))}
220 AssertRepValidType_ ();
222 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
223 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER>
225 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_THREEWAY_COMPARER>>> (keyComparer)}
227 AssertRepValidType_ ();
229 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
231 requires (three_way_comparable<KEY_TYPE>)
232 : SortedMapping_SkipList{}
235 AssertRepValidType_ ();
237 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
238 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER>
240 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
241 : SortedMapping_SkipList{forward<KEY_THREEWAY_COMPARER> (keyComparer)}
244 AssertRepValidType_ ();
246#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
247 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
248 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
249 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>>)
251 requires (three_way_comparable<KEY_TYPE>)
252 : SortedMapping_SkipList{}
254 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
255 AssertRepValidType_ ();
258 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
259 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
261 : SortedMapping_SkipList{forward<KEY_THREEWAY_COMPARER> (keyComparer)}
263 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
264 AssertRepValidType_ ();
266 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
267 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
269 requires (three_way_comparable<KEY_TYPE>)
270 : SortedMapping_SkipList{}
272 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
273 AssertRepValidType_ ();
275 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
276 template <IThreeWayComparer<KEY_TYPE> KEY_THREEWAY_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
278 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
279 : SortedMapping_SkipList{forward<KEY_THREEWAY_COMPARER> (keyComparer)}
281 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
282 AssertRepValidType_ ();
284 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
285 inline void SortedMapping_SkipList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
288 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)
#define AssertNotReached()
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)
nonvirtual optional< mapped_type > Lookup(ArgByValueType< key_type > key) const
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)
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 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.
nonvirtual bool empty() const
Returns true iff size() == 0.
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'.
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 >