5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
17 template <qCompilerAndStdLib_Constra
intDiffersInTemplateRedeclaration_BWA (IInOrderComparer<T>) INORDER_COMPARER>
18 class SortedSet_stdset<T>::Rep_ :
public IImplRepBase_,
public Memory::UseBlockAllocationIfAppropriate<Rep_<INORDER_COMPARER>> {
20 using inherited = IImplRepBase_;
23 static_assert (not is_reference_v<INORDER_COMPARER>);
26 Rep_ (
const INORDER_COMPARER& inorderComparer)
27 : fData_{inorderComparer}
30 Rep_ (
const Rep_& from) =
default;
33 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
37 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
40 return Memory::MakeSharedPtr<Rep_> (*
this);
42 virtual Iterator<value_type>
MakeIterator ()
const override
45 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
47 virtual size_t size ()
const override
51 return fData_.size ();
53 virtual bool empty ()
const override
57 return fData_.empty ();
59 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
62 fData_.Apply (doToElement);
64 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
Execution::SequencePolicy seq)
const override
69 virtual Iterator<value_type> Find_equal_to (
const ArgByValueType<value_type>& v, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
72 auto found = fData_.find (v);
73 Ensure ((found == fData_.end () and this->inherited::Find_equal_to (v, seq) == Iterator<value_type>{nullptr}) or
74 (found == Debug::UncheckedDynamicCast<const IteratorRep_&> (this->inherited::Find_equal_to (v, seq).ConstGetRep ())
75 .fIterator.GetUnderlyingIteratorRep ()));
76 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, found)};
84 return Common::EqualsComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
86 virtual shared_ptr<typename Set<T>::_IRep>
CloneEmpty ()
const override
89 return Memory::MakeSharedPtr<Rep_> (fData_.key_comp ());
91 virtual shared_ptr<typename Set<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
95 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
96 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
97 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
101 virtual bool Equals (
const typename Iterable<value_type>::_IRep& rhs)
const override
104 return this->_Equals_Reference_Implementation (rhs);
106 virtual bool Lookup (ArgByValueType<value_type> item, optional<value_type>* oResult, Iterator<value_type>* iResult)
const override
109 auto i = fData_.find (item);
110 bool notDone = i != fData_.end ();
111 if (oResult !=
nullptr and notDone) {
114 if (iResult !=
nullptr and notDone) {
115 *iResult = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, i)};
119 virtual void Add (ArgByValueType<value_type> item)
override
122 fData_.insert (item);
123 fChangeCounts_.PerformedChange ();
125 virtual bool RemoveIf (ArgByValueType<value_type> item)
override
129 auto i = fData_.find (item);
130 if (i != fData_.end ()) [[likely]] {
132 fChangeCounts_.PerformedChange ();
137 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
139 Require (not i.Done ());
141 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
142 mir.fIterator.AssertDataMatches (&fData_);
143 auto nextIResult = fData_.erase (mir.fIterator.GetUnderlyingIteratorRep ());
144 fChangeCounts_.PerformedChange ();
145 if (nextI !=
nullptr) {
146 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, nextIResult)};
155 return Common::ThreeWayComparerAdapter<T, INORDER_COMPARER>{fData_.key_comp ()};
159 using DataStructureImplType_ = DataStructures::STLContainerWrapper<STDSET<INORDER_COMPARER>>;
160 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
163 DataStructureImplType_ fData_;
164 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
172 template <
typename T>
174 requires (totally_ordered<T>)
177 AssertRepValidType_ ();
179 template <
typename T>
180 template <IInOrderComparer<T> INORDER_COMPARER>
181 inline SortedSet_stdset<T>::SortedSet_stdset (INORDER_COMPARER&& inorderComparer)
182 : inherited{Memory::MakeSharedPtr<Rep_<remove_cvref_t<INORDER_COMPARER>>> (forward<INORDER_COMPARER> (inorderComparer))}
184 AssertRepValidType_ ();
186 template <
typename T>
188 requires (totally_ordered<T>)
192 AssertRepValidType_ ();
194 template <
typename T>
195 template <IInOrderComparer<T> INORDER_COMPARER>
197 : SortedSet_stdset{forward<INORDER_COMPARER> (inOrderComparer)}
200 AssertRepValidType_ ();
202#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
203 template <
typename T>
204 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
205 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, SortedSet_stdset<T>>)
209 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
210 AssertRepValidType_ ();
213 template <
typename T>
214 template <IInOrderComparer<T> INORDER_COMPARER, IIterableOfTo<T> ITERABLE_OF_ADDABLE>
216 : SortedSet_stdset (forward<INORDER_COMPARER> (inOrderComparer))
218 this->
AddAll (forward<ITERABLE_OF_ADDABLE> (src));
219 AssertRepValidType_ ();
221 template <
typename T>
222 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
226 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
227 AssertRepValidType_ ();
229 template <
typename T>
230 template <IInOrderComparer<T> INORDER_COMPARER, IInputIterator<T> ITERATOR_OF_ADDABLE>
232 : SortedSet_stdset (forward<INORDER_COMPARER> (inOrderComparer))
234 this->
AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
235 AssertRepValidType_ ();
237 template <
typename T>
238 inline void SortedSet_stdset<T>::AssertRepValidType_ ()
const
241 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
SortedSet_stdset<T> is an std::set-based concrete implementation of the SortedSet<T> container patter...
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)
nonvirtual ElementThreeWayComparerType GetElementThreeWayComparer() const
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,...