4#ifndef _Stroika_Foundation_Containers_Concrete_Queue_Factory_h_
5#define _Stroika_Foundation_Containers_Concrete_Queue_Factory_h_
7#include "Stroika/Foundation/StroikaPreComp.h"
18namespace Stroika::Foundation::Containers::Factory {
30 static_assert (not is_reference_v<T>,
31 "typically if this fails its because a (possibly indirect) caller forgot to use forward<>(), or remove_cvref_t");
52 optional<bool> fOptimizeForLookupSpeedOverUpdateSpeed;
101 static void Register (
const optional<Queue_Factory>& f = nullopt);
117#include "Queue_Factory.inl"
Singleton factory object - Used to create the default backend implementation of a Queue<> container; ...
nonvirtual ConstructedType operator()() const
static const Queue_Factory & Default()
static void Register(const optional< Queue_Factory > &f=nullopt)
function< ConstructedType()> FactoryFunctionType
constexpr Queue_Factory()
Queue< T > ConstructedType
A Queue is a first-in-first-out (FIFO) data structure, where elements are arranged in well-ordered fa...