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>> {
23 using inherited = Private::ArrayBasedContainerRepImpl<Set_Array<T>::Rep_<EQUALS_COMPARER>,
typename Set_Array<T>::IImplRepBase_>;
26 Rep_ (
const EQUALS_COMPARER& equalsComparer)
27 : fEqualsComparer_{equalsComparer}
30 Rep_ (
const Rep_& from) =
default;
33 [[no_unique_address]] EQUALS_COMPARER fEqualsComparer_;
36 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
40 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
43 return Memory::MakeSharedPtr<Rep_> (*
this);
45 virtual Iterator<value_type>
MakeIterator ()
const override
48 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
50 virtual size_t size ()
const override
53 return fData_.size ();
55 virtual bool empty ()
const override
58 return fData_.empty ();
60 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
63 fData_.Apply (doToElement);
65 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
69 if (
auto i = fData_.Find (that)) {
70 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
80 return fEqualsComparer_;
82 virtual shared_ptr<typename Set<T>::_IRep>
CloneEmpty ()
const override
85 return Memory::MakeSharedPtr<Rep_> (fEqualsComparer_);
87 virtual shared_ptr<typename Set<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
91 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
92 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
93 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
97 virtual bool Equals (
const typename Iterable<value_type>::_IRep& rhs)
const override
100 return this->_Equals_Reference_Implementation (rhs);
102 virtual bool Lookup (ArgByValueType<value_type> item, optional<value_type>* oResult, Iterator<value_type>* iResult)
const override
105 if (
auto l = fData_.Find ([
this, item] (ArgByValueType<value_type> i) { return fEqualsComparer_ (i, item); })) {
106 if (oResult !=
nullptr) {
109 if (iResult !=
nullptr) {
110 *iResult = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, l)};
116 virtual void Add (ArgByValueType<value_type> item)
override
119 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
120 if (fEqualsComparer_ (*it, item)) {
124 fData_.push_back (item);
125 fChangeCounts_.PerformedChange ();
127 virtual bool RemoveIf (ArgByValueType<value_type> item)
override
130 for (
typename DataStructureImplType_::ForwardIterator it{&fData_}; not it.Done (); ++it) {
131 if (fEqualsComparer_ (*it, item)) {
133 fChangeCounts_.PerformedChange ();
139 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
141 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>);
142 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
143 if (nextI ==
nullptr) {
144 fData_.Remove (mir.fIterator);
145 fChangeCounts_.PerformedChange ();
148 auto retI = fData_.erase (mir.fIterator);
149 fChangeCounts_.PerformedChange ();
150 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
155 using DataStructureImplType_ = DataStructures::Array<value_type>;
156 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
159 DataStructureImplType_ fData_;
160 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
171 template <
typename T>
175 AssertRepValidType_ ();
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))}
182 AssertRepValidType_ ();
184 template <
typename T>
189 AssertRepValidType_ ();
191 template <
typename T>
192 template <IEqualsComparer<T> EQUALS_COMPARER>
194 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
197 AssertRepValidType_ ();
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>>)
206 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
207 AssertRepValidType_ ();
210 template <
typename T>
211 template <IEqualsComparer<T> EQUALS_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
213 : Set_Array{forward<EQUALS_COMPARER> (equalsComparer)}
215 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
216 AssertRepValidType_ ();
218 template <
typename T>
219 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
223 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
224 AssertRepValidType_ ();
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)}
232 AssertRepValidType_ ();
234 template <
typename T>
235 inline void Set_Array<T>::AssertRepValidType_ ()
const
238 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,...