7#include "Stroika/Foundation/Containers/DataStructures/Array.h"
9#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
18 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
19 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (IEqualsComparer<KEY_TYPE>) KEY_EQUALS_COMPARER>
20 class Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_
21 :
public Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>,
22 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_EQUALS_COMPARER>> {
24 using inherited = Private::ArrayBasedContainerRepImpl<Rep_<KEY_EQUALS_COMPARER>, IImplRepBase_>;
27 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
30 Rep_ (
const KEY_EQUALS_COMPARER& keyEqualsComparer)
31 : fKeyEqualsComparer_{keyEqualsComparer}
34 Rep_ (
const Rep_& from) =
default;
37 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
40 [[no_unique_address]]
const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
44 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone ()
const override
47 return Memory::MakeSharedPtr<Rep_> (*
this);
49 virtual Iterator<value_type>
MakeIterator ()
const override
52 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
54 virtual size_t size ()
const override
57 return fData_.size ();
59 virtual bool empty ()
const override
62 return fData_.empty ();
67 fData_.Apply (doToElement, seq);
69 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
73 if (
auto i = fData_.Find (that)) {
74 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
81 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
84 return fKeyEqualsComparer_;
86 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
89 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
91 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
95 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
96 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
97 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
101 virtual Iterable<mapped_type>
Lookup (ArgByValueType<KEY_TYPE> key)
const override
104 vector<mapped_type> result;
105 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
106 if (fKeyEqualsComparer_ (it->fKey, key)) {
107 result.push_back (it->fValue);
110 return Iterable<mapped_type>{move (result)};
112 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt)
override
115 fData_.push_back (value_type{key, newElt});
116 fChangeCounts_.PerformedChange ();
118 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
121 for (
typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
122 if (fKeyEqualsComparer_ (it->fKey, key)) {
123 fData_.RemoveAt (it.CurrentIndex ());
124 fChangeCounts_.PerformedChange ();
130 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
133 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
134 if (nextI ==
nullptr) {
135 fData_.Remove (mir.fIterator);
136 fChangeCounts_.PerformedChange ();
139 auto retI = fData_.erase (mir.fIterator);
140 fChangeCounts_.PerformedChange ();
141 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
144 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
147 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
148 if (nextI !=
nullptr) {
149 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
151 fData_.PeekAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ())->fValue = newValue;
152 fChangeCounts_.PerformedChange ();
153 if (nextI !=
nullptr) {
154 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
159 using DataStructureImplType_ = DataStructures::Array<value_type>;
160 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
163 DataStructureImplType_ fData_;
164 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
175 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
179 AssertRepValidType_ ();
181 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
182 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
183 inline Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_Array (KEY_EQUALS_COMPARER&& keyEqualsComparer)
184 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
186 AssertRepValidType_ ();
188 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
190 : Association_Array{}
194 AssertRepValidType_ ();
196 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
197 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
199 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
200 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
204 AssertRepValidType_ ();
206#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
207 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
208 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
209 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>>)
211 : Association_Array{}
213 if constexpr (Common::IHasSizeMethod<ITERABLE_OF_ADDABLE>) {
214 this->reserve (src.size ());
216 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
217 AssertRepValidType_ ();
220 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
221 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
223 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
226 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
227 AssertRepValidType_ ();
229 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
230 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
232 : Association_Array{}
234 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
239 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
240 AssertRepValidType_ ();
242 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
243 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
245 ITERATOR_OF_ADDABLE&& end)
246 : Association_Array{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
248 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
253 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
254 AssertRepValidType_ ();
256 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
257 inline void Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
260 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)
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 Update(const Iterator< value_type > &i, ArgByValueType< mapped_type > newValue, Iterator< value_type > *nextI=nullptr)
nonvirtual void Add(ArgByValueType< key_type > key, ArgByValueType< mapped_type > newElt)
nonvirtual void AddAll(ITERABLE_OF_ADDABLE &&items)
nonvirtual Traversal::Iterable< mapped_type > Lookup(ArgByValueType< key_type > key) const
Return an Iterable<mapped_type> of all the associated items (can be empty if none)....
Association_Array<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an Array-based concrete implementation of t...
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'.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...