4#include "Stroika/Foundation/Containers/Common.h"
5#include "Stroika/Foundation/Containers/DataStructures/Array.h"
7#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8#include "Stroika/Foundation/Containers/Support/ReserveTweaks.h"
17 class Sequence_Array<T>::Rep_ :
public Sequence<T>::_IRep,
public Memory::UseBlockAllocationIfAppropriate<Rep_> {
19 using inherited =
typename Sequence<T>::_IRep;
22 static constexpr size_t _kSentinelLastItemIndex = inherited::_kSentinelLastItemIndex;
26 Rep_ (
const Rep_& from) =
default;
29 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
33 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
36 return Memory::MakeSharedPtr<Rep_> (*
this);
41 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
43 virtual size_t size ()
const override
46 return fData_.size ();
48 virtual bool empty ()
const override
51 return fData_.empty ();
56 fData_.Apply (doToElement, seq);
58 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
62 if (
auto i = fData_.Find (that)) {
63 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
70 virtual shared_ptr<typename Sequence<T>::_IRep> CloneEmpty ()
const override
72 return Memory::MakeSharedPtr<Rep_> ();
74 virtual shared_ptr<typename Sequence<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i)
const override
78 auto result = Memory::MakeSharedPtr<Rep_> (*
this);
79 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
80 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
83 virtual value_type
GetAt (
size_t i)
const override
85 Require (fData_.size () != 0);
86 Require (i == _kSentinelLastItemIndex or i < fData_.size ());
88 if (i == _kSentinelLastItemIndex) {
89 i = fData_.size () - 1;
91 return fData_.GetAt (i);
93 virtual void SetAt (
size_t i, ArgByValueType<value_type> item)
override
95 Require (i < fData_.size ());
97 fData_.SetAt (i, item);
98 fChangeCounts_.PerformedChange ();
100 virtual size_t IndexOf (
const Iterator<value_type>& i)
const override
103 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
104 return mir.fIterator.CurrentIndex ();
106 virtual void Remove (
const Iterator<value_type>& i, Iterator<value_type>* nextI)
override
109 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
110 if (nextI ==
nullptr) {
111 fData_.Remove (mir.fIterator);
112 fChangeCounts_.PerformedChange ();
115 auto ret = fData_.erase (mir.fIterator);
116 fChangeCounts_.PerformedChange ();
117 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
120 virtual void Update (
const Iterator<value_type>& i, ArgByValueType<value_type> newValue, Iterator<value_type>* nextI)
override
123 optional<size_t> savedUnderlyingIndex;
124 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>);
125 if (nextI !=
nullptr) {
126 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ();
128 fData_.SetAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator, newValue);
129 fChangeCounts_.PerformedChange ();
130 if (nextI !=
nullptr) {
131 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
134 virtual void Insert (
size_t at,
const value_type* from,
const value_type* to)
override
136 Require (at == _kSentinelLastItemIndex or at <= fData_.size ());
138 if (at == _kSentinelLastItemIndex) {
141 Support::ReserveTweaks::Reserve4AddN (fData_, to - from);
142 for (
auto i = from; i != to; ++i) {
143 fData_.InsertAt (at++, *i);
145 fChangeCounts_.PerformedChange ();
147 virtual void Remove (
size_t from,
size_t to)
override
151 for (
size_t i = from; i < to; ++i) {
152 fData_.RemoveAt (from);
154 fChangeCounts_.PerformedChange ();
158 using DataStructureImplType_ = DataStructures::Array<value_type>;
159 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
162 DataStructureImplType_ fData_;
163 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
174 template <
typename T>
176 :
inherited{Memory::MakeSharedPtr<Rep_> ()}
178 AssertRepValidType_ ();
180 template <
typename T>
186 AssertRepValidType_ ();
188#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
189 template <
typename T>
190 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
191 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Sequence_Array<T>>)
196 this->reserve (src.size ());
198 this->AppendAll (forward<ITERABLE_OF_ADDABLE> (src));
199 AssertRepValidType_ ();
202 template <
typename T>
203 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
207 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
212 this->
AppendAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
213 AssertRepValidType_ ();
215 template <
typename T>
216 inline void Sequence_Array<T>::AssertRepValidType_ ()
const
219 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_Array<T> is an Array-based concrete implementation of the Sequence<T> container pattern.
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,...