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_;
35 Rep_ (
const Rep_&
from) =
default;
38 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
45 return Memory::MakeSharedPtr<Rep_> (*
this);
52 virtual size_t size ()
const override
56 return fData_.size ();
58 virtual bool empty ()
const override
62 return fData_.empty ();
77 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
80 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
85 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
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 ()] (
102 auto i = fData_.find (
key);
103 if (i == fData_.end ()) {
104 if (
item !=
nullptr) {
110 if (
item !=
nullptr) {
123 result = fData_.insert_or_assign (
key, newElt).second;
126 result = fData_.insert ({
key, newElt}).
second;
131 fChangeCounts_.PerformedChange ();
139 auto i = fData_.find (
key);
140 if (i != fData_.end ()) {
142 fChangeCounts_.PerformedChange ();
150 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
151 fChangeCounts_.PerformedChange ();
152 if (
nextI !=
nullptr) {
160 if (
nextI !=
nullptr) {
161 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
164 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
166 fChangeCounts_.PerformedChange ();
167 if (
nextI !=
nullptr) {
177 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
181 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<KEY_INORDER_COMPARER>>;
182 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
185 DataStructureImplType_ fData_;
194 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
196 requires (totally_ordered<KEY_TYPE>)
199 AssertRepValidType_ ();
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))}
206 AssertRepValidType_ ();
208 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
209 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
211 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
213 AssertRepValidType_ ();
215 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
217 requires (totally_ordered<KEY_TYPE>)
218 : SortedMapping_stdmap{}
221 AssertRepValidType_ ();
223 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
224 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
226 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
227 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
230 AssertRepValidType_ ();
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{}
240 AssertRepValidType_ ();
241 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
242 AssertRepValidType_ ();
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>
248 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
250 AssertRepValidType_ ();
252 AssertRepValidType_ ();
254 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
255 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
257 requires (totally_ordered<KEY_TYPE>)
258 : SortedMapping_stdmap{}
260 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
261 AssertRepValidType_ ();
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)}
270 AssertRepValidType_ ();
272 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
273 inline void SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
276 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()
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE
[[msvc::no_unique_address]] isn't always broken in MSVC. Annotate with this on things where its not b...
SortedMapping_stdmap<KEY_TYPE,MAPPED_VALUE_TYPE> is an std::map-based concrete implementation of the ...
nonvirtual CONTAINER_OF_Key_T As() const
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,...