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 Mapping_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;
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 ();
64 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
67 fData_.Apply (doToElement);
69 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
73 if (
auto iLink = fData_.Find (that)) {
74 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iLink)};
81 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer ()
const override
84 return fKeyEqualsComparer_;
86 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty ()
const override
89 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
91 virtual shared_ptr<typename Mapping<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator ([[maybe_unused]] Iterator<value_type>* i)
const override
94 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
95 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
96 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
100 virtual bool Lookup (ArgByValueType<KEY_TYPE> key, optional<MAPPED_VALUE_TYPE>* item)
const override
103 for (
typename DataStructures::LinkedList<value_type>::ForwardIterator it{&fData_}; not it.Done (); ++it) {
104 if (fKeyEqualsComparer_ (it->fKey, key)) {
105 if (item !=
nullptr) {
111 if (item !=
nullptr) {
116 virtual bool Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<MAPPED_VALUE_TYPE> newElt,
AddReplaceMode addReplaceMode)
override
119 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
120 if (fKeyEqualsComparer_ (it->fKey, key)) {
121 switch (addReplaceMode) {
123 fData_.SetAt (it, value_type{key, newElt});
124 fChangeCounts_.PerformedChange ();
134 fData_.push_front (value_type{key, newElt});
135 fChangeCounts_.PerformedChange ();
138 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key)
override
141 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
142 if (fKeyEqualsComparer_ (it->fKey, key)) {
144 fChangeCounts_.PerformedChange ();
150 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
153 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
154 if (nextI ==
nullptr) {
155 fData_.Remove (mir.fIterator);
156 fChangeCounts_.PerformedChange ();
159 auto ret = fData_.erase (mir.fIterator);
160 fChangeCounts_.PerformedChange ();
161 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
164 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI)
override
167 auto dataStructureIterator = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator;
168 fData_.PeekAt (dataStructureIterator)->fValue = newValue;
169 fChangeCounts_.PerformedChange ();
170 if (nextI !=
nullptr) {
171 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, dataStructureIterator.GetUnderlyingIteratorRep ())};
176 using DataStructureImplType_ = DataStructures::LinkedList<value_type>;
177 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
180 DataStructureImplType_ fData_;
189 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
193 AssertRepValidType_ ();
195 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
196 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
197 inline Mapping_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Mapping_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer)
198 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
200 AssertRepValidType_ ();
202 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
204 : Mapping_LinkedList{}
207 AssertRepValidType_ ();
209 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
210 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
212 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
213 : Mapping_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
216 AssertRepValidType_ ();
218#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
219 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
220 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
221 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Mapping_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>>)
223 : Mapping_LinkedList{}
225 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
226 AssertRepValidType_ ();
229 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
230 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
232 : Mapping_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
234 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
235 AssertRepValidType_ ();
237 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
238 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
240 : Mapping_LinkedList{}
242 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
243 AssertRepValidType_ ();
245 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
246 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
248 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
249 : Mapping_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
251 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
252 AssertRepValidType_ ();
254 template <
typename KEY_TYPE,
typename MAPPED_VALUE_TYPE>
255 inline void Mapping_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ ()
const
258 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()
#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_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE, TRAITS> is an LinkedList-based concrete implementatio...
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).
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,...