Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
Queue_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 template <typename T>
13 class Queue_Array<T>::Rep_ : public Queue<T>::_IRep, public Memory::UseBlockAllocationIfAppropriate<Rep_> {
14 private:
15 using inherited = typename Queue<T>::_IRep;
16
17 public:
18 Rep_ () = default;
19 Rep_ (const Rep_& from) = default;
20
21 public:
22 nonvirtual Rep_& operator= (const Rep_&) = delete;
23
24 // Iterable<T>::_IRep overrides
25 public:
26 virtual shared_ptr<typename Iterable<T>::_IRep> Clone () const override
27 {
29 return Memory::MakeSharedPtr<Rep_> (*this);
30 }
31 virtual Iterator<value_type> MakeIterator () const override
32 {
34 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
35 }
36 virtual size_t size () const override
37 {
39 return fData_.size ();
40 }
41 virtual bool empty () const override
42 {
44 return fData_.empty ();
45 }
46 virtual void Apply (const function<void (ArgByValueType<value_type> item)>& doToElement, Execution::SequencePolicy seq) const override
47 {
49 fData_.Apply (doToElement, seq);
50 }
51 virtual Iterator<value_type> Find (const function<bool (ArgByValueType<value_type> item)>& that,
52 [[maybe_unused]] Execution::SequencePolicy seq) const override
53 {
55 if (auto i = fData_.Find (that)) {
56 return Iterator<value_type>{make_unique<IteratorRep_> (&fChangeCounts_, i)};
57 }
58 return nullptr;
59 }
60
61 // Queue<T>::_IRep overrides
62 public:
63 virtual shared_ptr<typename Queue<T>::_IRep> CloneEmpty () const override
64 {
65 return Memory::MakeSharedPtr<Rep_> ();
66 }
67 virtual void AddTail (ArgByValueType<value_type> item) override
68 {
70 fData_.push_back (item);
71 fChangeCounts_.PerformedChange ();
72 }
73 virtual value_type RemoveHead () override
74 {
76 T item = fData_.GetAt (0);
77 fData_.RemoveAt (0);
78 fChangeCounts_.PerformedChange ();
79 return item;
80 }
81 virtual optional<value_type> RemoveHeadIf () override
82 {
84 if (fData_.empty ()) {
85 return optional<value_type>{};
86 }
87 T item = fData_.GetAt (0);
88 fData_.RemoveAt (0);
89 fChangeCounts_.PerformedChange ();
90 return item;
91 }
92 virtual value_type Head () const override
93 {
95 return fData_.GetAt (0);
96 }
97 virtual optional<value_type> HeadIf () const override
98 {
100 if (fData_.empty ()) {
101 return optional<value_type>{};
102 }
103 return fData_.GetAt (0);
104 }
105
106 private:
107 using DataStructureImplType_ = DataStructures::Array<value_type>;
108 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
109
110 private:
111 DataStructureImplType_ fData_;
112 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
113 };
114
115 /*
116 ********************************************************************************
117 ********************************** Queue_Array<T> ******************************
118 ********************************************************************************
119 */
120 template <typename T>
122 : inherited{Memory::MakeSharedPtr<Rep_> ()}
123 {
124 AssertRepValidType_ ();
125 }
126 template <typename T>
127 inline Queue_Array<T>::Queue_Array (const initializer_list<value_type>& src)
128 : Queue_Array{}
129 {
130 this->reserve (src.size ());
131 AddAllToTail (src);
132 AssertRepValidType_ ();
133 }
134#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
135 template <typename T>
136 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
137 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Queue_Array<T>>)
138 inline Queue_Array<T>::Queue_Array (ITERABLE_OF_ADDABLE&& src)
139 : Queue_Array{}
140 {
142 this->reserve (src.size ());
143 }
144 AddAllToTail (forward<ITERABLE_OF_ADDABLE> (src));
145 AssertRepValidType_ ();
146 }
147#endif
148 template <typename T>
149 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
150 inline Queue_Array<T>::Queue_Array (ITERATOR_OF_ADDABLE&& start, ITERATOR_OF_ADDABLE&& end)
151 : Queue_Array{}
152 {
153 if constexpr (random_access_iterator<ITERATOR_OF_ADDABLE>) {
154 if (start != end) {
155 this->reserve (end - start);
156 }
157 }
158 AddAllToTail (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (end));
159 AssertRepValidType_ ();
160 }
161 template <typename T>
162 inline void Queue_Array<T>::AssertRepValidType_ () const
163 {
165 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{this}; // for side-effect of AssertMemeber
166 }
167 }
168
169}
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Definition Assertions.h:48
Queue_Array<T> is an Array-based concrete implementation of the Queue<T> container pattern.
Definition Queue_Array.h:36
nonvirtual value_type Head() const
Definition Queue.inl:73
nonvirtual void AddAllToTail(ITERABLE_OF_ADDABLE &&s)
nonvirtual optional< value_type > RemoveHeadIf()
Definition Queue.inl:99
nonvirtual value_type RemoveHead()
Definition Queue.inl:88
nonvirtual void AddTail(ArgByValueType< value_type > item)
Definition Queue.inl:63
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
Concept checks if the given type T has a const size() method which can be called to return a size_t.
Definition Concepts.h:361
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...