Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
Set_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#include "Stroika/Foundation/Containers/DataStructures/Array.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
9
11
12 /*
13 ********************************************************************************
14 ******************************** Set_Array<T>::Rep_ ****************************
15 ********************************************************************************
16 */
17 template <typename T>
18 template <qCompilerAndStdLib_ConstraintDiffersInTemplateRedeclaration_BWA (IEqualsComparer<T>) EQUALS_COMPARER>
19 class Set_Array<T>::Rep_
20 : public Private::ArrayBasedContainerRepImpl<Set_Array<T>::Rep_<EQUALS_COMPARER>, typename Set_Array<T>::IImplRepBase_>,
21 public Memory::UseBlockAllocationIfAppropriate<Rep_<EQUALS_COMPARER>> {
22 private:
23 using inherited = Private::ArrayBasedContainerRepImpl<Set_Array<T>::Rep_<EQUALS_COMPARER>, typename Set_Array<T>::IImplRepBase_>;
24
25 public:
26 Rep_ (const EQUALS_COMPARER& equalsComparer)
27 : fEqualsComparer_{equalsComparer}
28 {
29 }
30 Rep_ (const Rep_& from) = default;
31
32 private:
33 [[no_unique_address]] EQUALS_COMPARER fEqualsComparer_;
34
35 public:
36 nonvirtual Rep_& operator= (const Rep_&) = delete;
37
38 // Iterable<T>::_IRep overrides
39 public:
40 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
41 {
43 return Memory::MakeSharedPtr<Rep_> (*this);
44 }
45 virtual Iterator<value_type> MakeIterator () const override
46 {
48 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
49 }
50 virtual size_t size () const override
51 {
53 return fData_.size ();
54 }
55 virtual bool empty () const override
56 {
58 return fData_.empty ();
59 }
60 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
61 {
63 fData_.Apply (doToElement);
64 }
65 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
66 [[maybe_unused]] Execution::SequencePolicy seq) const override
67 {
69 if (auto i = fData_.Find (that)) {
70 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
71 }
72 return nullptr;
73 }
74
75 // Set<T>::_IRep overrides
76 public:
77 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
78 {
80 return fEqualsComparer_;
81 }
82 virtual shared_ptr<typename Set<T>::_IRep> CloneEmpty () const override
83 {
85 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_); // copy comparers, but not data
86 }
87 virtual shared_ptr<typename Set<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
88 {
91 auto result = Memory::MakeSharedPtr<Rep_> (*this);
92 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
93 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
94 i->Refresh (); // reflect updated rep
95 return result;
96 }
97 virtual bool Equals (const typename Iterable<value_type>::_IRep& rhs) const override
98 {
100 return this->_Equals_Reference_Implementation (rhs);
101 }
102 virtual bool Lookup (ArgByValueType<value_type> item, optional<value_type>* oResult, Iterator<value_type>* iResult) const override
103 {
105 if (auto l = fData_.Find ([this, item] (ArgByValueType<value_type> i) { return fEqualsComparer_ (i, item); })) {
106 if (oResult != nullptr) {
107 *oResult = *l;
108 }
109 if (iResult != nullptr) {
110 *iResult = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, l)};
111 }
112 return true;
113 }
114 return false;
115 }
116 virtual void Add (ArgByValueType<value_type> item) override
117 {
119 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
120 if (fEqualsComparer_ (*it, item)) {
121 return;
122 }
123 }
124 fData_.push_back (item); // order meaningless for set, append cheapest way for array
125 fChangeCounts_.PerformedChange ();
126 }
127 virtual bool RemoveIf (ArgByValueType<value_type> item) override
128 {
130 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
131 if (fEqualsComparer_ (*it, item)) {
132 fData_.Remove (it);
133 fChangeCounts_.PerformedChange ();
134 return true;
135 }
136 }
137 return false;
138 }
139 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
140 {
141 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>); // else must do slightly differently
142 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
143 if (nextI == nullptr) {
144 fData_.Remove (mir.fIterator);
145 fChangeCounts_.PerformedChange ();
146 }
147 else {
148 auto retI = fData_.erase (mir.fIterator);
149 fChangeCounts_.PerformedChange ();
150 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
151 }
152 }
153
154 private:
155 using DataStructureImplType_ = DataStructures::Array<value_type>;
156 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
157
158 private:
159 DataStructureImplType_ fData_;
160 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
161
162 private:
163 friend inherited;
164 };
165
166 /*
167 ********************************************************************************
168 ******************************** Set_Array<T> **********************************
169 ********************************************************************************
170 */
171 template <typename T>
173 : Set_Array{equal_to<value_type>{}}
174 {
175 AssertRepValidType_ ();
176 }
177 template <typename T>
178 template <IEqualsComparer<T> EQUALS_COMPARER>
179 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer)
180 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<EQUALS_COMPARER>>> (forward<EQUALS_COMPARER> (equalsComparer))}
181 {
182 AssertRepValidType_ ();
183 }
184 template <typename T>
185 inline Set_Array<T>::Set_Array (const initializer_list<value_type>& src)
186 : Set_Array{}
187 {
188 this->AddAll (src);
189 AssertRepValidType_ ();
190 }
191 template <typename T>
192 template <IEqualsComparer<T> EQUALS_COMPARER>
193 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, const initializer_list<value_type>& src)
194 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
195 {
196 this->AddAll (src);
197 AssertRepValidType_ ();
198 }
199#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
200 template <typename T>
201 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
202 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Set_Array<T>>)
203 inline Set_Array<T>::Set_Array (ITERABLE_OF_ADDABLE&& src)
204 : Set_Array{}
205 {
206 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
207 AssertRepValidType_ ();
208 }
209#endif
210 template <typename T>
211 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
212 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, ITERABLE_OF_ADDABLE&& src)
213 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
214 {
215 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
216 AssertRepValidType_ ();
217 }
218 template <typename T>
219 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
220 inline Set_Array<T>::Set_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
221 : Set_Array{}
222 {
223 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
224 AssertRepValidType_ ();
225 }
226 template <typename T>
227 template <IEqualsComparer<T> EQUALS_COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
228 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
229 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
230 {
231 this->AddAll (start, end);
232 AssertRepValidType_ ();
233 }
234 template <typename T>
235 inline void Set_Array<T>::AssertRepValidType_ () const
236 {
238 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
239 }
240 }
241
242}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
#define RequireNotNull(p)
Definition Assertions.h:347
bool Equals(const T *lhs, const T *rhs)
strcmp or wsccmp() as appropriate == 0
Set_Array<T> is an Array-based concrete implementation of the Set<T> container pattern.
Definition Set_Array.h:32
nonvirtual optional< value_type > Lookup(ArgByValueType< value_type > item) const
Definition Set.inl:131
nonvirtual ElementEqualityComparerType GetElementEqualsComparer() const
Definition Set.inl:96
nonvirtual Set CloneEmpty() const
for return Set<T> { s->GetEqualsComparer(); } - except more efficient - clones settings/dynamic subty...
Definition Set.inl:503
nonvirtual void Remove(ArgByValueType< value_type > item)
Remove the item (given by value or iterator pointing to it) from the contain. The item MUST exist.
Definition Set.inl:182
nonvirtual bool RemoveIf(ArgByValueType< value_type > item)
Definition Set.inl:194
nonvirtual void Add(ArgByValueType< value_type > item)
Definition Set.inl:138
nonvirtual void AddAll(ITERATOR_OF_ADDABLE &&start, ITERATOR_OF_ADDABLE2 &&end)
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,...