4#include "Stroika/Foundation/Containers/DataStructures/LinkedList.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
16 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (IEqualsComparer<KEY_TYPE>) KEY_EQUALS_COMPARER>
18 class Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_ :
public IImplRepBase_,
19 public Memory::UseBlockAllocationIfAppropriate<Rep_<KEY_EQUALS_COMPARER>> {
21 using inherited = IImplRepBase_;
24 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
27 Rep_ (
const KEY_EQUALS_COMPARER& keyEqualsComparer)
28 : fKeyEqualsComparer_{keyEqualsComparer}
31 Rep_ (
const Rep_& from) =
default;
34 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
37 [[no_unique_address]]
const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
41 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone ()
const override
44 return Memory::MakeSharedPtr<Rep_> (*
this);
46 virtual Iterator<value_type>
MakeIterator ()
const override
49 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
51 virtual size_t size ()
const override
54 return fData_.size ();
56 virtual bool empty ()
const override
59 return fData_.empty ();
61 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
64 fData_.Apply (doToElement);
66 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
70 if (
auto i = fData_.Find (that)) {
71 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, i)};
79 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
82 return fKeyEqualsComparer_;
84 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
87 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
89 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator ([[maybe_unused]] Iterator<value_type>* i)
const override
92 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
93 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
98 virtual Iterable<mapped_type>
Lookup (ArgByValueType<KEY_TYPE> key)
const override
101 vector<mapped_type> result;
102 for (
typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
103 if (fKeyEqualsComparer_ (it->fKey, key)) {
104 result.push_back (it->fValue);
107 return Iterable<mapped_type>{move (result)};
109 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<mapped_type> newElt)
override
112 fData_.push_front (value_type{key, newElt});
113 fChangeCounts_.PerformedChange ();
115 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
118 for (
typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
119 if (fKeyEqualsComparer_ (it->fKey, key)) {
121 fChangeCounts_.PerformedChange ();
127 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
130 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
131 if (nextI ==
nullptr) {
132 fData_.Remove (mir.fIterator);
133 fChangeCounts_.PerformedChange ();
136 auto ret = fData_.erase (mir.fIterator);
137 fChangeCounts_.PerformedChange ();
138 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
141 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
144 auto dataStructureIterator = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator;
145 fData_.PeekAt (dataStructureIterator)->fValue = newValue;
146 fChangeCounts_.PerformedChange ();
147 if (nextI !=
nullptr) {
148 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, dataStructureIterator.GetUnderlyingIteratorRep ())};
153 using DataStructureImplType_ = DataStructures::LinkedList<value_type>;
154 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
157 DataStructureImplType_ fData_;
158 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
166 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
170 AssertRepValidType_ ();
172 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
173 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
174 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer)
175 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
177 AssertRepValidType_ ();
179 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
181 : Association_LinkedList{}
184 AssertRepValidType_ ();
186 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
187 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
189 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
190 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
193 AssertRepValidType_ ();
195#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
196 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
197 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
198 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>>)
200 : Association_LinkedList{}
202 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
203 AssertRepValidType_ ();
206 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
207 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
209 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
211 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
212 AssertRepValidType_ ();
214 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
215 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
217 : Association_LinkedList{}
219 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
220 AssertRepValidType_ ();
222 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
223 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
225 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
226 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
229 AssertRepValidType_ ();
231 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
232 inline void Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
235 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 AssertNotReached()
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_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an LinkedList-based concrete implement...
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,...