5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
13 template <
typename T,
typename TRAITS>
14 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (IInOrderComparer<T>) INORDER_COMPARER>
15 class SortedMultiSet_stdmap<T, TRAITS>::Rep_ :
public IImplRepBase_,
public Memory::UseBlockAllocationIfAppropriate<Rep_<INORDER_COMPARER>> {
17 using inherited = IImplRepBase_;
20 static_assert (not is_reference_v<INORDER_COMPARER>);
23 Rep_ (
const INORDER_COMPARER& inorderComparer)
24 : fData_{inorderComparer}
27 Rep_ (
const Rep_& from) =
default;
30 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
34 virtual shared_ptr<typename Iterable<typename TRAITS::CountedValueType>::_IRep> Clone ()
const override
37 return Memory::MakeSharedPtr<Rep_> (*
this);
39 virtual size_t size ()
const override
42 return fData_.size ();
44 virtual bool empty ()
const override
47 return fData_.empty ();
49 virtual Iterator<value_type>
MakeIterator ()
const override
52 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
54 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
Execution::SequencePolicy seq)
const override
65 return Common::EqualsComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
67 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneEmpty ()
const override
70 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
72 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
76 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
77 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
78 result->fData_.MoveIteratorHereAfterClone (
79 &mir.fIterator, &fData_,
80 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (
auto oldI, [[maybe_unused]]
auto newI) { return targetI == oldI; });
84 virtual bool Equals (
const typename MultiSet<T, TRAITS>::_IRep& rhs)
const override
87 return this->_Equals_Reference_Implementation (rhs);
89 virtual bool Contains (ArgByValueType<T> item)
const override
93 return fData_.find (item) != fData_.end ();
95 virtual void Add (ArgByValueType<T> item, CounterType count)
override
101 auto i = fData_.find (item);
102 if (i == fData_.end ()) {
103 fData_.insert ({item, count});
108 fChangeCounts_.PerformedChange ();
110 virtual size_t RemoveIf (ArgByValueType<T> item, CounterType count)
override
112 Require (count != 0);
114 auto i = fData_.find (item);
115 Require (i != fData_.end ());
116 if (i != fData_.end ()) {
118 if (i->second > count) {
126 fChangeCounts_.PerformedChange ();
131 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
133 Require (not i.Done ());
135 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
136 mir.fIterator.AssertDataMatches (&fData_);
137 [[maybe_unused]]
typename DataStructureImplType_::UnderlyingIteratorRep n = fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
138 fChangeCounts_.PerformedChange ();
139 if (nextI !=
nullptr) {
140 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, n)};
143 virtual void UpdateCount (
const Iterator<value_type>& i, CounterType newCount, Iterator<value_type>* nextI)
override
146 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
148 if (nextI !=
nullptr) {
152 (void)fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
155 fData_.remove_constness (mir.fIterator.GetUnderlyingIteratorRep ())->second = newCount;
156 if (nextI !=
nullptr) {
160 fChangeCounts_.PerformedChange ();
161 if (nextI !=
nullptr) {
162 Debug::UncheckedDynamicCast<IteratorRep_&> (nextI->GetRep ()).UpdateChangeCount ();
166 virtual CounterType
OccurrencesOf (ArgByValueType<T> item)
const override
169 auto i = fData_.find (item);
170 if (i == fData_.end ()) {
178 virtual ElementThreeWayComparerType GetElementThreeWayComparer ()
const override
181 return Common::ThreeWayComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
185 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<INORDER_COMPARER>>;
186 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
189 DataStructureImplType_ fData_;
190 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
198 template <
typename T,
typename TRAITS>
199 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap ()
200 : SortedMultiSet_stdmap{less<T>{}}
202 AssertRepValidType_ ();
204 template <
typename T,
typename TRAITS>
205 template <IInOrderComparer<T> INORDER_COMPARER>
206 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer)
207 : inherited{Memory::
MakeSharedPtr<Rep_<remove_cvref_t<INORDER_COMPARER>>> (forward<INORDER_COMPARER> (inorderComparer))}
209 AssertRepValidType_ ();
211 template <
typename T,
typename TRAITS>
212 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (
const initializer_list<T>& src)
213 : SortedMultiSet_stdmap{}
216 AssertRepValidType_ ();
218 template <
typename T,
typename TRAITS>
219 template <IInOrderComparer<T> INORDER_COMPARER>
220 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer,
const initializer_list<T>& src)
221 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
224 AssertRepValidType_ ();
226 template <
typename T,
typename TRAITS>
227 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (
const initializer_list<value_type>& src)
228 : SortedMultiSet_stdmap{}
231 AssertRepValidType_ ();
233 template <
typename T,
typename TRAITS>
234 template <IInOrderComparer<T> INORDER_COMPARER>
235 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer,
const initializer_list<value_type>& src)
236 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
239 AssertRepValidType_ ();
241#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
242 template <
typename T,
typename TRAITS>
243 template <IIterableOfTo<
typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
244 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMultiSet_stdmap<T, TRAITS>>)
245 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (ITERABLE_OF_ADDABLE&& src)
246 : SortedMultiSet_stdmap{}
248 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
249 AssertRepValidType_ ();
252 template <
typename T,
typename TRAITS>
253 template <IInOrderComparer<T> INORDER_COMPARER, IIterableOfTo<
typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
254 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer, ITERABLE_OF_ADDABLE&& src)
255 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
257 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
258 AssertRepValidType_ ();
260 template <
typename T,
typename TRAITS>
261 template <IInputIterator<
typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
262 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
263 : SortedMultiSet_stdmap{}
265 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
266 AssertRepValidType_ ();
268 template <
typename T,
typename TRAITS>
269 template <IInOrderComparer<T> INORDER_COMPARER, IInputIterator<
typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
270 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
271 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
273 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
274 AssertRepValidType_ ();
276 template <
typename T,
typename TRAITS>
277 inline void SortedMultiSet_stdmap<T, TRAITS>::AssertRepValidType_ ()
const
280 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...
bool Equals(const T *lhs, const T *rhs)
strcmp or wsccmp() as appropriate == 0
nonvirtual void Remove(ArgByValueType< T > item, CounterType count=1)
remove the argument data from the multiset. The data specified MUST exist (require) - else use Remove...
nonvirtual void UpdateCount(const Iterator< value_type > &i, CounterType newCount, Iterator< value_type > *nextI=nullptr)
nonvirtual void Add(ArgByValueType< T > item)
nonvirtual ElementEqualityComparerType GetElementEqualsComparer() const
nonvirtual bool Contains(ArgByValueType< T > item) const
nonvirtual CounterType OccurrencesOf(ArgByValueType< T > item) const
nonvirtual size_t RemoveIf(ArgByValueType< T > item, CounterType count=1)
remove the argument data from the multiset (can specify remove of more than are present) - returns nu...
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 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.
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,...