4#include "Stroika/Foundation/Containers/DataStructures/LinkedList.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
16 template <
typename T,
typename TRAITS>
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (IEqualsComparer<T>) EQUALS_COMPARER>
18 class MultiSet_LinkedList<T, TRAITS>::Rep_ :
public IImplRepBase_,
public Memory::UseBlockAllocationIfAppropriate<Rep_<EQUALS_COMPARER>> {
20 using inherited = IImplRepBase_;
23 static_assert (not is_reference_v<EQUALS_COMPARER>);
26 Rep_ (
const EQUALS_COMPARER& equalsComparer)
27 : fEqualsComparer_{equalsComparer}
30 Rep_ (
const Rep_& from) =
default;
33 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
36 [[no_unique_address]]
const EQUALS_COMPARER fEqualsComparer_;
40 virtual shared_ptr<typename Iterable<typename TRAITS::CountedValueType>::_IRep> Clone ()
const override
43 return Memory::MakeSharedPtr<Rep_> (*
this);
45 virtual size_t size ()
const override
48 return fData_.size ();
50 virtual bool empty ()
const override
53 return fData_.empty ();
55 virtual Iterator<value_type>
MakeIterator ()
const override
58 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
60 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
63 fData_.Apply (doToElement);
65 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
69 if (
auto iLink = fData_.Find (that)) {
70 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iLink)};
80 return fEqualsComparer_;
82 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneEmpty ()
const override
85 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_);
87 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
91 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
92 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
93 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
97 virtual bool Equals (
const typename MultiSet<T, TRAITS>::_IRep& rhs)
const override
100 return this->_Equals_Reference_Implementation (rhs);
102 virtual bool Contains (ArgByValueType<T> item)
const override
105 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
106 if (fEqualsComparer_ (it->fValue, item)) {
107 Assert (it->fCount != 0);
113 virtual void Add (ArgByValueType<T> item, CounterType count)
override
117 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
119 if (fEqualsComparer_ (current.fValue, item)) {
120 current.fCount += count;
121 fData_.SetAt (it, current);
122 fChangeCounts_.PerformedChange ();
126 fData_.push_front (value_type{item, count});
127 fChangeCounts_.PerformedChange ();
130 virtual size_t RemoveIf (ArgByValueType<T> item, CounterType count)
override
132 Require (count != 0);
134 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
136 if (fEqualsComparer_ (current.fValue, item)) {
138 if (current.fCount > count) {
139 current.fCount -= count;
140 fData_.SetAt (it, current);
144 result = current.fCount;
147 fChangeCounts_.PerformedChange ();
153 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
156 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
157 if (nextI ==
nullptr) {
158 fData_.Remove (mir.fIterator);
159 fChangeCounts_.PerformedChange ();
162 auto ret = fData_.erase (mir.fIterator);
163 fChangeCounts_.PerformedChange ();
164 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
167 virtual void UpdateCount (
const Iterator<value_type>& i, CounterType newCount, Iterator<value_type>* nextI)
override
170 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
172 if (nextI !=
nullptr) {
176 fData_.Remove (mir.fIterator);
179 value_type c = *mir.fIterator;
181 fData_.SetAt (mir.fIterator, c);
182 if (nextI !=
nullptr) {
186 fChangeCounts_.PerformedChange ();
187 if (nextI !=
nullptr) {
188 Debug::UncheckedDynamicCast<IteratorRep_&> (nextI->GetRep ()).UpdateChangeCount ();
192 virtual CounterType
OccurrencesOf (ArgByValueType<T> item)
const override
195 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
197 if (fEqualsComparer_ (current.fValue, item)) {
198 Ensure (current.fCount != 0);
199 return current.fCount;
206 using DataStructureImplType_ = DataStructures::LinkedList<value_type>;
207 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
210 DataStructureImplType_ fData_;
211 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
219 template <
typename T,
typename TRAITS>
223 AssertRepValidType_ ();
225 template <
typename T,
typename TRAITS>
226 template <IEqualsComparer<T> EQUALS_COMPARER>
227 inline MultiSet_LinkedList<T, TRAITS>::MultiSet_LinkedList (EQUALS_COMPARER&& equalsComparer)
228 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<EQUALS_COMPARER>>> (forward<EQUALS_COMPARER> (equalsComparer))}
230 AssertRepValidType_ ();
232#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
233 template <
typename T,
typename TRAITS>
234 template <IIterableOfTo<
typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
235 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, MultiSet_LinkedList<T, TRAITS>>)
237 : MultiSet_LinkedList{}
239 AddAll (forward<ITERABLE_OF_ADDABLE> (src));
240 AssertRepValidType_ ();
243 template <
typename T,
typename TRAITS>
244 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<
typename TRAITS::CountedValueType> ITERABLE_OF_ADDABLE>
246 : MultiSet_LinkedList{forward<EQUALS_COMPARER> (equalsComparer)}
248 AddAll (forward<ITERABLE_OF_ADDABLE> (src));
249 AssertRepValidType_ ();
251 template <
typename T,
typename TRAITS>
253 : MultiSet_LinkedList{}
256 AssertRepValidType_ ();
258 template <
typename T,
typename TRAITS>
259 template <IEqualsComparer<T> EQUALS_COMPARER>
261 : MultiSet_LinkedList{forward<EQUALS_COMPARER> (equalsComparer)}
264 AssertRepValidType_ ();
266 template <
typename T,
typename TRAITS>
268 : MultiSet_LinkedList{}
271 AssertRepValidType_ ();
273 template <
typename T,
typename TRAITS>
274 template <IEqualsComparer<T> EQUALS_COMPARER>
276 : MultiSet_LinkedList{forward<EQUALS_COMPARER> (equalsComparer)}
279 AssertRepValidType_ ();
281 template <
typename T,
typename TRAITS>
282 template <IInputIterator<
typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
284 : MultiSet_LinkedList{}
286 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
287 AssertRepValidType_ ();
289 template <
typename T,
typename TRAITS>
290 template <IEqualsComparer<T> EQUALS_COMPARER, IInputIterator<
typename TRAITS::CountedValueType> ITERATOR_OF_ADDABLE>
292 : MultiSet_LinkedList{forward<EQUALS_COMPARER> (equalsComparer)}
294 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
295 AssertRepValidType_ ();
297 template <
typename T,
typename TRAITS>
298 inline void MultiSet_LinkedList<T, TRAITS>::AssertRepValidType_ ()
const
301 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)
bool Equals(const T *lhs, const T *rhs)
strcmp or wsccmp() as appropriate == 0
nonvirtual void AddAll(ITERATOR_OF_ADDABLE &&start, ITERATOR_OF_ADDABLE2 &&end)
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 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,...