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_>;
25 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
28 Rep_ (
const KEY_EQUALS_COMPARER& keyEqualsComparer)
29 : fKeyEqualsComparer_{keyEqualsComparer}
32 Rep_ (
const Rep_& from) =
default;
35 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
38 [[no_unique_address]]
const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
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
55 return fData_.size ();
57 virtual bool empty ()
const override
60 return fData_.empty ();
65 fData_.Apply (doToElement, seq);
67 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
71 if (
auto i = fData_.Find (that)) {
72 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
79 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
82 return fKeyEqualsComparer_;
84 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
87 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
89 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
93 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
94 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
95 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
99 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item)
const override
102 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
103 if (fKeyEqualsComparer_ (it->fKey, key)) {
104 if (item !=
nullptr) {
110 if (item !=
nullptr) {
115 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt,
AddReplaceMode addReplaceMode)
override
118 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
119 if (fKeyEqualsComparer_ (it->fKey, key)) {
120 switch (addReplaceMode) {
122 fData_[it.CurrentIndex ()].fValue = newElt;
123 fChangeCounts_.PerformedChange ();
133 fData_.push_back (value_type{key, newElt});
134 fChangeCounts_.PerformedChange ();
137 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
140 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
141 if (fKeyEqualsComparer_ (it->fKey, key)) {
142 fData_.RemoveAt (it.CurrentIndex ());
143 fChangeCounts_.PerformedChange ();
149 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
152 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
153 if (nextI ==
nullptr) {
154 fData_.Remove (mir.fIterator);
155 fChangeCounts_.PerformedChange ();
158 auto retI = fData_.erase (mir.fIterator);
159 fChangeCounts_.PerformedChange ();
160 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
163 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
166 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
167 if (nextI !=
nullptr) {
168 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
170 fData_.PeekAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ())->fValue = newValue;
171 fChangeCounts_.PerformedChange ();
172 if (nextI !=
nullptr) {
173 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
178 using DataStructureImplType_ = DataStructures::Array<value_type>;
179 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
182 DataStructureImplType_ fData_;
183 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
194 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
198 AssertRepValidType_ ();
200 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
201 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
202 inline Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
203 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
205 AssertRepValidType_ ();
207 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
213 AssertRepValidType_ ();
215 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
216 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
218 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
219 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
223 AssertRepValidType_ ();
225#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
226 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
227 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
228 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
232 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
233 this->reserve (src.size ());
235 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
236 AssertRepValidType_ ();
239 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
240 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
242 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
245 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
246 AssertRepValidType_ ();
248 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
249 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
253 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
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 <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
264 ITERATOR_OF_ADDABLE&& end)
265 : Mapping_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
267 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
272 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
273 AssertRepValidType_ ();
275 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
276 inline void Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
279 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()
Mapping_Array<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an Array-based concrete implementation of the M...
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,...