Stroika Library 3.0d24
 
Loading...
Searching...
No Matches
Sequence_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. All rights reserved
3 */
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"
11
13
14 /**
15 */
16 template <typename T>
17 class Sequence_Array<T>::Rep_ : public Sequence<T>::_IRep, public Memory::UseBlockAllocationIfAppropriate<Rep_> {
18 private:
19 using inherited = typename Sequence<T>::_IRep;
20
21 protected:
22 static constexpr size_t _kSentinelLastItemIndex = inherited::_kSentinelLastItemIndex;
23
24 public:
25 Rep_ () = default;
26 Rep_ (const Rep_& from) = default;
27
28 public:
29 nonvirtual Rep_& operator= (const Rep_&) = delete;
30
31 // Iterable<T>::_IRep overrides
32 public:
33 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
34 {
36 return Memory::MakeSharedPtr<Rep_> (*this);
37 }
38 virtual Iterator<T> MakeIterator () const override
39 {
41 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
42 }
43 virtual size_t size () const override
44 {
46 return fData_.size ();
47 }
48 virtual bool empty () const override
49 {
51 return fData_.empty ();
52 }
53 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
54 {
56 fData_.Apply (doToElement, seq);
57 }
58 virtual Iterator<value_type> Find ([[maybe_unused]] bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
60 {
62 if (auto i = fData_.Find (that)) {
63 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
64 }
65 return nullptr;
66 }
67 // Array<T> stores elements contiguously in iteration order, so this is just its buffer.
68 virtual optional<span<const value_type>> PeekContiguousStorage () const override
69 {
71 return span<const value_type>{fData_.data (), fData_.size ()};
72 }
73
74 // Sequence<T>::_IRep overrides
75 public:
76 virtual shared_ptr<typename Sequence<T>::_IRep> CloneEmpty () const override
77 {
78 return Memory::MakeSharedPtr<Rep_> ();
79 }
80 virtual shared_ptr<typename Sequence<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
81 {
84 auto result = Memory::MakeSharedPtr<Rep_> (*this);
85 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
86 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
87 return result;
88 }
89 virtual value_type GetAt (size_t i) const override
90 {
91 Require (fData_.size () != 0);
92 Require (i == _kSentinelLastItemIndex or i < fData_.size ());
94 if (i == _kSentinelLastItemIndex) {
95 i = fData_.size () - 1;
96 }
97 return fData_.GetAt (i);
98 }
99 virtual BidirectionalIterator<value_type> GetBidirectionalIterator () const override
100 {
103 }
104 virtual RandomAccessIterator<value_type> GetRandomAccessIterator () const override
105 {
108 }
109 virtual void SetAt (size_t i, ArgByValueType<value_type> item) override
110 {
111 Require (i < fData_.size ());
113 fData_.SetAt (i, item);
114 fChangeCounts_.PerformedChange ();
115 }
116 virtual size_t IndexOf (const Iterator<value_type>& i) const override
117 {
119 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
120 return iteratorRep.fIterator.CurrentIndex ();
121 }
122 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
123 {
125 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
126 if (nextI == nullptr) {
127 fData_.Remove (iteratorRep.fIterator);
128 fChangeCounts_.PerformedChange ();
129 }
130 else {
131 auto ret = fData_.erase (iteratorRep.fIterator);
132 fChangeCounts_.PerformedChange ();
134 }
135 }
137 {
139 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
141 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>); // else must do slightly differently
142 if (nextI != nullptr) {
143 savedUnderlyingIndex = iteratorRep.fIterator.CurrentIndex ();
144 }
145 fData_.SetAt (iteratorRep.fIterator, newValue);
146 fChangeCounts_.PerformedChange ();
147 if (nextI != nullptr) {
149 }
150 }
151 virtual void Insert (size_t at, const span<const value_type>& copyFrom) override
152 {
153 Require (at == _kSentinelLastItemIndex or at <= fData_.size ());
155 if (at == _kSentinelLastItemIndex) {
156 at = fData_.size ();
157 }
158 fData_.Insert (at, copyFrom);
159 fChangeCounts_.PerformedChange ();
160 }
161 virtual void Remove (size_t from, size_t to) override
162 {
163 Require (from <= to);
164 Require (to <= this->size ());
166 if (from != to) {
167 fData_.Remove (from, to);
168 fChangeCounts_.PerformedChange ();
169 }
170 }
171
172 private:
173 using DataStructureImplType_ = DataStructures::Array<value_type>;
174 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
175 using RandomAccessIteratorRep_ = Private::RandomAccessIteratorImplHelper_<value_type, DataStructureImplType_>;
176
177 private:
178 DataStructureImplType_ fData_;
179 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
180
181 private:
182 friend class Private::ArrayBasedContainer<Sequence_Array, Sequence<T>, false>;
183 };
184
185 /*
186 ********************************************************************************
187 ****************************** Sequence_Array<T> *******************************
188 ********************************************************************************
189 */
190 template <typename T>
192 : inherited{Memory::MakeSharedPtr<Rep_> ()}
193 {
194 AssertRepValidType_ ();
195 }
196 template <typename T>
197 inline Sequence_Array<T>::Sequence_Array (const initializer_list<value_type>& src)
199 {
200 this->reserve (src.size ());
201 this->AppendAll (src);
202 AssertRepValidType_ ();
203 }
204#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
205 template <typename T>
206 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
207 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Sequence_Array<T>>)
208 inline Sequence_Array<T>::Sequence_Array (ITERABLE_OF_ADDABLE&& src)
209 : Sequence_Array{}
210 {
212 this->reserve (src.size ());
213 }
214 this->AppendAll (forward<ITERABLE_OF_ADDABLE> (src));
215 AssertRepValidType_ ();
216 }
217#endif
218 template <typename T>
219 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
220 inline Sequence_Array<T>::Sequence_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
221 : Sequence_Array{}
222 {
224 if (start != end) {
225 this->reserve (end - start);
226 }
227 }
229 AssertRepValidType_ ();
230 }
231 template <typename T>
232 inline void Sequence_Array<T>::AssertRepValidType_ () const
233 {
235 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMemeber
236 }
237 }
238
239}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:49
#define RequireNotNull(p)
Definition Assertions.h:348
#define qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE
[[msvc::no_unique_address]] isn't always broken in MSVC. Annotate with this on things where its not b...
Definition StdCompat.h:443
Sequence_Array<T> is an Array-based concrete implementation of the Sequence<T> container pattern.
nonvirtual void As(CONTAINER_OF_ADDABLE *into) const
write this Sequence into an existing container
nonvirtual void Insert(size_t i, ArgByValueType< value_type > item)
Definition Sequence.inl:464
nonvirtual optional< size_t > IndexOf(ArgByValueType< value_type > i, EQUALS_COMPARER &&equalsComparer={}) const
nonvirtual void SetAt(size_t i, ArgByValueType< value_type > item)
Definition Sequence.inl:396
nonvirtual value_type GetAt(size_t i) const
Definition Sequence.inl:389
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< value_type > newValue, Iterator< value_type > *nextI=nullptr)
Definition Sequence.inl:716
nonvirtual void AppendAll(ITERABLE_OF_ADDABLE &&s)
unique_lock< AssertExternallySynchronizedChecker > WriteContext
Instantiate AssertExternallySynchronizedChecker::WriteContext to designate an area of code where prot...
shared_lock< const AssertExternallySynchronizedChecker > ReadContext
Instantiate AssertExternallySynchronizedChecker::ReadContext to designate an area of code where prote...
nonvirtual Iterator< T > Find(THAT_FUNCTION &&that) const
Run the argument bool-returning function (or lambda) on the elements of the container,...
nonvirtual size_t size() const
Returns the number of items contained.
Definition Iterable.inl:311
nonvirtual void Apply(const function< void(ArgByValueType< T > item)> &doToElement) const
Run the argument function (or lambda) on each element of the container.
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:317
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'.
Definition Iterable.inl:305
Concept checks if the given type T has a const size() method which can be called to return a size_t.
Definition Concepts.h:286
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...