Stroika Library 3.0d23
 
Loading...
Searching...
No Matches
Association_LinkedList.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. All rights reserved
3 */
4#include "Stroika/Foundation/Containers/DataStructures/LinkedList.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8
10
11 /*
12 ********************************************************************************
13 ********* Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Rep_*************
14 ********************************************************************************
15 */
16 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
17 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_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>> {
20 private:
21 using inherited = IImplRepBase_;
22
23 public:
24 static_assert (not is_reference_v<KEY_EQUALS_COMPARER>);
25
26 public:
27 Rep_ (const KEY_EQUALS_COMPARER& keyEqualsComparer)
28 : fKeyEqualsComparer_{keyEqualsComparer}
29 {
30 }
31 Rep_ (const Rep_& from) = default;
32
33 public:
34 nonvirtual Rep_& operator= (const Rep_&) = delete;
35
36 private:
37 //[ RUN ] Foundation_Containers_Association.Association_LinkedList
38 // unknown file: error: SEH exception with code 0xc0000005 thrown in the test body.
39 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
40
41 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
42 public:
43 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
44 {
46 return Memory::MakeSharedPtr<Rep_> (*this);
47 }
48 virtual Iterator<value_type> MakeIterator () const override
49 {
51 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
52 }
53 virtual size_t size () const override
54 {
56 return fData_.size ();
57 }
58 virtual bool empty () const override
59 {
61 return fData_.empty ();
62 }
63 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
64 {
66 fData_.Apply (doToElement);
67 }
68 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
69 [[maybe_unused]] Execution::SequencePolicy seq) const override
70 {
72 if (auto i = fData_.Find (that)) {
73 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, i)};
74 }
76 return nullptr;
77 }
78
79 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
80 public:
81 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
82 {
84 return fKeyEqualsComparer_;
85 }
86 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
87 {
89 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
90 }
91 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator ([[maybe_unused]] Iterator<value_type>* i) const override
92 {
94 auto result = Memory::MakeSharedPtr<Rep_> (*this);
95 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
96 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
97 i->Refresh (); // reflect updated rep
98 return result;
99 }
100 virtual Iterable<mapped_type> Lookup (ArgByValueType<KEY_TYPE> key) const override
101 {
103 vector<mapped_type> result;
104 for (typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
105 if (fKeyEqualsComparer_ (it->fKey, key)) {
106 result.push_back (it->fValue);
107 }
108 }
109 return Iterable<mapped_type>{move (result)};
110 }
111 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<mapped_type> newElt) override
112 {
114 fData_.push_front (value_type{key, newElt}); // cheaper to prepend, and order doesn't matter
115 fChangeCounts_.PerformedChange ();
116 }
117 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
118 {
120 for (typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
121 if (fKeyEqualsComparer_ (it->fKey, key)) {
122 fData_.Remove (it);
123 fChangeCounts_.PerformedChange ();
124 return true;
125 }
126 }
127 return false;
128 }
129 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
130 {
132 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
133 if (nextI == nullptr) {
134 fData_.Remove (mir.fIterator);
135 fChangeCounts_.PerformedChange ();
136 }
137 else {
138 auto ret = fData_.erase (mir.fIterator);
139 fChangeCounts_.PerformedChange ();
140 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
141 }
142 }
143 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
144 {
146 auto dataStructureIterator = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator;
147 fData_.PeekAt (dataStructureIterator)->fValue = newValue;
148 fChangeCounts_.PerformedChange ();
149 if (nextI != nullptr) {
150 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, dataStructureIterator.GetUnderlyingIteratorRep ())};
151 }
152 }
153
154 private:
155 using DataStructureImplType_ = DataStructures::LinkedList<value_type>;
156 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
157
158 private:
159 DataStructureImplType_ fData_;
160 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
161 };
162
163 /*
164 ********************************************************************************
165 ************* Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE> **************
166 ********************************************************************************
167 */
168 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
170 : Association_LinkedList{equal_to<KEY_TYPE>{}}
171 {
172 AssertRepValidType_ ();
173 }
174 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
175 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
176 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer)
177 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<KEY_EQUALS_COMPARER>>> (keyEqualsComparer)}
178 {
179 AssertRepValidType_ ();
180 }
181 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
182 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
183 : Association_LinkedList{}
184 {
185 this->AddAll (src);
186 AssertRepValidType_ ();
187 }
188 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
189 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
190 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer,
191 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
192 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
193 {
194 this->AddAll (src);
195 AssertRepValidType_ ();
196 }
197#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
198 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
199 template <IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
200 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>>)
202 : Association_LinkedList{}
203 {
204 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
205 AssertRepValidType_ ();
206 }
207#endif
208 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
209 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IIterableOfTo<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERABLE_OF_ADDABLE>
210 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
211 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
212 {
213 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
214 AssertRepValidType_ ();
215 }
216 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
217 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
218 Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
219 : Association_LinkedList{}
220 {
221 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
222 AssertRepValidType_ ();
223 }
224 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
225 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER, IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
227 ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
228 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
229 {
230 this->AddAll (start, end);
231 AssertRepValidType_ ();
232 }
233 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
234 inline void Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
235 {
237 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
238 }
239 }
240
241}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:49
#define AssertNotReached()
Definition Assertions.h:356
#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...
Definition StdCompat.h:445
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCBUGGY same as qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
Definition StdCompat.h:454
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.
Definition Iterable.inl:303
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:309
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'.
Definition Iterable.inl:297
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...