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_;
27 Rep_ (
const Rep_&
from) =
default;
30 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
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 ();
66 return Common::EqualsComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
71 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
77 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
78 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
79 result->fData_.MoveIteratorHereAfterClone (
80 &
mir.fIterator, &fData_,
85 virtual bool Equals (
const typename MultiSet<T, TRAITS>::_IRep&
rhs)
const override
88 return this->_Equals_Reference_Implementation (
rhs);
94 return fData_.find (
item) != fData_.end ();
102 auto i = fData_.find (
item);
103 if (i == fData_.end ()) {
104 fData_.insert ({
item, count});
109 fChangeCounts_.PerformedChange ();
113 Require (count != 0);
115 auto i = fData_.find (
item);
116 Require (i != fData_.end ());
117 if (i != fData_.end ()) {
119 if (i->second > count) {
127 fChangeCounts_.PerformedChange ();
134 Require (
not i.AtEnd ());
136 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
137 mir.fIterator.AssertDataMatches (&fData_);
138 [[
maybe_unused]]
typename DataStructureImplType_::UnderlyingIteratorRep
n = fData_.erase (
mir.fIterator.GetUnderlyingIteratorRep ());
139 fChangeCounts_.PerformedChange ();
140 if (
nextI !=
nullptr) {
147 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
149 if (
nextI !=
nullptr) {
153 (
void)fData_.erase (
mir.fIterator.GetUnderlyingIteratorRep ());
156 fData_.remove_constness (
mir.fIterator.GetUnderlyingIteratorRep ())->
second =
newCount;
157 if (
nextI !=
nullptr) {
161 fChangeCounts_.PerformedChange ();
162 if (
nextI !=
nullptr) {
163 Debug::UncheckedDynamicCast<IteratorRep_&> (
nextI->GetRep ()).UpdateChangeCount ();
170 auto i = fData_.find (
item);
171 if (i == fData_.end ()) {
179 virtual ElementThreeWayComparerType GetElementThreeWayComparer ()
const override
182 return Common::ThreeWayComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
186 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<INORDER_COMPARER>>;
187 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
190 DataStructureImplType_ fData_;
199 template <
typename T,
typename TRAITS>
200 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap ()
201 : SortedMultiSet_stdmap{less<T>{}}
203 AssertRepValidType_ ();
205 template <
typename T,
typename TRAITS>
206 template <IInOrderComparer<T> INORDER_COMPARER>
207 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer)
208 : inherited{Memory::
MakeSharedPtr<Rep_<remove_cvref_t<INORDER_COMPARER>>> (forward<INORDER_COMPARER> (inorderComparer))}
210 AssertRepValidType_ ();
212 template <
typename T,
typename TRAITS>
213 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (
const initializer_list<T>& src)
214 : SortedMultiSet_stdmap{}
217 AssertRepValidType_ ();
219 template <
typename T,
typename TRAITS>
220 template <IInOrderComparer<T> INORDER_COMPARER>
221 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer,
const initializer_list<T>& src)
222 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
225 AssertRepValidType_ ();
227 template <
typename T,
typename TRAITS>
228 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (
const initializer_list<value_type>& src)
229 : SortedMultiSet_stdmap{}
232 AssertRepValidType_ ();
234 template <
typename T,
typename TRAITS>
235 template <IInOrderComparer<T> INORDER_COMPARER>
236 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer,
const initializer_list<value_type>& src)
237 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
240 AssertRepValidType_ ();
242#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
243 template <
typename T,
typename TRAITS>
244 template <IIterableOfTo<
typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
245 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMultiSet_stdmap<T, TRAITS>>)
246 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (ITERABLE_OF_ADDABLE&& src)
247 : SortedMultiSet_stdmap{}
249 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
250 AssertRepValidType_ ();
253 template <
typename T,
typename TRAITS>
254 template <IInOrderComparer<T> INORDER_COMPARER, IIterableOfTo<
typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
255 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer, ITERABLE_OF_ADDABLE&& src)
256 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
258 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
259 AssertRepValidType_ ();
261 template <
typename T,
typename TRAITS>
262 template <IInputIterator<
typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
263 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
264 : SortedMultiSet_stdmap{}
266 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
267 AssertRepValidType_ ();
269 template <
typename T,
typename TRAITS>
270 template <IInOrderComparer<T> INORDER_COMPARER, IInputIterator<
typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
271 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (INORDER_COMPARER&& inorderComparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
272 : SortedMultiSet_stdmap{forward<INORDER_COMPARER> (inorderComparer)}
274 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
275 AssertRepValidType_ ();
277 template <
typename T,
typename TRAITS>
278 inline void SortedMultiSet_stdmap<T, TRAITS>::AssertRepValidType_ ()
const
281 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
#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...
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...
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...
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that) const
Run the argument bool-returning function (or lambda) on the elements of the container,...
nonvirtual CONTAINER_OF_T As(CONTAINER_OF_T_CONSTRUCTOR_ARGS... args) const
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,...