Stroika Library 3.0d24
 
Loading...
Searching...
No Matches
Sequence_stdvector.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. 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 ([[maybe_unused]] bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
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 // fData_ IS a vector<value_type> (via STLContainerWrapper), so iteration order is storage order.
71 virtual optional<span<const value_type>> PeekContiguousStorage () const override
72 {
74 return span<const value_type>{fData_.data (), fData_.size ()};
75 }
76
77 // Sequence<T>::_IRep overrides
78 public:
79 virtual shared_ptr<typename Sequence<T>::_IRep> CloneEmpty () const override
80 {
82 return Memory::MakeSharedPtr<Rep_> ();
83 }
84 virtual shared_ptr<typename Sequence<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
85 {
88 auto result = Memory::MakeSharedPtr<Rep_> (*this);
89 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
90 result->fData_.MoveIteratorHereAfterClone (
91 &mir.fIterator, &fData_,
92 [targetI = mir.fIterator.GetUnderlyingIteratorRep ()] (auto oldI, [[maybe_unused]] auto newI) { return targetI == oldI; });
93 i->Refresh (); // reflect updated rep
94 return result;
95 }
96 virtual value_type GetAt (size_t i) const override
97 {
98 Require (not empty ());
99 Require (i == _kSentinelLastItemIndex or i < size ());
101 if (i == _kSentinelLastItemIndex) {
102 i = fData_.size () - 1;
103 }
104 return fData_[i];
105 }
106 virtual BidirectionalIterator<value_type> GetBidirectionalIterator () const override
107 {
110 }
111 virtual RandomAccessIterator<value_type> GetRandomAccessIterator () const override
112 {
115 }
116 virtual void SetAt (size_t i, ArgByValueType<value_type> item) override
117 {
118 Require (i < size ());
120 fData_[i] = item;
121 fChangeCounts_.PerformedChange ();
122 }
123 virtual size_t IndexOf (const Iterator<value_type>& i) const override
124 {
126 return Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.CurrentIndex ();
127 }
128 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
129 {
130 Require (not i.AtEnd ());
132 const IteratorRep_& iRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
133 iRep.fIterator.AssertDataMatches (&fData_);
134 auto newI = fData_.erase (iRep.fIterator.GetUnderlyingIteratorRep ());
135 fChangeCounts_.PerformedChange ();
136 if (nextI != nullptr) {
137 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, newI)};
138 }
139 }
141 {
143 const IteratorRep_& iRep = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
145 if (nextI != nullptr) {
146 savedUnderlyingIndex = iRep.fIterator.GetUnderlyingIteratorRep ();
147 }
148 fData_.Invariant ();
149 *fData_.remove_constness (iRep.fIterator.GetUnderlyingIteratorRep ()) = newValue;
150 fChangeCounts_.PerformedChange ();
151 if (nextI != nullptr) {
153 }
154 fData_.Invariant ();
155 }
156 virtual void Insert (size_t at, const span<const value_type>& copyFrom) override
157 {
158 Require (at == _kSentinelLastItemIndex or at <= size ());
160 if (at == _kSentinelLastItemIndex) {
161 at = fData_.size ();
162 }
163 Support::ReserveTweaks::Reserve4AddN (fData_, copyFrom.size ());
164 fData_.insert (fData_.begin () + at, copyFrom.begin (), copyFrom.end ());
165 fChangeCounts_.PerformedChange ();
166 }
167 virtual void Remove (size_t from, size_t to) override
168 {
169 Require ((from <= to) and (to <= this->size ()));
170 if (from != to) {
172 fData_.erase (fData_.begin () + from, fData_.begin () + to);
173 fChangeCounts_.PerformedChange ();
174 }
175 }
176
177 private:
178 using DataStructureImplType_ = DataStructures::STLContainerWrapper<vector<value_type>>;
179 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
180
181 private:
182 // same as IteratorImplHelper_DefaultTraits<value_type, DataStructureImplType_>, but pointing at
183 // DataStructureImplType_::RandomAccessIterator instead of its (forward-only) ForwardIterator
184 struct RandomAccessIteratorTraits_ : Private::IteratorImplHelper_DefaultTraits<value_type, DataStructureImplType_> {
185 using DataStructureIteratorT = typename DataStructureImplType_::RandomAccessIterator;
186 };
187 using RandomAccessIteratorRep_ = Private::RandomAccessIteratorImplHelper_<value_type, DataStructureImplType_, RandomAccessIteratorTraits_>;
188
189 private:
190 DataStructureImplType_ fData_;
191 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
192
193 private:
194 friend class Private::StdVectorBasedContainer<Sequence_stdvector<T>, Sequence<T>>;
195 };
196
197 /*
198 ********************************************************************************
199 ******************************* Sequence_stdvector<T> **************************
200 ********************************************************************************
201 */
202 template <typename T>
204 : inherited{Memory::MakeSharedPtr<Rep_> ()}
205 {
206 AssertRepValidType_ ();
207 }
208 template <typename T>
209 inline Sequence_stdvector<T>::Sequence_stdvector (const initializer_list<value_type>& src)
211 {
212 this->reserve (src.size ());
213 this->AppendAll (src);
214 AssertRepValidType_ ();
215 }
216#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
217 template <typename T>
218 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
219 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Sequence_stdvector<T>>)
220 inline Sequence_stdvector<T>::Sequence_stdvector (ITERABLE_OF_ADDABLE&& src)
221 : Sequence_stdvector{}
222 {
224 this->reserve (src.size ());
225 }
226 this->AppendAll (forward<ITERABLE_OF_ADDABLE> (src));
227 AssertRepValidType_ ();
228 }
229#endif
230 template <typename T>
231 inline Sequence_stdvector<T>::Sequence_stdvector (std::vector<T>&& src)
232 : inherited{Memory::MakeSharedPtr<Rep_> (move (src))}
233 {
234 AssertRepValidType_ ();
235 }
236 template <typename T>
237 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
238 inline Sequence_stdvector<T>::Sequence_stdvector (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
239 : Sequence_stdvector{}
240 {
242 if (start != end) {
243 this->reserve (end - start);
244 }
245 }
247 AssertRepValidType_ ();
248 }
249 template <typename T>
250 inline void Sequence_stdvector<T>::AssertRepValidType_ () const
251 {
253 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMember
254 }
255 }
256
257}
#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_stdvector<T> is an std::vector-based concrete implementation of the Sequence<T> container pa...
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,...