4#include "Stroika/Foundation/Containers/DataStructures/DoublyLinkedList.h"
5#include "Stroika/Foundation/Containers/Private/IteratorImplHelper.h"
18 class Deque_DoublyLinkedList<T>::Rep_ :
public Deque<T>::_IRep,
public Memory::UseBlockAllocationIfAppropriate<Rep_> {
20 using inherited =
typename Deque<T>::_IRep;
24 Rep_ (
const Rep_& from) =
default;
27 nonvirtual Rep_& operator= (
const Rep_&) =
delete;
31 virtual shared_ptr<typename Iterable<T>::_IRep> Clone ()
const override
34 return Memory::MakeSharedPtr<Rep_> (*
this);
36 virtual Iterator<value_type>
MakeIterator ()
const override
39 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_)};
41 virtual size_t size ()
const override
44 return fData_.size ();
46 virtual bool empty ()
const override
49 return fData_.empty ();
51 virtual void Apply (
const function<
void (ArgByValueType<value_type> item)>& doToElement, [[maybe_unused]]
Execution::SequencePolicy seq)
const override
54 fData_.Apply (doToElement);
56 virtual Iterator<value_type>
Find (
const function<
bool (ArgByValueType<value_type> item)>& that,
60 if (
auto iLink = fData_.Find (that)) {
61 return Iterator<value_type>{make_unique<IteratorRep_> (&fData_, &fChangeCounts_, iLink)};
68 virtual shared_ptr<typename Queue<T>::_IRep> CloneEmpty ()
const override
70 return Memory::MakeSharedPtr<Rep_> ();
72 virtual void AddTail (ArgByValueType<value_type> item)
override
75 fData_.push_back (item);
76 fChangeCounts_.PerformedChange ();
81 T item = Memory::ValueOf (fData_.GetFirst ());
82 fData_.RemoveFirst ();
83 fChangeCounts_.PerformedChange ();
89 if (fData_.empty ()) {
92 T item = Memory::ValueOf (fData_.GetFirst ());
93 fData_.RemoveFirst ();
94 fChangeCounts_.PerformedChange ();
97 virtual value_type
Head ()
const override
100 return Memory::ValueOf (fData_.GetFirst ());
102 virtual optional<value_type> HeadIf ()
const override
105 return fData_.GetFirst ();
110 virtual void AddHead (ArgByValueType<value_type> item)
override
113 fData_.push_back (item);
114 fChangeCounts_.PerformedChange ();
119 value_type item = Memory::ValueOf (fData_.GetFirst ());
120 fData_.RemoveLast ();
121 fChangeCounts_.PerformedChange ();
124 virtual value_type Tail ()
const override
127 return Memory::ValueOf (fData_.GetLast ());
131 using DataStructureImplType_ = DataStructures::DoublyLinkedList<value_type>;
132 using IteratorRep_ = Private::IteratorImplHelper_<value_type, DataStructureImplType_>;
135 DataStructureImplType_ fData_;
136 [[no_unique_address]] Private::ContainerDebugChangeCounts_ fChangeCounts_;
144 template <
typename T>
146 :
inherited{Memory::MakeSharedPtr<Rep_> ()}
148 AssertRepValidType_ ();
150 template <
typename T>
155 AssertRepValidType_ ();
157#if !qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
158 template <
typename T>
159 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
160 requires (not derived_from<remove_cvref_t<ITERABLE_OF_ADDABLE>, Deque_DoublyLinkedList<T>>)
162 : Deque_DoublyLinkedList{}
164 this->AddAllToTail (forward<ITERABLE_OF_ADDABLE> (src));
165 AssertRepValidType_ ();
168 template <
typename T>
169 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
171 : Deque_DoublyLinkedList{}
173 this->
AddAllToTail (forward<ITERATOR_OF_ADDABLE> (start), forward<ITERATOR_OF_ADDABLE> (
end));
174 AssertRepValidType_ ();
176 template <
typename T>
177 inline void Deque_DoublyLinkedList<T>::AssertRepValidType_ ()
const
180 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...
Deque_DoublyLinkedList<T> is an Array-based concrete implementation of the Deque<T> container pattern...
nonvirtual value_type RemoveTail()
nonvirtual void AddHead(ArgByValueType< value_type > item)
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,...