Stroika Library 3.0d18
 
Loading...
Searching...
No Matches
Sequence_stdvector.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#include <vector>
5
7#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
8#include "Stroika/Foundation/Containers/Support/ReserveTweaks.h"
11
13
14 template <typename T>
15 class Sequence_stdvector<T>::Rep_ : public Sequence<T>::_IRep, public Memory::UseBlockAllocationIfAppropriate<Rep_> {
16 private:
17 using inherited = typename Sequence<T>::_IRep;
18
19 protected:
20 static constexpr size_t _kSentinelLastItemIndex = inherited::_kSentinelLastItemIndex;
21
22 public:
23 Rep_ () = default;
24 Rep_ (const Rep_& src) = default;
25 Rep_ (vector<T>&& src)
26 : fData_{move (src)}
27 {
28 }
29
30 public:
31 nonvirtual Rep_& operator= (const Rep_&) = delete;
32
33 // Iterable<T>::_IRep overrides
34 public:
35 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
36 {
38 return Memory::MakeSharedPtr<Rep_> (*this);
39 }
40 virtual Iterator<value_type> MakeIterator () const override
41 {
43 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
44 }
45 virtual size_t size () const override
46 {
48 return fData_.size ();
49 }
50 virtual bool empty () const override
51 {
53 return fData_.empty ();
54 }
55 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]] Execution::SequencePolicy seq) const override
56 {
58 fData_.Apply (doToElement);
59 }
60 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
61 [[maybe_unused]] Execution::SequencePolicy seq) const override
62 {
64 auto iLink = const_cast<DataStructureImplType_&> (fData_).Find (that);
65 if (iLink == fData_.end ()) {
66 return nullptr;
67 }
68 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iLink)};
69 }
70
71 // Sequence<T>::_IRep overrides
72 public:
73 virtual shared_ptr<typename Sequence<T>::_IRep> CloneEmpty () const override
74 {
76 return Memory::MakeSharedPtr<Rep_> ();
77 }
78 virtual shared_ptr<typename Sequence<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
79 {
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; });
87 i->Refresh (); // reflect updated rep
88 return result;
89 }
90 virtual value_type GetAt (size_t i) const override
91 {
92 Require (not empty ());
93 Require (i == _kSentinelLastItemIndex or i < size ());
95 if (i == _kSentinelLastItemIndex) {
96 i = fData_.size () - 1;
97 }
98 return fData_[i];
99 }
100 virtual void SetAt (size_t i, ArgByValueType<value_type> item) override
101 {
102 Require (i < size ());
104 fData_[i] = item;
105 fChangeCounts_.PerformedChange ();
106 }
107 virtual size_t IndexOf (const Iterator<value_type>& i) const override
108 {
110 return Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ();
111 }
112 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
113 {
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)};
122 }
123 }
124 virtual void Update (const Iterator<value_type>& i, ArgByValueType<value_type> newValue, Iterator<value_type>* nextI) override
125 {
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 ();
131 }
132 fData_.Invariant ();
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)};
137 }
138 fData_.Invariant ();
139 }
140 virtual void Insert (size_t at, const span<const value_type>& copyFrom) override
141 {
142 Require (at == _kSentinelLastItemIndex or at <= size ());
144 if (at == _kSentinelLastItemIndex) {
145 at = fData_.size ();
146 }
147 Support::ReserveTweaks::Reserve4AddN (fData_, copyFrom.size ());
148 fData_.insert (fData_.begin () + at, copyFrom.begin (), copyFrom.end ());
149 fChangeCounts_.PerformedChange ();
150 }
151 virtual void Remove (size_t from, size_t to) override
152 {
153 Require ((from <= to) and (to <= this->size ()));
154 if (from != to) {
156 fData_.erase (fData_.begin () + from, fData_.begin () + to);
157 fChangeCounts_.PerformedChange ();
158 }
159 }
160
161 private:
162 using DataStructureImplType_ = DataStructures::STLContainerWrapper<vector<value_type>>;
163 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
164
165 private:
166 DataStructureImplType_ fData_;
167 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
168
169 private:
170 friend class Private::StdVectorBasedContainer<Sequence_stdvector<T>, Sequence<T>>;
171 };
172
173 /*
174 ********************************************************************************
175 ******************************* Sequence_stdvector<T> **************************
176 ********************************************************************************
177 */
178 template <typename T>
180 : inherited{Memory::MakeSharedPtr<Rep_> ()}
181 {
182 AssertRepValidType_ ();
183 }
184 template <typename T>
185 inline Sequence_stdvector<T>::Sequence_stdvector (const initializer_list<value_type>& src)
187 {
188 this->reserve (src.size ());
189 this->AppendAll (src);
190 AssertRepValidType_ ();
191 }
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>>)
196 inline Sequence_stdvector<T>::Sequence_stdvector (ITERABLE_OF_ADDABLE&& src)
197 : Sequence_stdvector{}
198 {
200 this->reserve (src.size ());
201 }
202 this->AppendAll (forward<ITERABLE_OF_ADDABLE> (src));
203 AssertRepValidType_ ();
204 }
205#endif
206 template <typename T>
207 inline Sequence_stdvector<T>::Sequence_stdvector (std::vector<T>&& src)
208 : inherited{Memory::MakeSharedPtr<Rep_> (move (src))}
209 {
210 AssertRepValidType_ ();
211 }
212 template <typename T>
213 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
214 inline Sequence_stdvector<T>::Sequence_stdvector (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
215 : Sequence_stdvector{}
216 {
217 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
218 if (start != end) {
219 this->reserve (end - start);
220 }
221 }
222 this->AppendAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
223 AssertRepValidType_ ();
224 }
225 template <typename T>
226 inline void Sequence_stdvector<T>::AssertRepValidType_ () const
227 {
229 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMember
230 }
231 }
232
233}
#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_stdvector<T> is an std::vector-based concrete implementation of the Sequence<T> container pa...
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,...