Stroika Library 3.0d20
 
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 =
24 Private::ArrayBasedContainerRepImpl<typename Set_Array<T>::template Rep_<EQUALS_COMPARER>, typename Set_Array<T>::IImplRepBase_>;
25
26 public:
27 Rep_ (const EQUALS_COMPARER& equalsComparer)
28 : fEqualsComparer_{equalsComparer}
29 {
30 }
31 Rep_ (const Rep_& from) = default;
32
33 private:
34 [[no_unique_address]] EQUALS_COMPARER fEqualsComparer_;
35
36 public:
37 nonvirtual Rep_& operator= (const Rep_&) = delete;
38
39 // Iterable<T>::_IRep overrides
40 public:
41 virtual shared_ptr<typename Iterable<T>::_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_> (&fChangeCounts_, i)};
72 }
73 return nullptr;
74 }
75
76 // Set<T>::_IRep overrides
77 public:
78 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
79 {
81 return fEqualsComparer_;
82 }
83 virtual shared_ptr<typename Set<T>::_IRep> CloneEmpty () const override
84 {
86 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_); // copy comparers, but not data
87 }
88 virtual shared_ptr<typename Set<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
89 {
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 bool Equals (const typename Iterable<value_type>::_IRep& rhs) const override
99 {
101 return this->_Equals_Reference_Implementation (rhs);
102 }
103 virtual bool Lookup (ArgByValueType<value_type> item, optional<value_type>* oResult, Iterator<value_type>* iResult) const override
104 {
106 if (auto l = fData_.Find ([this, item] (ArgByValueType<value_type> i) { return fEqualsComparer_ (i, item); })) {
107 if (oResult != nullptr) {
108 *oResult = *l;
109 }
110 if (iResult != nullptr) {
111 *iResult = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, l)};
112 }
113 return true;
114 }
115 return false;
116 }
117 virtual void Add (ArgByValueType<value_type> item) override
118 {
120 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
121 if (fEqualsComparer_ (*it, item)) {
122 return;
123 }
124 }
125 fData_.push_back (item); // order meaningless for set, append cheapest way for array
126 fChangeCounts_.PerformedChange ();
127 }
128 virtual bool RemoveIf (ArgByValueType<value_type> item) override
129 {
131 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
132 if (fEqualsComparer_ (*it, item)) {
133 fData_.Remove (it);
134 fChangeCounts_.PerformedChange ();
135 return true;
136 }
137 }
138 return false;
139 }
140 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
141 {
142 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>); // else must do slightly differently
143 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
144 if (nextI == nullptr) {
145 fData_.Remove (mir.fIterator);
146 fChangeCounts_.PerformedChange ();
147 }
148 else {
149 auto retI = fData_.erase (mir.fIterator);
150 fChangeCounts_.PerformedChange ();
151 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
152 }
153 }
154
155 private:
156 using DataStructureImplType_ = DataStructures::Array<value_type>;
157 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
158
159 private:
160 DataStructureImplType_ fData_;
161 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
162
163 private:
164 friend inherited;
165 };
166
167 /*
168 ********************************************************************************
169 ******************************** Set_Array<T> **********************************
170 ********************************************************************************
171 */
172 template <typename T>
174 : Set_Array{equal_to<value_type>{}}
175 {
176 AssertRepValidType_ ();
177 }
178 template <typename T>
179 template <IEqualsComparer<T> EQUALS_COMPARER>
180 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer)
181 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<EQUALS_COMPARER>>> (forward<EQUALS_COMPARER> (equalsComparer))}
182 {
183 AssertRepValidType_ ();
184 }
185 template <typename T>
186 inline Set_Array<T>::Set_Array (const initializer_list<value_type>& src)
187 : Set_Array{}
188 {
189 this->AddAll (src);
190 AssertRepValidType_ ();
191 }
192 template <typename T>
193 template <IEqualsComparer<T> EQUALS_COMPARER>
194 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, const initializer_list<value_type>& src)
195 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
196 {
197 this->AddAll (src);
198 AssertRepValidType_ ();
199 }
200#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
201 template <typename T>
202 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
203 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Set_Array<T>>)
204 inline Set_Array<T>::Set_Array (ITERABLE_OF_ADDABLE&& src)
205 : Set_Array{}
206 {
207 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
208 AssertRepValidType_ ();
209 }
210#endif
211 template <typename T>
212 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
213 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, ITERABLE_OF_ADDABLE&& src)
214 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
215 {
216 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
217 AssertRepValidType_ ();
218 }
219 template <typename T>
220 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
221 inline Set_Array<T>::Set_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
222 : Set_Array{}
223 {
224 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
225 AssertRepValidType_ ();
226 }
227 template <typename T>
228 template <IEqualsComparer<T> EQUALS_COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
229 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
230 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
231 {
232 this->AddAll (start, end);
233 AssertRepValidType_ ();
234 }
235 template <typename T>
236 inline void Set_Array<T>::AssertRepValidType_ () const
237 {
239 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
240 }
241 }
242
243}
#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:302
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:308
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:296
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...