7#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8#include "Stroika/Foundation/Containers/Support/ReserveTweaks.h"
15 class Sequence_stdvector<T>::Rep_ :
public Sequence<T>::_IRep,
public Memory::UseBlockAllocationIfAppropriate<Rep_> {
17 using inherited =
typename Sequence<T>::_IRep;
20 static constexpr size_t _kSentinelLastItemIndex = inherited::_kSentinelLastItemIndex;
24 Rep_ (
const Rep_& src) =
default;
25 Rep_ (vector<T>&& src)
31 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
35 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
38 return Memory::MakeSharedPtr<Rep_> (*
this);
40 virtual Iterator<value_type>
MakeIterator ()
const override
43 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
45 virtual size_t size ()
const override
48 return fData_.size ();
50 virtual bool empty ()
const override
53 return fData_.empty ();
55 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
58 fData_.Apply (doToElement);
60 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
64 auto iLink =
const_cast<DataStructureImplType_&
> (fData_).
Find (that);
65 if (iLink == fData_.end ()) {
68 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iLink)};
73 virtual shared_ptr<typename Sequence<T>::_IRep> CloneEmpty ()
const override
76 return Memory::MakeSharedPtr<Rep_> ();
78 virtual shared_ptr<typename Sequence<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
82 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
83 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
84 result->fData_.MoveIteratorHereAfterClone (
85 &mir.fIterator, &fData_,
86 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (
auto oldI, [[maybe_unused]]
auto newI) { return targetI == oldI; });
90 virtual value_type
GetAt (
size_t i)
const override
92 Require (not
empty ());
93 Require (i == _kSentinelLastItemIndex or i <
size ());
95 if (i == _kSentinelLastItemIndex) {
96 i = fData_.size () - 1;
100 virtual void SetAt (
size_t i, ArgByValueType<value_type> item)
override
102 Require (i <
size ());
105 fChangeCounts_.PerformedChange ();
107 virtual size_t IndexOf (
const Iterator<value_type>& i)
const override
110 return Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ();
112 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
114 Require (not i.Done ());
116 const IteratorRep_& iRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
117 iRep.fIterator.AssertDataMatches (&fData_);
118 auto newI = fData_.erase (iRep.fIterator.GetUnderlyingIteratorRep ());
119 fChangeCounts_.PerformedChange ();
120 if (nextI !=
nullptr) {
121 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, newI)};
124 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<value_type> newValue, Iterator<value_type>* nextI)
override
127 const IteratorRep_& iRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
128 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
129 if (nextI !=
nullptr) {
130 savedUnderlyingIndex = iRep.fIterator.GetUnderlyingIteratorRep ();
133 *fData_.remove_constness (iRep.fIterator.GetUnderlyingIteratorRep ()) = newValue;
134 fChangeCounts_.PerformedChange ();
135 if (nextI !=
nullptr) {
136 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
140 virtual void Insert (
size_t at,
const span<const value_type>& copyFrom)
override
142 Require (at == _kSentinelLastItemIndex or at <=
size ());
144 if (at == _kSentinelLastItemIndex) {
147 Support::ReserveTweaks::Reserve4AddN (fData_, copyFrom.size ());
148 fData_.insert (fData_.begin () + at, copyFrom.begin (), copyFrom.end ());
149 fChangeCounts_.PerformedChange ();
151 virtual void Remove (
size_t from,
size_t to)
override
153 Require ((from <= to) and (to <= this->
size ()));
156 fData_.erase (fData_.begin () + from, fData_.begin () + to);
157 fChangeCounts_.PerformedChange ();
162 using DataStructureImplType_ = DataStructures::STLContainerWrapper<vector<value_type>>;
163 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
166 DataStructureImplType_ fData_;
167 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
178 template <
typename T>
180 :
inherited{Memory::MakeSharedPtr<Rep_> ()}
182 AssertRepValidType_ ();
184 template <
typename T>
190 AssertRepValidType_ ();
192#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
193 template <
typename T>
194 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
195 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Sequence_stdvector<T>>)
197 : Sequence_stdvector{}
200 this->reserve (src.size ());
202 this->AppendAll (forward<ITERABLE_OF_ADDABLE> (src));
203 AssertRepValidType_ ();
206 template <
typename T>
208 : inherited{Memory::MakeSharedPtr<Rep_> (move (src))}
210 AssertRepValidType_ ();
212 template <
typename T>
213 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
215 : Sequence_stdvector{}
217 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
222 this->
AppendAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
223 AssertRepValidType_ ();
225 template <
typename T>
226 inline void Sequence_stdvector<T>::AssertRepValidType_ ()
const
229 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{
this};
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
#define RequireNotNull(p)
Sequence_stdvector<T> is an std::vector-based concrete implementation of the Sequence<T> container pa...
nonvirtual void reserve(size_t slotsAlloced)
nonvirtual void Remove(size_t i)
nonvirtual void Insert(size_t i, ArgByValueType< value_type > item)
nonvirtual optional< size_t > IndexOf(ArgByValueType< value_type > i, EQUALS_COMPARER &&equalsComparer={}) const
nonvirtual void SetAt(size_t i, ArgByValueType< value_type > item)
nonvirtual value_type GetAt(size_t i) const
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< value_type > newValue, Iterator< value_type > *nextI=nullptr)
nonvirtual void AppendAll(ITERABLE_OF_ADDABLE &&s)
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'.
Concept checks if the given type T has a const size() method which can be called to return a size_t.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...