Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
SortedAssociation_stdmultimap.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 ****** SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ ********
14 ********************************************************************************
15 */
16 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IInOrderComparer<KEY_TYPE>) KEY_INORDER_COMPARER>
18 class SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
19 : public IImplRepBase_,
20 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_INORDER_COMPARER>> {
21 private:
22 using inherited = IImplRepBase_;
23
24 public:
25 static_assert (not is_reference_v<KEY_INORDER_COMPARER>);
26
27 public:
28 Rep_ (const KEY_INORDER_COMPARER& inorderComparer)
29 : fData_{inorderComparer}
30 {
31 }
32 Rep_ (STDMULTIMAP<KEY_INORDER_COMPARER>&& src)
33 : fData_{move (src)}
34 {
35 }
36 Rep_ (const Rep_& from) = default;
37
38 public:
39 nonvirtual Rep_& operator= (const Rep_&) = delete;
40
41 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
42 public:
43 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
44 {
46 return Memory::MakeSharedPtr<Rep_> (*this);
47 }
48 virtual Iterator<value_type> MakeIterator () const override
49 {
51 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
52 }
53 virtual size_t size () const override
54 {
56 fData_.Invariant ();
57 return fData_.size ();
58 }
59 virtual bool empty () const override
60 {
62 fData_.Invariant ();
63 return fData_.empty ();
64 }
65 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
66 {
68 fData_.Apply (doToElement);
69 }
70 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
71 {
73 return this->inherited::Find (that, seq); // @todo rewrite to use fData
74 }
75
76 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
77 public:
78 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
79 {
81 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
82 }
83 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
84 {
86 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data in clone
87 }
88 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
89 {
92 auto result = Memory::MakeSharedPtr<Rep_> (*this);
93 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
95 i->Refresh (); // reflect updated rep
96 return result;
97 }
98 virtual Iterable<mapped_type> Lookup (ArgByValueType<KEY_TYPE> key) const override
99 {
100 // @todo consider doing custom class here, or using CreateGenerator
102 auto i = fData_.find (key);
103 vector<mapped_type> result;
104 if (i != fData_.end ()) {
105 Assert (GetKeyEqualsComparer () (key, i->first));
106 result.push_back (i->second);
107 // the items in a multimap are all in order so we know the current i->key is not less
108 Assert (not fData_.key_comp () (key, i->first));
109 Assert (not fData_.key_comp () (i->first, key));
110 for (++i; i != fData_.end () and not fData_.key_comp () (key, i->first); ++i) {
111 result.push_back (i->second);
112 }
113 }
114 return Iterable<mapped_type>{move (result)};
115 }
116 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt) override
117 {
119 fData_.Invariant ();
120 (void)fData_.insert ({key, newElt});
121 fChangeCounts_.PerformedChange ();
122 fData_.Invariant ();
123 }
124 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
125 {
127 fData_.Invariant ();
128 auto i = fData_.find (key);
129 if (i != fData_.end ()) {
130 fData_.erase (i);
131 fChangeCounts_.PerformedChange ();
132 return true;
133 }
134 return false;
135 }
136 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
137 {
139 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
140 fChangeCounts_.PerformedChange ();
141 if (nextI != nullptr) {
142 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, newI)};
143 }
144 }
145 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
146 {
148 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
149 if (nextI != nullptr) {
150 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
151 }
152 fData_
153 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
154 ->second = newValue;
155 fChangeCounts_.PerformedChange ();
156 if (nextI != nullptr) {
157 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
158 }
159 }
160
161 // SortedAssociation<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
162 public:
163 virtual KeyThreeWayComparerType GetKeyThreeWayComparer () const override
164 {
166 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
167 }
168
169 private:
170 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMULTIMAP<KEY_INORDER_COMPARER>>;
171 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
172
173 private:
174 DataStructureImplType_ fData_;
175 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
176 };
177
178 /*
179 ********************************************************************************
180 ********* SortedAssociation_stdmultimap<KEY_TYPE,MAPPED_VALUE_TYPE> ************
181 ********************************************************************************
182 */
183 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
189 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
190 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
192 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (forward<KEY_INORDER_COMPARER> (inorderComparer))}
193 {
194 AssertRepValidType_ ();
195 }
196 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
197 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
199 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
200 {
201 AssertRepValidType_ ();
202 }
203 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
204 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
206 KEY_INORDER_COMPARER&& inorderComparer, const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
207 : SortedAssociation_stdmultimap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
208 {
209 this->AddAll (src);
210 AssertRepValidType_ ();
211 }
212#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
213 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
214 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
215 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>>)
217 : SortedAssociation_stdmultimap{}
218 {
219 AssertRepValidType_ ();
220 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
221 AssertRepValidType_ ();
222 }
223#endif
224 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
225 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
227 ITERABLE_OF_ADDABLE&& src)
228 : SortedAssociation_stdmultimap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
229 {
230 AssertRepValidType_ ();
231 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
232 AssertRepValidType_ ();
233 }
234 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
235 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
236 SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedAssociation_stdmultimap (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
237 : SortedAssociation_stdmultimap{}
238 {
239 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
240 AssertRepValidType_ ();
241 }
242 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
243 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
245 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
246 : SortedAssociation_stdmultimap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
247 {
248 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
249 AssertRepValidType_ ();
250 }
251 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
252 inline void SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
253 {
255 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
256 }
257 }
258
259}
#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
nonvirtual void Add(ArgByValueType< key_type > key, ArgByValueType< mapped_type > newElt)
nonvirtual void AddAll(ITERABLE_OF_ADDABLE &&items)
nonvirtual Traversal::Iterable< mapped_type > Lookup(ArgByValueType< key_type > key) const
Return an Iterable<mapped_type> of all the associated items (can be empty if none)....
SortedAssociation_stdmultimap<KEY_TYPE,MAPPED_VALUE_TYPE> is an std::map-based concrete implementatio...
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.
Definition Iterable.inl:300
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:306
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'.
Definition Iterable.inl:294
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...