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 ();
78 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
81 return Common::EqualsComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
86 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
92 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
93 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (&
mir.fIterator, &fData_,
95 [
targetI =
mir.fIterator.GetUnderlyingIteratorRep ()] (
103 auto i = fData_.find (
key);
104 if (i == fData_.end ()) {
105 if (
item !=
nullptr) {
111 if (
item !=
nullptr) {
124 result = fData_.insert_or_assign (
key, newElt).second;
127 result = fData_.insert ({
key, newElt}).
second;
132 fChangeCounts_.PerformedChange ();
140 auto i = fData_.find (
key);
141 if (i != fData_.end ()) {
143 fChangeCounts_.PerformedChange ();
151 auto newI = fData_.erase (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ());
152 fChangeCounts_.PerformedChange ();
153 if (
nextI !=
nullptr) {
161 if (
nextI !=
nullptr) {
162 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
165 .remove_constness (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ())
167 fChangeCounts_.PerformedChange ();
168 if (
nextI !=
nullptr) {
178 return Common::ThreeWayComparerAdapter<KEY_TYPE, KEY_INORDER_COMPARER>{fData_.key_comp ()};
182 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDMAP<KEY_INORDER_COMPARER>>;
183 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
186 DataStructureImplType_ fData_;
195 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
197 requires (totally_ordered<KEY_TYPE>)
200 AssertRepValidType_ ();
202 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
203 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
204 inline SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::SortedMapping_stdmap (KEY_INORDER_COMPARER&& inorderComparer)
205 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (forward<KEY_INORDER_COMPARER> (inorderComparer))}
207 AssertRepValidType_ ();
209 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
210 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
212 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_INORDER_COMPARER>>> (move (src))}
214 AssertRepValidType_ ();
216 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
218 requires (totally_ordered<KEY_TYPE>)
219 : SortedMapping_stdmap{}
222 AssertRepValidType_ ();
224 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
225 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER>
227 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
228 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
231 AssertRepValidType_ ();
233#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
234 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
235 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
236 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>>)
238 requires (totally_ordered<KEY_TYPE>)
239 : SortedMapping_stdmap{}
241 AssertRepValidType_ ();
242 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
243 AssertRepValidType_ ();
246 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
247 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
249 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
251 AssertRepValidType_ ();
253 AssertRepValidType_ ();
255 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
256 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
258 requires (totally_ordered<KEY_TYPE>)
259 : SortedMapping_stdmap{}
261 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
262 AssertRepValidType_ ();
264 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
265 template <IInOrderComparer<KEY_TYPE> KEY_INORDER_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
267 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
268 : SortedMapping_stdmap{forward<KEY_INORDER_COMPARER> (inorderComparer)}
271 AssertRepValidType_ ();
273 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
274 inline void SortedMapping_stdmap<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
277 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
unique_lock< AssertExternallySynchronizedChecker > WriteContext
Instantiate AssertExternallySynchronizedChecker::WriteContext to designate an area of code where prot...
shared_lock< const AssertExternallySynchronizedChecker > ReadContext
Instantiate AssertExternallySynchronizedChecker::ReadContext to designate an area of code where prote...
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that) const
Run the argument bool-returning function (or lambda) on the elements of the container,...
nonvirtual size_t size() const
Returns the number of items contained.
nonvirtual void Apply(const function< void(ArgByValueType< T > item)> &doToElement) const
Run the argument function (or lambda) on each element of the container.
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,...