5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
16 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_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>> {
22 using inherited = IImplRepBase_;
25 static_assert (not is_reference_v<KEY_INORDER_COMPARER>);
28 Rep_ (
const KEY_INORDER_COMPARER& inorderComparer)
29 : fData_{inorderComparer}
32 Rep_ (STDMULTIMAP<KEY_INORDER_COMPARER>&& src)
36 Rep_ (
const Rep_& from) =
default;
39 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
43 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone ()
const override
46 return Memory::MakeSharedPtr<Rep_> (*
this);
48 virtual Iterator<value_type>
MakeIterator ()
const override
51 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
53 virtual size_t size ()
const override
57 return fData_.size ();
59 virtual bool empty ()
const override
63 return fData_.empty ();
65 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
68 fData_.Apply (doToElement);
70 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
Execution::SequencePolicy seq)
const override
78 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
81 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
83 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
86 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
88 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
92 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
93 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (
95 &mir.fIterator, &fData_,
96 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (
auto oldI, [[maybe_unused]]
auto newI) { return targetI == oldI; });
100 virtual Iterable<mapped_type>
Lookup (ArgByValueType<KEY_TYPE> key)
const override
104 auto i = fData_.find (key);
105 vector<mapped_type> result;
106 if (i != fData_.end ()) {
107 Assert (GetKeyEqualsComparer () (key, i->first));
108 result.push_back (i->second);
110 Assert (not fData_.key_comp () (key, i->first));
111 Assert (not fData_.key_comp () (i->first, key));
112 for (++i; i != fData_.end () and not fData_.key_comp () (key, i->first); ++i) {
113 result.push_back (i->second);
116 return Iterable<mapped_type>{move (result)};
118 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt)
override
122 (void)fData_.insert ({key, newElt});
123 fChangeCounts_.PerformedChange ();
126 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
130 auto i = fData_.find (key);
131 if (i != fData_.end ()) {
133 fChangeCounts_.PerformedChange ();
138 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
141 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
142 fChangeCounts_.PerformedChange ();
143 if (nextI !=
nullptr) {
144 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, newI)};
147 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
150 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
151 if (nextI !=
nullptr) {
152 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
155 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
157 fChangeCounts_.PerformedChange ();
158 if (nextI !=
nullptr) {
159 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
165 virtual KeyThreeWayComparerType GetKeyThreeWayComparer ()
const override
168 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
172 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMULTIMAP<KEY_INORDER_COMPARER>>;
173 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
176 DataStructureImplType_ fData_;
177 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
185 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
189 AssertRepValidType_ ();
191 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
192 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
194 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (forward<KEY_INORDER_COMPARER> (inorderComparer))}
196 AssertRepValidType_ ();
198 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
199 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
201 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
203 AssertRepValidType_ ();
205 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
206 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
208 KEY_INORDER_COMPARER&& inorderComparer,
const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
209 : SortedAssociation_stdmultimap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
212 AssertRepValidType_ ();
214#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
215 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
216 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
217 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>>)
219 : SortedAssociation_stdmultimap{}
221 AssertRepValidType_ ();
222 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
223 AssertRepValidType_ ();
226 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
227 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
229 ITERABLE_OF_ADDABLE&& src)
230 : SortedAssociation_stdmultimap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
232 AssertRepValidType_ ();
233 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
234 AssertRepValidType_ ();
236 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
237 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
239 : SortedAssociation_stdmultimap{}
241 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
242 AssertRepValidType_ ();
244 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
245 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
247 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
248 : SortedAssociation_stdmultimap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
250 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
251 AssertRepValidType_ ();
253 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
254 inline void SortedAssociation_stdmultimap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
257 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{
this};
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
#define RequireNotNull(p)
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...
SortedAssociation_stdmultimap()
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.
nonvirtual bool empty() const
Returns true iff size() == 0.
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'.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...