Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
Association_LinkedList.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. 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 [[no_unique_address]] const KEY_EQUALS_COMPARER fKeyEqualsComparer_;
38
39 // Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep overrides
40 public:
41 virtual shared_ptr<typename Iterable<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>::_IRep> Clone () const override
42 {
44 return Memory::MakeSharedPtr<Rep_> (*this);
45 }
46 virtual Iterator<value_type> MakeIterator () const override
47 {
49 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
50 }
51 virtual size_t size () const override
52 {
54 return fData_.size ();
55 }
56 virtual bool empty () const override
57 {
59 return fData_.empty ();
60 }
61 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
62 {
64 fData_.Apply (doToElement);
65 }
66 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
67 [[maybe_unused]] Execution::SequencePolicy seq) const override
68 {
70 if (auto i = fData_.Find (that)) {
71 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, i)};
72 }
74 return nullptr;
75 }
76
77 // Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep overrides
78 public:
79 virtual KeyEqualsCompareFunctionType GetKeyEqualsComparer () const override
80 {
82 return fKeyEqualsComparer_;
83 }
84 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneEmpty () const override
85 {
87 return Memory::MakeSharedPtr<Rep_> (fKeyEqualsComparer_);
88 }
89 virtual shared_ptr<typename Association<KEY_TYPE, MAPPED_VALUE_TYPE>::_IRep> CloneAndPatchIterator ([[maybe_unused]] Iterator<value_type>* i) const override
90 {
92 auto result = Memory::MakeSharedPtr<Rep_> (*this);
93 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
95 i->Refresh (); // reflect updated rep
96 return result;
97 }
98 virtual Iterable<mapped_type> Lookup (ArgByValueType<KEY_TYPE> key) const override
99 {
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);
105 }
106 }
107 return Iterable<mapped_type>{move (result)};
108 }
109 virtual void Add (ArgByValueType<KEY_TYPE> key, ArgByValueType<mapped_type> newElt) override
110 {
112 fData_.push_front (value_type{key, newElt}); // cheaper to prepend, and order doesn't matter
113 fChangeCounts_.PerformedChange ();
114 }
115 virtual bool RemoveIf (ArgByValueType<KEY_TYPE> key) override
116 {
118 for (typename DataStructureImplType_::ForwardIterator it (&fData_); not it.Done (); ++it) {
119 if (fKeyEqualsComparer_ (it->fKey, key)) {
120 fData_.Remove (it);
121 fChangeCounts_.PerformedChange ();
122 return true;
123 }
124 }
125 return false;
126 }
127 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
128 {
130 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
131 if (nextI == nullptr) {
132 fData_.Remove (mir.fIterator);
133 fChangeCounts_.PerformedChange ();
134 }
135 else {
136 auto ret = fData_.erase (mir.fIterator);
137 fChangeCounts_.PerformedChange ();
138 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
139 }
140 }
141 virtual void Update (const Iterator<value_type>& i, ArgByValueType<mapped_type> newValue, Iterator<value_type>* nextI) override
142 {
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 ())};
149 }
150 }
151
152 private:
153 using DataStructureImplType_ = DataStructures::LinkedList<value_type>;
154 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
155
156 private:
157 DataStructureImplType_ fData_;
158 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
159 };
160
161 /*
162 ********************************************************************************
163 ************* Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE> **************
164 ********************************************************************************
165 */
166 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
168 : Association_LinkedList{equal_to<KEY_TYPE>{}}
169 {
170 AssertRepValidType_ ();
171 }
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)}
176 {
177 AssertRepValidType_ ();
178 }
179 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
180 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
181 : Association_LinkedList{}
182 {
183 this->AddAll (src);
184 AssertRepValidType_ ();
185 }
186 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
187 template <IEqualsComparer<KEY_TYPE> KEY_EQUALS_COMPARER>
188 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer,
189 const initializer_list<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>>& src)
190 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
191 {
192 this->AddAll (src);
193 AssertRepValidType_ ();
194 }
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{}
201 {
202 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
203 AssertRepValidType_ ();
204 }
205#endif
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>
208 inline Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (KEY_EQUALS_COMPARER&& keyEqualsComparer, ITERABLE_OF_ADDABLE&& src)
209 : Association_LinkedList{forward<KEY_EQUALS_COMPARER> (keyEqualsComparer)}
210 {
211 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
212 AssertRepValidType_ ();
213 }
214 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
215 template <IInputIterator<KeyValuePair<KEY_TYPE, MAPPED_VALUE_TYPE>> ITERATOR_OF_ADDABLE>
216 Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::Association_LinkedList (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
217 : Association_LinkedList{}
218 {
219 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
220 AssertRepValidType_ ();
221 }
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)}
227 {
228 this->AddAll (start, end);
229 AssertRepValidType_ ();
230 }
231 template <typename KEY_TYPE, typename MAPPED_VALUE_TYPE>
232 inline void Association_LinkedList<KEY_TYPE, MAPPED_VALUE_TYPE>::AssertRepValidType_ () const
233 {
235 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMemeber
236 }
237 }
238
239}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
#define AssertNotReached()
Definition Assertions.h:355
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:300
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:306
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:294
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...