Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
SortedMultiSet_stdmap.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8
10
11 /**
12 */
13 template <typename T, typename TRAITS>
14 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IInOrderComparer<T>) INORDER_COMPARER>
15 class SortedMultiSet_stdmap<T, TRAITS>::Rep_ : public IImplRepBase_, public Memory::UseBlockAllocationIfAppropriate<Rep_<INORDER_COMPARER>> {
16 private:
17 using inherited = IImplRepBase_;
18
19 public:
20 static_assert (not is_reference_v<INORDER_COMPARER>);
21
22 public:
23 Rep_ (const INORDER_COMPARER& inorderComparer)
24 : fData_{inorderComparer}
25 {
26 }
27 Rep_ (const Rep_& from) = default;
28
29 public:
30 nonvirtual Rep_& operator= (const Rep_&) = delete;
31
32 // Iterable<typename TRAITS::CountedValueType>::_IRep overrides
33 public:
34 virtual shared_ptr<typename Iterable<typename TRAITS::CountedValueType>::_IRep> Clone () const override
35 {
37 return Memory::MakeSharedPtr<Rep_> (*this);
38 }
39 virtual size_t size () const override
40 {
42 return fData_.size ();
43 }
44 virtual bool empty () const override
45 {
47 return fData_.empty ();
48 }
49 virtual Iterator<value_type> MakeIterator () const override
50 {
52 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
53 }
54 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
55 {
57 return this->inherited::Find (that, seq); // @todo rewrite to use fData
58 }
59
60 // MultiSet<T, TRAITS>::_IRep overrides
61 public:
62 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
63 {
65 return Common::EqualsComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
66 }
67 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneEmpty () const override
68 {
70 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data
71 }
72 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
73 {
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; });
81 i->Refresh (); // reflect updated rep
82 return result;
83 }
84 virtual bool Equals (const typename MultiSet<T, TRAITS>::_IRep& rhs) const override
85 {
87 return this->_Equals_Reference_Implementation (rhs);
88 }
89 virtual bool Contains (ArgByValueType<T> item) const override
90 {
91 value_type tmp{item};
93 return fData_.find (item) != fData_.end ();
94 }
95 virtual void Add (ArgByValueType<T> item, CounterType count) override
96 {
97 if (count == 0) {
98 return;
99 }
101 auto i = fData_.find (item);
102 if (i == fData_.end ()) {
103 fData_.insert ({item, count});
104 }
105 else {
106 i->second += count;
107 }
108 fChangeCounts_.PerformedChange ();
109 }
110 virtual size_t RemoveIf (ArgByValueType<T> item, CounterType count) override
111 {
112 Require (count != 0);
114 auto i = fData_.find (item);
115 Require (i != fData_.end ());
116 if (i != fData_.end ()) {
117 size_t result; // intentionally uninitialized
118 if (i->second > count) {
119 i->second -= count;
120 result = count;
121 }
122 else {
123 result = i->second;
124 fData_.erase (i);
125 }
126 fChangeCounts_.PerformedChange ();
127 return result;
128 }
129 return 0;
130 }
131 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
132 {
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)};
141 }
142 }
143 virtual void UpdateCount (const Iterator<value_type>& i, CounterType newCount, Iterator<value_type>* nextI) override
144 {
146 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
147 if (newCount == 0) {
148 if (nextI != nullptr) {
149 *nextI = i;
150 ++(*nextI);
151 }
152 (void)fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
153 }
154 else {
155 fData_.remove_constness (mir.fIterator.GetUnderlyingIteratorRep ())->second = newCount;
156 if (nextI != nullptr) {
157 *nextI = i;
158 }
159 }
160 fChangeCounts_.PerformedChange ();
161 if (nextI != nullptr) {
162 Debug::UncheckedDynamicCast<IteratorRep_&> (nextI->GetRep ()).UpdateChangeCount ();
163 nextI->Refresh (); // update to reflect changes made to rep
164 }
165 }
166 virtual CounterType OccurrencesOf (ArgByValueType<T> item) const override
167 {
169 auto i = fData_.find (item);
170 if (i == fData_.end ()) {
171 return 0;
172 }
173 return i->second;
174 }
175
176 // SortedMultiSet<T,TRAITS>::_IRep overrides
177 public:
178 virtual ElementThreeWayComparerType GetElementThreeWayComparer () const override
179 {
181 return Common::ThreeWayComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
182 }
183
184 private:
185 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<INORDER_COMPARER>>;
186 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
187
188 private:
189 DataStructureImplType_ fData_;
190 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
191 };
192
193 /*
194 ********************************************************************************
195 ************************ SortedMultiSet_stdmap<T, TRAITS> **********************
196 ********************************************************************************
197 */
198 template <typename T, typename TRAITS>
199 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap ()
200 : SortedMultiSet_stdmap{less<T>{}}
201 {
202 AssertRepValidType_ ();
203 }
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))}
208 {
209 AssertRepValidType_ ();
210 }
211 template <typename T, typename TRAITS>
212 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (const initializer_list<T>& src)
213 : SortedMultiSet_stdmap{}
214 {
215 this->AddAll (src);
216 AssertRepValidType_ ();
217 }
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)}
222 {
223 this->AddAll (src);
224 AssertRepValidType_ ();
225 }
226 template <typename T, typename TRAITS>
227 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (const initializer_list<value_type>& src)
228 : SortedMultiSet_stdmap{}
229 {
230 this->AddAll (src);
231 AssertRepValidType_ ();
232 }
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)}
237 {
238 this->AddAll (src);
239 AssertRepValidType_ ();
240 }
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{}
247 {
248 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
249 AssertRepValidType_ ();
250 }
251#endif
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)}
256 {
257 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
258 AssertRepValidType_ ();
259 }
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{}
264 {
265 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
266 AssertRepValidType_ ();
267 }
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)}
272 {
273 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
274 AssertRepValidType_ ();
275 }
276 template <typename T, typename TRAITS>
277 inline void SortedMultiSet_stdmap<T, TRAITS>::AssertRepValidType_ () const
278 {
280 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
281 }
282 }
283
284}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
#define RequireNotNull(p)
Definition Assertions.h:347
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...
Definition MultiSet.inl:292
nonvirtual void UpdateCount(const Iterator< value_type > &i, CounterType newCount, Iterator< value_type > *nextI=nullptr)
Definition MultiSet.inl:309
nonvirtual void Add(ArgByValueType< T > item)
Definition MultiSet.inl:248
nonvirtual ElementEqualityComparerType GetElementEqualsComparer() const
Definition MultiSet.inl:225
nonvirtual bool Contains(ArgByValueType< T > item) const
Definition MultiSet.inl:230
nonvirtual CounterType OccurrencesOf(ArgByValueType< T > item) const
Definition MultiSet.inl:327
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...
Definition MultiSet.inl:304
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.
Definition Iterable.inl:302
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:308
nonvirtual Iterator< T > MakeIterator() const
Create an iterator object which can be used to traverse the 'Iterable'.
Definition Iterable.inl:296
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...