Stroika Library 3.0d24
 
Loading...
Searching...
No Matches
Set_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. 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 qStroika_ATTRIBUTE_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 // MakeIterator () walks fData_ from 0, so storage order IS iteration order (Set<T> promises no
52 // particular order, but the span must match whatever this rep's iterator yields, and it does).
53 virtual optional<span<const value_type>> PeekContiguousStorage () const override
54 {
56 return span<const value_type>{fData_.data (), fData_.size ()};
57 }
58 virtual size_t size () const override
59 {
61 return fData_.size ();
62 }
63 virtual bool empty () const override
64 {
66 return fData_.empty ();
67 }
68 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
69 {
71 fData_.Apply (doToElement);
72 }
73 virtual Iterator<value_type> Find ([[maybe_unused]] bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
75 {
77 if (auto i = fData_.Find (that)) {
78 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
79 }
80 return nullptr;
81 }
82
83 // Set<T>::_IRep overrides
84 public:
85 virtual ElementEqualityComparerType GetElementEqualsComparer () const override
86 {
88 return fEqualsComparer_;
89 }
90 virtual shared_ptr<typename Set<T>::_IRep> CloneEmpty () const override
91 {
93 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_); // copy comparers, but not data
94 }
95 virtual shared_ptr<typename Set<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
96 {
99 auto result = Memory::MakeSharedPtr<Rep_> (*this);
100 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
101 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
102 i->Refresh (); // reflect updated rep
103 return result;
104 }
105 virtual bool Equals (const typename Iterable<value_type>::_IRep& rhs) const override
106 {
108 return this->_Equals_Reference_Implementation (rhs);
109 }
111 {
113 if (auto l = fData_.Find ([this, item] (ArgByValueType<value_type> i) { return fEqualsComparer_ (i, item); })) {
114 if (oResult != nullptr) {
115 *oResult = *l;
116 }
117 if (iResult != nullptr) {
119 }
120 return true;
121 }
122 return false;
123 }
124 virtual void Add (ArgByValueType<value_type> item) override
125 {
127 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.AtEnd (); ++it) {
128 if (fEqualsComparer_ (*it, item)) {
129 return;
130 }
131 }
132 fData_.push_back (item); // order meaningless for set, append cheapest way for array
133 fChangeCounts_.PerformedChange ();
134 }
135 virtual bool RemoveIf (ArgByValueType<value_type> item) override
136 {
138 for (typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.AtEnd (); ++it) {
139 if (fEqualsComparer_ (*it, item)) {
140 fData_.Remove (it);
141 fChangeCounts_.PerformedChange ();
142 return true;
143 }
144 }
145 return false;
146 }
147 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
148 {
149 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>); // else must do slightly differently
150 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
151 if (nextI == nullptr) {
152 fData_.Remove (mir.fIterator);
153 fChangeCounts_.PerformedChange ();
154 }
155 else {
156 auto retI = fData_.erase (mir.fIterator);
157 fChangeCounts_.PerformedChange ();
159 }
160 }
161
162 private:
163 using DataStructureImplType_ = DataStructures::Array<value_type>;
164 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
165
166 private:
167 DataStructureImplType_ fData_;
168 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
169
170 private:
171 friend inherited;
172 };
173
174 /*
175 ********************************************************************************
176 ******************************** Set_Array<T> **********************************
177 ********************************************************************************
178 */
179 template <typename T>
181 : Set_Array{equal_to<value_type>{}}
182 {
183 AssertRepValidType_ ();
184 }
185 template <typename T>
186 template <IEqualsComparer<T> EQUALS_COMPARER>
187 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer)
188 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<EQUALS_COMPARER>>> (forward<EQUALS_COMPARER> (equalsComparer))}
189 {
190 AssertRepValidType_ ();
191 }
192 template <typename T>
193 inline Set_Array<T>::Set_Array (const initializer_list<value_type>& src)
194 : Set_Array{}
195 {
196 this->AddAll (src);
197 AssertRepValidType_ ();
198 }
199 template <typename T>
200 template <IEqualsComparer<T> EQUALS_COMPARER>
201 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, const initializer_list<value_type>& src)
202 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
203 {
204 this->AddAll (src);
205 AssertRepValidType_ ();
206 }
207#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
208 template <typename T>
209 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
210 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Set_Array<T>>)
211 inline Set_Array<T>::Set_Array (ITERABLE_OF_ADDABLE&& src)
212 : Set_Array{}
213 {
214 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
215 AssertRepValidType_ ();
216 }
217#endif
218 template <typename T>
219 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
220 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, ITERABLE_OF_ADDABLE&& src)
221 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
222 {
224 AssertRepValidType_ ();
225 }
226 template <typename T>
227 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
228 inline Set_Array<T>::Set_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
229 : Set_Array{}
230 {
232 AssertRepValidType_ ();
233 }
234 template <typename T>
235 template <IEqualsComparer<T> EQUALS_COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
236 inline Set_Array<T>::Set_Array (EQUALS_COMPARER&& equalsComparer, ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
237 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
238 {
239 this->AddAll (start, end);
240 AssertRepValidType_ ();
241 }
242 template <typename T>
243 inline void Set_Array<T>::AssertRepValidType_ () const
244 {
246 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{this}; // for side-effect of AssertMember
247 }
248 }
249
250}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:49
#define RequireNotNull(p)
Definition Assertions.h:348
bool Equals(const T *lhs, const T *rhs)
strcmp or wsccmp() as appropriate == 0
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS
qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS - used for the attribute [[no_unique_address]]
Definition StdCompat.h:433
#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:443
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:538
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:217
nonvirtual bool RemoveIf(ArgByValueType< value_type > item)
Definition Set.inl:229
nonvirtual void Add(ArgByValueType< value_type > item)
Definition Set.inl:138
nonvirtual void AddAll(ITERATOR_OF_ADDABLE &&start, ITERATOR_OF_ADDABLE2 &&end)
unique_lock< AssertExternallySynchronizedChecker > WriteContext
Instantiate AssertExternallySynchronizedChecker::WriteContext to designate an area of code where prot...
shared_lock< const AssertExternallySynchronizedChecker > ReadContext
Instantiate AssertExternallySynchronizedChecker::ReadContext to designate an area of code where prote...
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that) const
Run the argument bool-returning function (or lambda) on the elements of the container,...
nonvirtual CONTAINER_OF_T As(CONTAINER_OF_T_CONSTRUCTOR_ARGS... args) const
nonvirtual size_t size() const
Returns the number of items contained.
Definition Iterable.inl:311
nonvirtual void Apply(const function< void(ArgByValueType< T > item)> &doToElement) const
Run the argument function (or lambda) on each element of the container.
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:317
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:305
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...