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);
62 virtual size_t size ()
const override
65 return fData_.size ();
67 virtual bool empty ()
const override
70 return fData_.empty ();
81 if (
auto i = fData_.Find (
that)) {
89 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
92 return fKeyEqualsComparer_;
97 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
103 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
104 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
105 result->fData_.MoveIteratorHereAfterClone (&
mir.fIterator, &fData_);
112 for (
typename DataStructureImplType_::ForwardIterator
it{&fData_};
not it.AtEnd (); ++
it) {
113 if (fKeyEqualsComparer_ (
it->fKey,
key)) {
114 if (
item !=
nullptr) {
120 if (
item !=
nullptr) {
128 for (
typename DataStructureImplType_::ForwardIterator
it{&fData_};
not it.AtEnd (); ++
it) {
129 if (fKeyEqualsComparer_ (
it->fKey,
key)) {
132 fData_[
it.CurrentIndex ()].fValue = newElt;
133 fChangeCounts_.PerformedChange ();
143 fData_.push_back (value_type{
key, newElt});
144 fChangeCounts_.PerformedChange ();
150 for (
typename DataStructureImplType_::ForwardIterator
it{&fData_};
not it.AtEnd (); ++
it) {
151 if (fKeyEqualsComparer_ (
it->fKey,
key)) {
153 fChangeCounts_.PerformedChange ();
162 auto&
mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
163 if (
nextI ==
nullptr) {
164 fData_.Remove (
mir.fIterator);
165 fChangeCounts_.PerformedChange ();
168 auto retI = fData_.erase (
mir.fIterator);
169 fChangeCounts_.PerformedChange ();
177 if (
nextI !=
nullptr) {
178 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
180 fData_.PeekAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ())->fValue =
newValue;
181 fChangeCounts_.PerformedChange ();
182 if (
nextI !=
nullptr) {
188 using DataStructureImplType_ = DataStructures::Array<value_type>;
189 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
192 DataStructureImplType_ fData_;
204 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
208 AssertRepValidType_ ();
210 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
211 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
212 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
213 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
215 AssertRepValidType_ ();
217 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
223 AssertRepValidType_ ();
225 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
226 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
228 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
229 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
233 AssertRepValidType_ ();
235#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
236 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
237 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
238 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
242 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
243 this->reserve (src.size ());
245 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
246 AssertRepValidType_ ();
249 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
250 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
252 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
256 AssertRepValidType_ ();
258 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
259 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
269 AssertRepValidType_ ();
271 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
272 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
274 ITERATOR_OF_ADDABLE&& end)
275 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
283 AssertRepValidType_ ();
285 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
286 inline void Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
289 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)
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,...