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 SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ :
public IImplRepBase_,
19 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_INORDER_COMPARER>> {
21 using inherited = IImplRepBase_;
24 static_assert (not is_reference_v<KEY_INORDER_COMPARER>);
27 Rep_ (
const KEY_INORDER_COMPARER& inorderComparer)
28 : fData_{inorderComparer}
31 Rep_ (STDMAP<KEY_INORDER_COMPARER>&& src)
35 Rep_ (
const Rep_& from) =
default;
38 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
42 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone ()
const override
45 return Memory::MakeSharedPtr<Rep_> (*
this);
47 virtual Iterator<value_type>
MakeIterator ()
const override
50 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
52 virtual size_t size ()
const override
56 return fData_.size ();
58 virtual bool empty ()
const override
62 return fData_.empty ();
64 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
67 fData_.Apply (doToElement);
69 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
Execution::SequencePolicy seq)
const override
77 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
80 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
82 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
85 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
87 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
91 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
92 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
93 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
97 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item)
const override
100 auto i = fData_.find (key);
101 if (i == fData_.end ()) {
102 if (item !=
nullptr) {
108 if (item !=
nullptr) {
114 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt,
AddReplaceMode addReplaceMode)
override
119 switch (addReplaceMode) {
121 result = fData_.insert_or_assign (key, newElt).second;
124 result = fData_.insert ({key, newElt}).second;
129 fChangeCounts_.PerformedChange ();
133 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
137 auto i = fData_.find (key);
138 if (i != fData_.end ()) {
140 fChangeCounts_.PerformedChange ();
145 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
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)};
154 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
157 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
158 if (nextI !=
nullptr) {
159 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
162 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
164 fChangeCounts_.PerformedChange ();
165 if (nextI !=
nullptr) {
166 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
175 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
179 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<KEY_INORDER_COMPARER>>;
180 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
183 DataStructureImplType_ fData_;
184 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
192 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
194 requires (totally_ordered<KEY_TYPE>)
197 AssertRepValidType_ ();
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))}
204 AssertRepValidType_ ();
206 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
207 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
209 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
211 AssertRepValidType_ ();
213 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
215 requires (totally_ordered<KEY_TYPE>)
216 : SortedMapping_stdmap{}
219 AssertRepValidType_ ();
221 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
222 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
224 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
225 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
228 AssertRepValidType_ ();
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{}
238 AssertRepValidType_ ();
239 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
240 AssertRepValidType_ ();
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>
246 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
248 AssertRepValidType_ ();
249 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
250 AssertRepValidType_ ();
252 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
253 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
255 requires (totally_ordered<KEY_TYPE>)
256 : SortedMapping_stdmap{}
258 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
259 AssertRepValidType_ ();
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)}
267 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
268 AssertRepValidType_ ();
270 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
271 inline void SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
274 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)
#define AssertNotReached()
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)
nonvirtual optional< mapped_type > Lookup(ArgByValueType< key_type > key) const
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)
nonvirtual bool RemoveIf(ArgByValueType< key_type > key)
Remove the given item, if it exists. Return true if found and removed.
nonvirtual void Remove(ArgByValueType< key_type > key)
Remove the given item (which must exist).
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.
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'.
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,...