Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
SortedMapping_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 ********** SortedMapping_stdmap<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 SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ : public IImplRepBase_,
19 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_INORDER_COMPARER>> {
20 private:
21 using inherited = IImplRepBase_;
22
23 public:
24 static_assert (not is_reference_v<KEY_INORDER_COMPARER>);
25
26 public:
27 Rep_ (const KEY_INORDER_COMPARER& inorderComparer)
28 : fData_{inorderComparer}
29 {
30 }
31 Rep_ (STDMAP<KEY_INORDER_COMPARER>&& src)
32 : fData_{move (src)}
33 {
34 }
35 Rep_ (const Rep_& from) = default;
36
37 public:
38 nonvirtual Rep_& operator= (const Rep_&) = delete;
39
40 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
41 public:
42 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
43 {
45 return Memory::MakeSharedPtr<Rep_> (*this);
46 }
47 virtual Iterator<value_type> MakeIterator () const override
48 {
50 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
51 }
52 virtual size_t size () const override
53 {
55 fData_.Invariant ();
56 return fData_.size ();
57 }
58 virtual bool empty () const override
59 {
61 fData_.Invariant ();
62 return fData_.empty ();
63 }
64 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
65 {
67 fData_.Apply (doToElement);
68 }
69 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that, Execution::SequencePolicy seq) const override
70 {
72 return this->inherited::Find (that, seq); // @todo rewrite to use fData
73 }
74
75 // Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
76 public:
77 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
78 {
80 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
81 }
82 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
83 {
85 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ()); // keep comparer, but lose data in clone
86 }
87 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
88 {
91 auto result = Memory::MakeSharedPtr<Rep_> (*this);
92 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
93 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
94 i->Refresh (); // reflect updated rep
95 return result;
96 }
97 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item) const override
98 {
100 auto i = fData_.find (key);
101 if (i == fData_.end ()) {
102 if (item != nullptr) {
103 *item = nullopt;
104 }
105 return false;
106 }
107 else {
108 if (item != nullptr) {
109 *item = i->second;
110 }
111 return true;
112 }
113 }
114 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt, AddReplaceMode addReplaceMode) override
115 {
117 fData_.Invariant ();
118 bool result{};
119 switch (addReplaceMode) {
121 result = fData_.insert_or_assign (key, newElt).second; // according to https://en.cppreference.com/w/cpp/container/map/insert_or_assign - no iterator references are invalidated
122 break;
124 result = fData_.insert ({key, newElt}).second; // according to https://en.cppreference.com/w/cpp/container/map/insert no iterator references are invalidated
125 break;
126 default:
128 }
129 fChangeCounts_.PerformedChange ();
130 fData_.Invariant ();
131 return result;
132 }
133 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
134 {
136 fData_.Invariant ();
137 auto i = fData_.find (key);
138 if (i != fData_.end ()) {
139 fData_.erase (i);
140 fChangeCounts_.PerformedChange ();
141 return true;
142 }
143 return false;
144 }
145 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
146 {
148 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
149 fChangeCounts_.PerformedChange ();
150 if (nextI != nullptr) {
151 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, newI)};
152 }
153 }
154 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
155 {
157 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
158 if (nextI != nullptr) {
159 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
160 }
161 fData_
162 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
163 ->second = newValue;
164 fChangeCounts_.PerformedChange ();
165 if (nextI != nullptr) {
166 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
167 }
168 }
169
170 // SortedMapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
171 public:
172 virtual KeyThreeWayComparerType GetKeyThreeWayComparer () const override
173 {
175 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
176 }
177
178 private:
179 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<KEY_INORDER_COMPARER>>;
180 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
181
182 private:
183 DataStructureImplType_ fData_;
184 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
185 };
186
187 /*
188 ********************************************************************************
189 ************* SortedMapping_stdmap<KEY_TYPE,MAPPED_VALUE_TYPE> *****************
190 ********************************************************************************
191 */
192 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
194 requires (totally_ordered<KEY_TYPE>)
195 : SortedMapping_stdmap{less<KEY_TYPE>{}}
196 {
197 AssertRepValidType_ ();
198 }
199 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
200 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
201 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer)
202 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (forward<KEY_INORDER_COMPARER> (inorderComparer))}
203 {
204 AssertRepValidType_ ();
205 }
206 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
207 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
208 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (STDMAP<KEY_INORDER_COMPARER>&& src)
209 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
210 {
211 AssertRepValidType_ ();
212 }
213 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
214 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
215 requires (totally_ordered<KEY_TYPE>)
216 : SortedMapping_stdmap{}
217 {
218 this->AddAll (src);
219 AssertRepValidType_ ();
220 }
221 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
222 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
223 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer,
224 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
225 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
226 {
227 this->AddAll (src);
228 AssertRepValidType_ ();
229 }
230#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
231 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
232 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
233 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>>)
235 requires (totally_ordered<KEY_TYPE>)
236 : SortedMapping_stdmap{}
237 {
238 AssertRepValidType_ ();
239 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
240 AssertRepValidType_ ();
241 }
242#endif
243 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
244 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
245 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer, ITERABLE_OF_ADDABLE&& src)
246 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
247 {
248 AssertRepValidType_ ();
249 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
250 AssertRepValidType_ ();
251 }
252 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
253 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
254 SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
255 requires (totally_ordered<KEY_TYPE>)
256 : SortedMapping_stdmap{}
257 {
258 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
259 AssertRepValidType_ ();
260 }
261 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
262 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
264 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
265 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
266 {
267 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
268 AssertRepValidType_ ();
269 }
270 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
271 inline void SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
272 {
274 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
275 }
276 }
277
278}
#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
#define AssertNotReached()
Definition Assertions.h:355
SortedMapping_stdmap<KEY_TYPE,MAPPED_VALUE_TYPE> is an std::map-based concrete implementation of the ...
nonvirtual bool Add(ArgByValueType< key_type > key, ArgByValueType< mapped_type > newElt, AddReplaceMode addReplaceMode=AddReplaceMode::eAddReplaces)
Definition Mapping.inl:190
nonvirtual optional< mapped_type > Lookup(ArgByValueType< key_type > key) const
Definition Mapping.inl:144
nonvirtual unsigned int AddAll(ITERABLE_OF_ADDABLE &&items, AddReplaceMode addReplaceMode=AddReplaceMode::eAddReplaces)
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< mapped_type > newValue, Iterator< value_type > *nextI=nullptr)
Definition Mapping.inl:312
nonvirtual bool RemoveIf(ArgByValueType< key_type > key)
Remove the given item, if it exists. Return true if found and removed.
Definition Mapping.inl:237
nonvirtual void Remove(ArgByValueType< key_type > key)
Remove the given item (which must exist).
Definition Mapping.inl:225
nonvirtual KeyThreeWayComparerType GetKeyThreeWayComparer() const
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
AddReplaceMode
Mode flag to say if Adding to a container replaces, or if the first addition wins.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...