Stroika Library 3.0d24
 
Loading...
Searching...
No Matches
Collection_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2026. All rights reserved
3 */
4#include "Stroika/Foundation/Containers/DataStructures/Array.h"
6#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
9
11
12 /*
13 ********************************************************************************
14 ********************** Collection_Array<T,TRAITS>::Rep_ ************************
15 ********************************************************************************
16 */
17 template <typename T>
18 class Collection_Array<T>::Rep_ : public Collection_Array<T>::IImplRep_, public Memory::UseBlockAllocationIfAppropriate<Rep_> {
19 private:
20 using inherited = typename Collection<T>::_IRep;
21
22 public:
23 Rep_ () = default;
24 Rep_ (const Rep_& from) = default;
25
26 public:
27 nonvirtual Rep_& operator= (const Rep_&) = delete;
28
29 // Iterable<T>::_IRep overrides
30 public:
31 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
32 {
34 return Memory::MakeSharedPtr<Rep_> (*this);
35 }
36 virtual Iterator<value_type> MakeIterator () const override
37 {
39 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
40 }
41 // MakeIterator () walks fData_ from 0, so storage order IS iteration order.
42 virtual optional<span<const value_type>> PeekContiguousStorage () const override
43 {
45 return span<const value_type>{fData_.data (), fData_.size ()};
46 }
47 virtual size_t size () const override
48 {
50 return fData_.size ();
51 }
52 virtual bool empty () const override
53 {
55 return fData_.empty ();
56 }
57 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
58 {
60 fData_.Apply (doToElement, seq);
61 }
62 virtual Iterator<value_type> Find ([[maybe_unused]] bool findFirst, const function<bool (ArgByValueType<value_type> item)>& that,
64 {
66 if (auto i = fData_.Find (that)) {
67 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
68 }
69 return nullptr;
70 }
71
72 // Collection<T>::_IRep overrides
73 public:
74 virtual shared_ptr<typename Collection<T>::_IRep> CloneEmpty () const override
75 {
77 return Memory::MakeSharedPtr<Rep_> ();
78 }
79 virtual shared_ptr<typename Collection<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
80 {
83 auto result = Memory::MakeSharedPtr<Rep_> (*this);
84 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
85 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
86 i->Refresh (); // reflect updated rep
87 return result;
88 }
89#if qCompilerAndStdLib_MemoryInsertAt_Buggy
90 // see the note on qCompilerAndStdLib_MemoryInsertAt_Buggy - without this, g++ <= 14 drops
91 // the `if (oAddedI != nullptr)` guard below and writes through the null pointer
92 [[gnu::noinline, gnu::optimize ("O0")]]
93#endif
94 virtual void Add (const span<const value_type>& items, Iterator<value_type>* oAddedI) override
95 {
96 Require (not items.empty ());
97 Require (oAddedI == nullptr or items.size () == 1);
99 // Appending is fastest, and Array::Insert () takes the whole span in one go
100 fData_.Insert (fData_.size (), items);
101 fChangeCounts_.PerformedChange ();
102 if (oAddedI != nullptr) [[unlikely]] {
103 *oAddedI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, fData_.size () - 1)};
104 }
105 }
107 {
110 if (nextI != nullptr) {
111 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
112 }
113 fData_.SetAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator, newValue);
114 fChangeCounts_.PerformedChange ();
115 if (nextI != nullptr) {
117 }
118 }
119 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
120 {
122 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
123 if (nextI == nullptr) {
124 fData_.Remove (mir.fIterator);
125 fChangeCounts_.PerformedChange ();
126 }
127 else {
128 auto retI = fData_.erase (mir.fIterator);
129 fChangeCounts_.PerformedChange ();
131 }
132 }
133
134 private:
135 using DataStructureImplType_ = DataStructures::Array<value_type>;
136 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
137
138 private:
139 DataStructureImplType_ fData_;
140 qStroika_ATTRIBUTE_NO_UNIQUE_ADDRESS_VCFORCE Private::ContainerDebugChangeCounts_ fChangeCounts_;
141 };
142
143 /*
144 ********************************************************************************
145 ************************* Collection_Array<T,TRAITS> ***************************
146 ********************************************************************************
147 */
148 template <typename T>
150 : inherited{Memory::MakeSharedPtr<Rep_> ()}
151 {
152 AssertRepValidType_ ();
153 }
154 template <typename T>
155 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
156 inline Collection_Array<T>::Collection_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
158 {
160 if (start != end) {
161 reserve (end - start);
162 }
163 }
165 AssertRepValidType_ ();
166 }
167 template <typename T>
168 inline Collection_Array<T>::Collection_Array (const initializer_list<value_type>& src)
169 : Collection_Array{}
170 {
171 reserve (src.size ());
172 this->AddAll (src);
173 AssertRepValidType_ ();
174 }
175#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
176 template <typename T>
177 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
178 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Collection_Array<T>>)
179 inline Collection_Array<T>::Collection_Array (ITERABLE_OF_ADDABLE&& src)
180 : Collection_Array{}
181 {
182 reserve (src.size ());
183 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
184 AssertRepValidType_ ();
185 }
186#endif
187 template <typename T>
188 inline void Collection_Array<T>::AssertRepValidType_ () const
189 {
191 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMemeber
192 }
193 }
194
195}
#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
nonvirtual void AddAll(ITERATOR_OF_ADDABLE &&start, ITERATOR_OF_ADDABLE2 &&end)
nonvirtual void Update(const Iterator< value_type > &i, ArgByValueType< value_type > newValue, Iterator< value_type > *nextI=nullptr)
nonvirtual void Remove(ArgByValueType< value_type > item, EQUALS_COMPARER &&equalsComparer={})
Remove () the argument value (which must exist)
nonvirtual void Add(ArgByValueType< value_type > item)
Collection_Array<T> is an Array-based concrete implementation of the Collection<T> container pattern.
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 CONTAINER_OF_T As(CONTAINER_OF_T_CONSTRUCTOR_ARGS... args) const
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
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...