5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (Common::IInOrderComparer<T>) INORDER_COMPARER>
18 class SortedCollection_stdmultiset<T>::Rep_ :
public IImplRepBase_,
public Memory::UseBlockAllocationIfAppropriate<Rep_<INORDER_COMPARER>> {
20 using inherited = IImplRepBase_;
23 static_assert (not is_reference_v<INORDER_COMPARER>);
26 Rep_ (
const INORDER_COMPARER& inorderComparer)
27 : fData_{inorderComparer}
30 Rep_ (
const Rep_& from) =
default;
33 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
37 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
40 return Memory::MakeSharedPtr<Rep_> (*
this);
42 virtual Iterator<value_type>
MakeIterator ()
const override
45 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
47 virtual size_t size ()
const override
50 return fData_.size ();
52 virtual bool empty ()
const override
55 return fData_.empty ();
57 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
60 fData_.Apply (doToElement);
62 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
Execution::SequencePolicy seq)
const override
67 virtual Iterator<value_type> Find_equal_to (
const ArgByValueType<value_type>& v, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
70 auto found = fData_.find (v);
71 Ensure ((found == fData_.end () and this->inherited::Find_equal_to (v, seq) == Iterator<value_type>{nullptr}) or
72 (found == Debug::UncheckedDynamicCast<const IteratorRep_&> (this->inherited::Find_equal_to (v, seq).ConstGetRep ())
73 .fIterator.GetUnderlyingIteratorRep ()));
74 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, found)};
79 virtual shared_ptr<typename Collection<T>::_IRep> CloneEmpty ()
const override
81 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
83 virtual shared_ptr<typename Collection<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
87 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
88 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
89 result->fData_.MoveIteratorHereAfterClone (
90 &mir.fIterator, &fData_,
91 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (
auto oldI, [[maybe_unused]]
auto newI) { return targetI == oldI; });
95 virtual void Add (ArgByValueType<value_type> item, Iterator<value_type>* oAddedI)
override
98 auto addedAtI = fData_.insert (item);
99 fChangeCounts_.PerformedChange ();
100 if (oAddedI !=
nullptr) [[unlikely]] {
101 *oAddedI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, addedAtI)};
104 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<value_type> newValue, Iterator<value_type>* nextI)
override
107 auto nextIR = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
108 fData_.insert (newValue);
109 fChangeCounts_.PerformedChange ();
110 if (nextI !=
nullptr) {
111 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, nextIR)};
114 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
117 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
118 mir.fIterator.AssertDataMatches (&fData_);
119 auto nextIR = fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
120 fChangeCounts_.PerformedChange ();
121 if (nextI !=
nullptr) {
122 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, nextIR)};
131 return Common::ThreeWayComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
133 virtual bool Contains (ArgByValueType<value_type> item)
const override
136 return fData_.contains (item);
138 virtual void Remove (ArgByValueType<value_type> item)
override
142 auto i = fData_.find (item);
143 if (i != fData_.end ()) {
145 fChangeCounts_.PerformedChange ();
150 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMULTISET<INORDER_COMPARER>>;
151 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
154 DataStructureImplType_ fData_;
155 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
163 template <
typename T>
167 AssertRepValidType_ ();
169 template <
typename T>
170 template <Common::IInOrderComparer<T> INORDER_COMPARER>
171 inline SortedCollection_stdmultiset<T>::SortedCollection_stdmultiset (INORDER_COMPARER&& inorderComparer)
172 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<INORDER_COMPARER>>> (inorderComparer)}
174 AssertRepValidType_ ();
176 template <
typename T>
178 : SortedCollection_stdmultiset{}
181 AssertRepValidType_ ();
183 template <
typename T>
184 template <Common::IInOrderComparer<T> INORDER_COMPARER>
186 : SortedCollection_stdmultiset{forward<INORDER_COMPARER> (inOrderComparer)}
189 AssertRepValidType_ ();
191#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
192 template <
typename T>
193 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
194 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedCollection_stdmultiset<T>>)
196 : SortedCollection_stdmultiset{}
198 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
199 AssertRepValidType_ ();
202 template <
typename T>
203 template <Common::IInOrderComparer<T> INORDER_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
205 : SortedCollection_stdmultiset{forward<INORDER_COMPARER> (inOrderComparer)}
207 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
208 AssertRepValidType_ ();
210 template <
typename T>
211 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
213 : SortedCollection_stdmultiset{}
215 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
216 AssertRepValidType_ ();
218 template <
typename T>
219 template <Common::IInOrderComparer<T> INORDER_COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
221 ITERATOR_OF_ADDABLE&& end)
222 : SortedCollection_stdmultiset{forward<INORDER_COMPARER> (inOrderComparer)}
224 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
225 AssertRepValidType_ ();
227 template <
typename T>
228 inline void SortedCollection_stdmultiset<T>::AssertRepValidType_ ()
const
231 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)
nonvirtual void AddAll(ITERATOR_OF_ADDABLE &&start, ITERATOR_OF_ADDABLE2 &&end)
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< value_type > newValue, Iterator< value_type > *nextI=nullptr)
nonvirtual void Add(ArgByValueType< value_type > item)
SortedCollection_stdmultiset<T> is an stdmultiset-based concrete implementation of the SortedCollecti...
SortedCollection_stdmultiset()
nonvirtual ElementThreeWayComparerType GetElementThreeWayComparer() const
nonvirtual bool Contains(ArgByValueType< T > item) const
Compares items with the already associated GetInOrderComparer(), and returns true if the item is foun...
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'.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...