Stroika Library 3.0d24
 
Loading...
Searching...
No Matches
SortedMultiSet_stdmap.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. 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:
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:
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 (bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
55 Execution::SequencePolicy seq) const override
56 {
58 return this->inherited::Find (findFirst, that, seq); // @todo rewrite to use fData
59 }
60
61 // MultiSet<T, TRAITS>::_IRep overrides
62 public:
63 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
64 {
66 return Common::EqualsComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
67 }
68 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneEmpty () const override
69 {
71 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data
72 }
73 virtual shared_ptr<typename MultiSet<T, TRAITS>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
74 {
77 auto result = Memory::MakeSharedPtr<Rep_> (*this);
78 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
79 result->fData_.MoveIteratorHereAfterClone (
80 &mir.fIterator, &fData_,
81 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (auto oldI, [[maybe_unused]] auto newI) { return targetI == oldI; });
82 i->Refresh (); // reflect updated rep
83 return result;
84 }
85 virtual bool Equals (const typename MultiSet<T, TRAITS>::_IRep& rhs) const override
86 {
88 return this->_Equals_Reference_Implementation (rhs);
89 }
90 virtual bool Contains (ArgByValueType<T> item) const override
91 {
92 value_type tmp{item};
94 return fData_.find (item) != fData_.end ();
95 }
96 virtual void Add (ArgByValueType<T> item, CounterType count) override
97 {
98 if (count == 0) {
99 return;
100 }
102 auto i = fData_.find (item);
103 if (i == fData_.end ()) {
104 fData_.insert ({item, count});
105 }
106 else {
107 i->second += count;
108 }
109 fChangeCounts_.PerformedChange ();
110 }
111 virtual size_t RemoveIf (ArgByValueType<T> item, CounterType count) override
112 {
113 Require (count != 0);
115 auto i = fData_.find (item);
116 Require (i != fData_.end ());
117 if (i != fData_.end ()) {
118 size_t result; // intentionally uninitialized
119 if (i->second > count) {
120 i->second -= count;
121 result = count;
122 }
123 else {
124 result = i->second;
125 fData_.erase (i);
126 }
127 fChangeCounts_.PerformedChange ();
128 return result;
129 }
130 return 0;
131 }
132 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
133 {
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) {
141 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, n)};
142 }
143 }
144 virtual void UpdateCount (const Iterator<value_type>& i, CounterType newCount, Iterator<value_type>* nextI) override
145 {
147 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
148 if (newCount == 0) {
149 if (nextI != nullptr) {
150 *nextI = i;
151 ++(*nextI);
152 }
153 (void)fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
154 }
155 else {
156 fData_.remove_constness (mir.fIterator.GetUnderlyingIteratorRep ())->second = newCount;
157 if (nextI != nullptr) {
158 *nextI = i;
159 }
160 }
161 fChangeCounts_.PerformedChange ();
162 if (nextI != nullptr) {
163 Debug::UncheckedDynamicCast<IteratorRep_&> (nextI->GetRep ()).UpdateChangeCount ();
164 nextI->Refresh (); // update to reflect changes made to rep
165 }
166 }
167 virtual CounterType OccurrencesOf (ArgByValueType<T> item) const override
168 {
170 auto i = fData_.find (item);
171 if (i == fData_.end ()) {
172 return 0;
173 }
174 return i->second;
175 }
176
177 // SortedMultiSet<T,TRAITS>::_IRep overrides
178 public:
179 virtual ElementThreeWayComparerType GetElementThreeWayComparer () const override
180 {
182 return Common::ThreeWayComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
183 }
184
185 private:
186 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<INORDER_COMPARER>>;
187 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
188
189 private:
190 DataStructureImplType_ fData_;
191 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
192 };
193
194 /*
195 ********************************************************************************
196 ************************ SortedMultiSet_stdmap<T, TRAITS> **********************
197 ********************************************************************************
198 */
199 template <typename T, typename TRAITS>
200 inline SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap ()
201 : SortedMultiSet_stdmap{less<T>{}}
202 {
203 AssertRepValidType_ ();
204 }
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))}
209 {
210 AssertRepValidType_ ();
211 }
212 template <typename T, typename TRAITS>
213 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (const initializer_list<T>& src)
214 : SortedMultiSet_stdmap{}
215 {
216 this->AddAll (src);
217 AssertRepValidType_ ();
218 }
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)}
223 {
224 this->AddAll (src);
225 AssertRepValidType_ ();
226 }
227 template <typename T, typename TRAITS>
228 SortedMultiSet_stdmap<T, TRAITS>::SortedMultiSet_stdmap (const initializer_list<value_type>& src)
229 : SortedMultiSet_stdmap{}
230 {
231 this->AddAll (src);
232 AssertRepValidType_ ();
233 }
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)}
238 {
239 this->AddAll (src);
240 AssertRepValidType_ ();
241 }
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{}
248 {
249 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
250 AssertRepValidType_ ();
251 }
252#endif
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)}
257 {
258 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
259 AssertRepValidType_ ();
260 }
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{}
265 {
266 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
267 AssertRepValidType_ ();
268 }
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)}
273 {
274 AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
275 AssertRepValidType_ ();
276 }
277 template <typename T, typename TRAITS>
278 inline void SortedMultiSet_stdmap<T, TRAITS>::AssertRepValidType_ () const
279 {
281 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
282 }
283 }
284
285}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:49
#define RequireNotNull(p)
Definition Assertions.h:348
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...
Definition StdCompat.h:443
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:320
nonvirtual void UpdateCount(const Iterator< value_type > &i, CounterType newCount, Iterator< value_type > *nextI=nullptr)
Definition MultiSet.inl:337
nonvirtual void Add(ArgByValueType< T > item)
Definition MultiSet.inl:251
nonvirtual ElementEqualityComparerType GetElementEqualsComparer() const
Definition MultiSet.inl:228
nonvirtual bool Contains(ArgByValueType< T > item) const
Definition MultiSet.inl:233
nonvirtual CounterType OccurrencesOf(ArgByValueType< T > item) const
Definition MultiSet.inl:355
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:332
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.
Definition Iterable.inl:311
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:317
nonvirtual Iterator< T > MakeIterator() const
Create an iterator object which can be used to traverse the 'Iterable'.
Definition Iterable.inl:305
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...