4#include "Stroika/Foundation/Containers/DataStructures/Array.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
18 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_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>> {
24 Private::ArrayBasedContainerRepImpl<typename Set_Array<T>::template Rep_<EQUALS_COMPARER>,
typename Set_Array<T>::IImplRepBase_>;
27 Rep_ (
const EQUALS_COMPARER& equalsComparer)
28 : fEqualsComparer_{equalsComparer}
31 Rep_ (
const Rep_& from) =
default;
34 [[no_unique_address]] EQUALS_COMPARER fEqualsComparer_;
37 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
41 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
44 return Memory::MakeSharedPtr<Rep_> (*
this);
46 virtual Iterator<value_type>
MakeIterator ()
const override
49 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
51 virtual size_t size ()
const override
54 return fData_.size ();
56 virtual bool empty ()
const override
59 return fData_.empty ();
61 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
64 fData_.Apply (doToElement);
66 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
70 if (
auto i = fData_.Find (that)) {
71 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
81 return fEqualsComparer_;
83 virtual shared_ptr<typename Set<T>::_IRep>
CloneEmpty ()
const override
86 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_);
88 virtual shared_ptr<typename Set<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
92 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
93 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
94 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
98 virtual bool Equals (
const typename Iterable<value_type>::_IRep& rhs)
const override
101 return this->_Equals_Reference_Implementation (rhs);
103 virtual bool Lookup (ArgByValueType<value_type> item, optional<value_type>* oResult, Iterator<value_type>* iResult)
const override
106 if (
auto l = fData_.Find ([
this, item] (ArgByValueType<value_type> i) { return fEqualsComparer_ (i, item); })) {
107 if (oResult !=
nullptr) {
110 if (iResult !=
nullptr) {
111 *iResult = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, l)};
117 virtual void Add (ArgByValueType<value_type> item)
override
120 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
121 if (fEqualsComparer_ (*it, item)) {
125 fData_.push_back (item);
126 fChangeCounts_.PerformedChange ();
128 virtual bool RemoveIf (ArgByValueType<value_type> item)
override
131 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
132 if (fEqualsComparer_ (*it, item)) {
134 fChangeCounts_.PerformedChange ();
140 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
142 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>);
143 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
144 if (nextI ==
nullptr) {
145 fData_.Remove (mir.fIterator);
146 fChangeCounts_.PerformedChange ();
149 auto retI = fData_.erase (mir.fIterator);
150 fChangeCounts_.PerformedChange ();
151 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
156 using DataStructureImplType_ = DataStructures::Array<value_type>;
157 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
160 DataStructureImplType_ fData_;
161 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
172 template <
typename T>
176 AssertRepValidType_ ();
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))}
183 AssertRepValidType_ ();
185 template <
typename T>
190 AssertRepValidType_ ();
192 template <
typename T>
193 template <IEqualsComparer<T> EQUALS_COMPARER>
195 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
198 AssertRepValidType_ ();
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>>)
207 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
208 AssertRepValidType_ ();
211 template <
typename T>
212 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
214 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
216 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
217 AssertRepValidType_ ();
219 template <
typename T>
220 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
224 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
225 AssertRepValidType_ ();
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)}
233 AssertRepValidType_ ();
235 template <
typename T>
236 inline void Set_Array<T>::AssertRepValidType_ ()
const
239 typename inherited::template _SafeReadRepAccessor<IImplRepBase_> tmp{
this};
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
#define RequireNotNull(p)
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.
nonvirtual optional< value_type > Lookup(ArgByValueType< value_type > item) const
nonvirtual ElementEqualityComparerType GetElementEqualsComparer() const
nonvirtual Set CloneEmpty() const
for return Set<T> { s->GetEqualsComparer(); } - except more efficient - clones settings/dynamic subty...
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.
nonvirtual bool RemoveIf(ArgByValueType< value_type > item)
nonvirtual void Add(ArgByValueType< value_type > item)
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.
nonvirtual bool empty() const
Returns true iff size() == 0.
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'.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...