4#ifndef _Stroika_Foundation_Containers_Concrete_Queue_Array_h_
5#define _Stroika_Foundation_Containers_Concrete_Queue_Array_h_
7#include "Stroika/Foundation/StroikaPreComp.h"
51 template <IIterableOfTo<T> ITERABLE_OF_ADDABLE>
54#if qCompilerAndStdLib_RequiresNotMatchInlineOutOfLineForTemplateClassBeingDefined_Buggy
61 AssertRepValidType_ ();
65 template <IInputIterator<T> ITERATOR_OF_ADDABLE>
78 nonvirtual
void AssertRepValidType_ ()
const;
89#include "Queue_Array.inl"
Queue_Array<T> is an Array-based concrete implementation of the Queue<T> container pattern.
ArrayBasedContainer is a Stroika implementation detail, but its public methods are fair game and full...
nonvirtual void reserve(size_t slotsAlloced)
A Queue is a first-in-first-out (FIFO) data structure, where elements are arranged in well-ordered fa...
nonvirtual void AddAllToTail(ITERABLE_OF_ADDABLE &&s)
typename inherited::value_type value_type
nonvirtual CONTAINER_OF_T As(CONTAINER_OF_T_CONSTRUCTOR_ARGS... args) const
static constexpr default_sentinel_t end() noexcept
Support for ranged for, and STL syntax in general.
Concept checks if the given type T has a const size() method which can be called to return a size_t.