Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
Collection_Array.inl
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. 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 virtual size_t size () const override
42 {
44 return fData_.size ();
45 }
46 virtual bool empty () const override
47 {
49 return fData_.empty ();
50 }
51 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
52 {
54 fData_.Apply (doToElement, seq);
55 }
56 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
57 [[maybe_unused]] Execution::SequencePolicy seq) const override
58 {
60 if (auto i = fData_.Find (that)) {
61 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
62 }
63 return nullptr;
64 }
65
66 // Collection<T>::_IRep overrides
67 public:
68 virtual shared_ptr<typename Collection<T>::_IRep> CloneEmpty () const override
69 {
71 return Memory::MakeSharedPtr<Rep_> ();
72 }
73 virtual shared_ptr<typename Collection<T>::_IRep> CloneAndPatchIterator (Iterator<value_type>* i) const override
74 {
77 auto result = Memory::MakeSharedPtr<Rep_> (*this);
78 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i->ConstGetRep ());
79 result->fData_.MoveIteratorHereAfterClone (&mir.fIterator, &fData_);
80 i->Refresh (); // reflect updated rep
81 return result;
82 }
83 virtual void Add (ArgByValueType<value_type> item, Iterator<value_type>* oAddedI) override
84 {
86 // Appending is fastest
87 fData_.push_back (item);
88 fChangeCounts_.PerformedChange ();
89 if (oAddedI != nullptr) [[unlikely]] {
90 *oAddedI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, fData_.size () - 1)};
91 }
92 }
93 virtual void Update (const Iterator<value_type>& i, ArgByValueType<value_type> newValue, Iterator<value_type>* nextI) override
94 {
96 optional<typename DataStructureImplType_::UnderlyingIteratorRep> savedUnderlyingIndex;
97 if (nextI != nullptr) {
98 savedUnderlyingIndex = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator.GetUnderlyingIteratorRep ();
99 }
100 fData_.SetAt (Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ()).fIterator, newValue);
101 fChangeCounts_.PerformedChange ();
102 if (nextI != nullptr) {
103 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, *savedUnderlyingIndex)};
104 }
105 }
106 virtual void Remove (const Iterator<value_type>& i, Iterator<value_type>* nextI) override
107 {
109 auto& mir = Debug::UncheckedDynamicCast<const IteratorRep_&> (i.ConstGetRep ());
110 if (nextI == nullptr) {
111 fData_.Remove (mir.fIterator);
112 fChangeCounts_.PerformedChange ();
113 }
114 else {
115 auto retI = fData_.erase (mir.fIterator);
116 fChangeCounts_.PerformedChange ();
117 *nextI = Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, retI)};
118 }
119 }
120
121 private:
122 using DataStructureImplType_ = DataStructures::Array<value_type>;
123 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
124
125 private:
126 DataStructureImplType_ fData_;
127 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
128 };
129
130 /*
131 ********************************************************************************
132 ************************* Collection_Array<T,TRAITS> ***************************
133 ********************************************************************************
134 */
135 template <typename T>
137 : inherited{Memory::MakeSharedPtr<Rep_> ()}
138 {
139 AssertRepValidType_ ();
140 }
141 template <typename T>
142 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
143 inline Collection_Array<T>::Collection_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
145 {
146 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
147 if (start != end) {
148 reserve (end - start);
149 }
150 }
151 this->AddAll (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
152 AssertRepValidType_ ();
153 }
154 template <typename T>
155 inline Collection_Array<T>::Collection_Array (const initializer_list<value_type>& src)
156 : Collection_Array{}
157 {
158 reserve (src.size ());
159 this->AddAll (src);
160 AssertRepValidType_ ();
161 }
162#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
163 template <typename T>
164 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
165 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Collection_Array<T>>)
166 inline Collection_Array<T>::Collection_Array (ITERABLE_OF_ADDABLE&& src)
167 : Collection_Array{}
168 {
169 reserve (src.size ());
170 this->AddAll (forward<ITERABLE_OF_ADDABLE> (src));
171 AssertRepValidType_ ();
172 }
173#endif
174 template <typename T>
175 inline void Collection_Array<T>::AssertRepValidType_ () const
176 {
178 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMemeber
179 }
180 }
181
182}
#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
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.
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:300
nonvirtual bool empty() const
Returns true iff size() == 0.
Definition Iterable.inl:306
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:294
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...