4#include "Stroika/Foundation/Containers/DataStructures/DoublyLinkedList.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
13 class Queue_DoublyLinkedList<T>::Rep_ :
public Queue<T>::_IRep,
public Memory::UseBlockAllocationIfAppropriate<Rep_> {
15 using inherited =
typename Queue<T>::_IRep;
19 Rep_ (
const Rep_& from) =
default;
22 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
26 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
29 return Memory::MakeSharedPtr<Rep_> (*
this);
31 virtual Iterator<value_type>
MakeIterator ()
const override
34 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
36 virtual size_t size ()
const override
39 return fData_.size ();
41 virtual bool empty ()
const override
44 return fData_.empty ();
46 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
49 fData_.Apply (doToElement);
51 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
55 if (
auto iLink = fData_.Find (that)) {
56 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iLink)};
63 virtual shared_ptr<typename Queue<T>::_IRep> CloneEmpty ()
const override
65 return Memory::MakeSharedPtr<Rep_> ();
67 virtual void AddTail (ArgByValueType<T> item)
override
70 fData_.push_back (item);
71 fChangeCounts_.PerformedChange ();
76 value_type item = Memory::ValueOf (fData_.GetFirst ());
77 fData_.RemoveFirst ();
78 fChangeCounts_.PerformedChange ();
84 if (fData_.empty ()) {
85 return optional<value_type>{};
87 value_type item = Memory::ValueOf (fData_.GetFirst ());
88 fData_.RemoveFirst ();
89 fChangeCounts_.PerformedChange ();
92 virtual value_type
Head ()
const override
95 return Memory::ValueOf (fData_.GetFirst ());
97 virtual optional<value_type> HeadIf ()
const override
100 return fData_.GetFirst ();
104 using DataStructureImplType_ = DataStructures::DoublyLinkedList<value_type>;
105 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
108 DataStructureImplType_ fData_;
109 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
117 template <
typename T>
119 :
inherited{Memory::MakeSharedPtr<Rep_> ()}
121 AssertRepValidType_ ();
123 template <
typename T>
128 AssertRepValidType_ ();
130#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
131 template <
typename T>
132 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
133 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Queue_DoublyLinkedList<T>>)
135 : Queue_DoublyLinkedList{}
137 this->AddAllToTail (forward<ITERABLE_OF_ADDABLE> (src));
138 AssertRepValidType_ ();
141 template <
typename T>
142 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
144 : Queue_DoublyLinkedList{}
146 this->
AddAllToTail (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
147 AssertRepValidType_ ();
149 template <
typename T>
150 inline void Queue_DoublyLinkedList<T>::AssertRepValidType_ ()
const
153 typename inherited::template _SafeReadRepAccessor<Rep_> tmp{
this};
#define qStroika_Foundation_Debug_AssertionsChecked
The qStroika_Foundation_Debug_AssertionsChecked flag determines if assertions are checked and validat...
Queue_DoublyLinkedList<T> is an Array-based concrete implementation of the Queue<T> container pattern...
A Queue is a first-in-first-out (FIFO) data structure, where elements are arranged in well-ordered fa...
nonvirtual value_type Head() const
nonvirtual void AddAllToTail(ITERABLE_OF_ADDABLE &&s)
nonvirtual optional< value_type > RemoveHeadIf()
nonvirtual value_type RemoveHead()
nonvirtual void AddTail(ArgByValueType< value_type > item)
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.
nonvirtual bool empty() const
Returns true iff size() == 0.
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'.
SequencePolicy
equivalent which of 4 types being used std::execution::sequenced_policy, parallel_policy,...