4#include "Stroika/Foundation/Containers/DataStructures/Array.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
17 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
18 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (IEqualsComparer<KEY_TYPE>) KEY_EQUALS_COMPARER>
19 class Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ :
public Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>,
20 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_EQUALS_COMPARER>> {
22 using inherited = Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>;
32 Rep_ (
const Rep_&
from) =
default;
35 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
48 return Memory::MakeSharedPtr<Rep_> (*
this);
55 virtual size_t size ()
const override
58 return fData_.size ();
60 virtual bool empty ()
const override
63 return fData_.empty ();
74 if (
auto i = fData_.Find (
that)) {
82 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
85 return fKeyEqualsComparer_;
90 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
96 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
97 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
98 result->fData_.MoveIteratorHereAfterClone (&
mir.fIterator, &fData_);
105 for (
typename DataStructureImplType_::ForwardIterator
it{&fData_};
not it.Done (); ++
it) {
106 if (fKeyEqualsComparer_ (
it->fKey,
key)) {
107 if (
item !=
nullptr) {
113 if (
item !=
nullptr) {
121 for (
typename DataStructureImplType_::ForwardIterator
it{&fData_};
not it.Done (); ++
it) {
122 if (fKeyEqualsComparer_ (
it->fKey,
key)) {
125 fData_[
it.CurrentIndex ()].fValue = newElt;
126 fChangeCounts_.PerformedChange ();
136 fData_.push_back (value_type{
key, newElt});
137 fChangeCounts_.PerformedChange ();
143 for (
typename DataStructureImplType_::ForwardIterator
it{&fData_};
not it.Done (); ++
it) {
144 if (fKeyEqualsComparer_ (
it->fKey,
key)) {
146 fChangeCounts_.PerformedChange ();
155 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
156 if (
nextI ==
nullptr) {
157 fData_.Remove (
mir.fIterator);
158 fChangeCounts_.PerformedChange ();
161 auto retI = fData_.erase (
mir.fIterator);
162 fChangeCounts_.PerformedChange ();
170 if (
nextI !=
nullptr) {
171 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
173 fData_.PeekAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ())->fValue =
newValue;
174 fChangeCounts_.PerformedChange ();
175 if (
nextI !=
nullptr) {
181 using DataStructureImplType_ = DataStructures::Array<value_type>;
182 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
185 DataStructureImplType_ fData_;
197 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
201 AssertRepValidType_ ();
203 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
204 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
205 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
206 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
208 AssertRepValidType_ ();
210 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
216 AssertRepValidType_ ();
218 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
219 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
221 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
222 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
226 AssertRepValidType_ ();
228#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
229 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
230 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
231 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
235 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
236 this->reserve (src.size ());
238 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
239 AssertRepValidType_ ();
242 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
243 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
245 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
249 AssertRepValidType_ ();
251 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
252 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
262 AssertRepValidType_ ();
264 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
265 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
267 ITERATOR_OF_ADDABLE&& end)
268 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
276 AssertRepValidType_ ();
278 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
279 inline void Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
282 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...
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY same as qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an Array-based concrete implementation of the M...
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 void reserve(size_t slotsAlloced)
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,...