Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
Sequence_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. 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 (const function<bool (ArgByValueType<value_type> item)>& that,
59 [[maybe_unused]] Execution::SequencePolicy seq) const override
60 {
62 if (auto i = fData_.Find (that)) {
63 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
64 }
65 return nullptr;
66 }
67
68 // Sequence<T>::_IRep overrides
69 public:
70 virtual shared_ptr<typename Sequence<T>::_IRep> CloneEmpty () const override
71 {
72 return Memory::MakeSharedPtr<Rep_> ();
73 }
74 virtual shared_ptr<typename Sequence<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
75 {
78 auto result = Memory::MakeSharedPtr<Rep_> (*this);
79 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
80 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
81 return result;
82 }
83 virtual value_type GetAt (size_t i) const override
84 {
85 Require (fData_.size () != 0);
86 Require (i == _kSentinelLastItemIndex or i < fData_.size ());
88 if (i == _kSentinelLastItemIndex) {
89 i = fData_.size () - 1;
90 }
91 return fData_.GetAt (i);
92 }
93 virtual void SetAt (size_t i, ArgByValueType<value_type> item) override
94 {
95 Require (i < fData_.size ());
97 fData_.SetAt (i, item);
98 fChangeCounts_.PerformedChange ();
99 }
100 virtual size_t IndexOf (const Iterator<value_type>& i) const override
101 {
103 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
104 return iteratorRep.fIterator.CurrentIndex ();
105 }
106 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
107 {
109 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
110 if (nextI == nullptr) {
111 fData_.Remove (iteratorRep.fIterator);
112 fChangeCounts_.PerformedChange ();
113 }
114 else {
115 auto ret = fData_.erase (iteratorRep.fIterator);
116 fChangeCounts_.PerformedChange ();
117 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, ret)};
118 }
119 }
120 virtual void Update (const Iterator<value_type>& i, ArgByValueType<value_type> newValue, Iterator<value_type>* nextI) override
121 {
123 const IteratorRep_& iteratorRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
124 optional<size_t> savedUnderlyingIndex;
125 static_assert (same_as<size_t, typename DataStructureImplType_::UnderlyingIteratorRep>); // else must do slightly differently
126 if (nextI != nullptr) {
127 savedUnderlyingIndex = iteratorRep.fIterator.CurrentIndex ();
128 }
129 fData_.SetAt (iteratorRep.fIterator, newValue);
130 fChangeCounts_.PerformedChange ();
131 if (nextI != nullptr) {
132 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
133 }
134 }
135 virtual void Insert (size_t at, const span<const value_type>& copyFrom) override
136 {
137 Require (at == _kSentinelLastItemIndex or at <= fData_.size ());
139 if (at == _kSentinelLastItemIndex) {
140 at = fData_.size ();
141 }
142 fData_.Insert (at, copyFrom);
143 fChangeCounts_.PerformedChange ();
144 }
145 virtual void Remove (size_t from, size_t to) override
146 {
147 Require (from <= to);
148 Require (to <= this->size ());
150 if (from != to) {
151 fData_.Remove (from, to);
152 fChangeCounts_.PerformedChange ();
153 }
154 }
155
156 private:
157 using DataStructureImplType_ = DataStructures::Array<value_type>;
158 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
159
160 private:
161 DataStructureImplType_ fData_;
162 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
163
164 private:
165 friend class Private::ArrayBasedContainer<Sequence_Array, Sequence<T>, false>;
166 };
167
168 /*
169 ********************************************************************************
170 ****************************** Sequence_Array<T> *******************************
171 ********************************************************************************
172 */
173 template <typename T>
175 : inherited{Memory::MakeSharedPtr<Rep_> ()}
176 {
177 AssertRepValidType_ ();
178 }
179 template <typename T>
180 inline Sequence_Array<T>::Sequence_Array (const initializer_list<value_type>& src)
182 {
183 this->reserve (src.size ());
184 this->AppendAll (src);
185 AssertRepValidType_ ();
186 }
187#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
188 template <typename T>
189 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
190 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Sequence_Array<T>>)
191 inline Sequence_Array<T>::Sequence_Array (ITERABLE_OF_ADDABLE&& src)
192 : Sequence_Array{}
193 {
195 this->reserve (src.size ());
196 }
197 this->AppendAll (forward<ITERABLE_OF_ADDABLE> (src));
198 AssertRepValidType_ ();
199 }
200#endif
201 template <typename T>
202 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
203 inline Sequence_Array<T>::Sequence_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
204 : Sequence_Array{}
205 {
206 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
207 if (start != end) {
208 this->reserve (end - start);
209 }
210 }
211 this->AppendAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
212 AssertRepValidType_ ();
213 }
214 template <typename T>
215 inline void Sequence_Array<T>::AssertRepValidType_ () const
216 {
218 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMemeber
219 }
220 }
221
222}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
#define RequireNotNull(p)
Definition Assertions.h:347
Sequence_Array<T> is an Array-based concrete implementation of the Sequence<T> container pattern.
nonvirtual void Insert(size_t i, ArgByValueType< value_type > item)
Definition Sequence.inl:281
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:244
nonvirtual value_type GetAt(size_t i) const
Definition Sequence.inl:237
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< value_type > newValue, Iterator< value_type > *nextI=nullptr)
Definition Sequence.inl:351
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.
Definition Iterable.inl:302
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:308
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:296
Concept checks if the given type T has a const size() method which can be called to return a size_t.
Definition Concepts.h:375
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...