Stroika Library 3.0d18
 
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 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (
95 auto oldI, [[maybe_unused]] auto newI) -> bool { return targetI == oldI; });
96 i->Refresh (); // reflect updated rep
97 return result;
98 }
99 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item) const override
100 {
102 auto i = fData_.find (key);
103 if (i == fData_.end ()) {
104 if (item != nullptr) {
105 *item = nullopt;
106 }
107 return false;
108 }
109 else {
110 if (item != nullptr) {
111 *item = i->second;
112 }
113 return true;
114 }
115 }
116 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt, AddReplaceMode addReplaceMode) override
117 {
119 fData_.Invariant ();
120 bool result{};
121 switch (addReplaceMode) {
123 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
124 break;
126 result = fData_.insert ({key, newElt}).second; // according to https://en.cppreference.com/w/cpp/container/map/insert no iterator references are invalidated
127 break;
128 default:
130 }
131 fChangeCounts_.PerformedChange ();
132 fData_.Invariant ();
133 return result;
134 }
135 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
136 {
138 fData_.Invariant ();
139 auto i = fData_.find (key);
140 if (i != fData_.end ()) {
141 fData_.erase (i);
142 fChangeCounts_.PerformedChange ();
143 return true;
144 }
145 return false;
146 }
147 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
148 {
150 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
151 fChangeCounts_.PerformedChange ();
152 if (nextI != nullptr) {
153 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, newI)};
154 }
155 }
156 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
157 {
159 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
160 if (nextI != nullptr) {
161 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
162 }
163 fData_
164 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
165 ->second = newValue;
166 fChangeCounts_.PerformedChange ();
167 if (nextI != nullptr) {
168 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
169 }
170 }
171
172 // SortedMapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
173 public:
174 virtual KeyThreeWayComparerType GetKeyThreeWayComparer () const override
175 {
177 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
178 }
179
180 private:
181 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<KEY_INORDER_COMPARER>>;
182 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
183
184 private:
185 DataStructureImplType_ fData_;
186 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
187 };
188
189 /*
190 ********************************************************************************
191 ************* SortedMapping_stdmap<KEY_TYPE,MAPPED_VALUE_TYPE> *****************
192 ********************************************************************************
193 */
194 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
196 requires (totally_ordered<KEY_TYPE>)
197 : SortedMapping_stdmap{less<KEY_TYPE>{}}
198 {
199 AssertRepValidType_ ();
200 }
201 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
202 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
203 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer)
204 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (forward<KEY_INORDER_COMPARER> (inorderComparer))}
205 {
206 AssertRepValidType_ ();
207 }
208 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
209 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
210 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (STDMAP<KEY_INORDER_COMPARER>&& src)
211 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
212 {
213 AssertRepValidType_ ();
214 }
215 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
216 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
217 requires (totally_ordered<KEY_TYPE>)
218 : SortedMapping_stdmap{}
219 {
220 this->AddAll (src);
221 AssertRepValidType_ ();
222 }
223 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
224 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
225 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer,
226 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
227 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
228 {
229 this->AddAll (src);
230 AssertRepValidType_ ();
231 }
232#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
233 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
234 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
235 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>>)
237 requires (totally_ordered<KEY_TYPE>)
238 : SortedMapping_stdmap{}
239 {
240 AssertRepValidType_ ();
241 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
242 AssertRepValidType_ ();
243 }
244#endif
245 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
246 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
247 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer, ITERABLE_OF_ADDABLE&& src)
248 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
249 {
250 AssertRepValidType_ ();
251 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
252 AssertRepValidType_ ();
253 }
254 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
255 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
256 SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
257 requires (totally_ordered<KEY_TYPE>)
258 : SortedMapping_stdmap{}
259 {
260 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
261 AssertRepValidType_ ();
262 }
263 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
264 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
266 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
267 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
268 {
269 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
270 AssertRepValidType_ ();
271 }
272 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
273 inline void SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
274 {
276 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
277 }
278 }
279
280}
#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:188
nonvirtual optional< mapped_type > Lookup(ArgByValueType< key_type > key) const
Definition Mapping.inl:142
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:310
nonvirtual bool RemoveIf(ArgByValueType< key_type > key)
Remove the given item, if it exists. Return true if found and removed.
Definition Mapping.inl:235
nonvirtual void Remove(ArgByValueType< key_type > key)
Remove the given item (which must exist).
Definition Mapping.inl:223
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:302
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:308
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:296
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,...