Stroika Library 3.0d16
 
Loading...
Searching...
No Matches
Queue_Factory.h
Go to the documentation of this file.
1/*
2 * Copyright(c) Sophist Solutions, Inc. 1990-2025. All rights reserved
3 */
4#ifndef _Stroika_Foundation_Containers_Concrete_Queue_Factory_h_
5#define _Stroika_Foundation_Containers_Concrete_Queue_Factory_h_
6
7#include "Stroika/Foundation/StroikaPreComp.h"
8
9/**
10 * \file
11 */
12
14 template <typename T>
15 class Queue;
16}
17
18namespace Stroika::Foundation::Containers::Factory {
19
20 /**
21 * \brief Singleton factory object - Used to create the default backend implementation of a Queue<> container; typically not called directly
22 *
23 * Note - you can override the underlying factory dynamically by calling Queue_Factory<T>::Register ().
24 *
25 * \note \em Thread-Safety <a href="Thread-Safety.md#C++-Standard-Thread-Safety">C++-Standard-Thread-Safety</a>
26 */
27 template <typename T>
29 public:
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");
32
33 public:
34 /**
35 * The type of object produced by the factory.
36 */
38
39 public:
40 /**
41 * Function type to create an ConstructedType object.
42 */
44
45 public:
46 /**
47 * Hints can be used in factory constructor to guide the choice of the best container implementation/backend.
48 */
49 struct Hints {
50 /**
51 */
52 optional<bool> fOptimizeForLookupSpeedOverUpdateSpeed;
53 };
54
55 public:
56 /**
57 * Construct a factory for producing new ConstructedType objects. The default is to use whatever was registered with
58 * Queue_Factory::Register (), but a specific factory can easily be constructed with provided arguments.
59 */
60 constexpr Queue_Factory ();
61 constexpr Queue_Factory (const Hints& hints);
62 constexpr Queue_Factory (const FactoryFunctionType& f);
63 constexpr Queue_Factory (const Queue_Factory&) = default;
64
65 public:
66 /**
67 * This can be called anytime, before main(), or after. BUT - beware, any calls to Register must
68 * be externally synchronized, meaning effectively that they must happen before the creation of any
69 * threads, to be safe. Also note, since this returns a const reference, any calls to Register() after
70 * a call to Default, even if synchronized, is suspect.
71 */
72 static const Queue_Factory& Default ();
73
74 public:
75 /**
76 * You can call this directly, but there is no need, as the Queue<T> CTOR does so automatically.
77 */
78 nonvirtual ConstructedType operator() () const;
79
80 public:
81 /**
82 * Register a default global factory for ConstructedType objects (of the templated type/parameters).
83 * No need to call, typically, as the default factory is generally fine.
84 *
85 * \par Example Usage
86 * \code
87 * Queue_Factory::Register(Queue_Factory{Queue_Factory::Hints{.fOptimizeForLookupSpeedOverUpdateSpeed=true});
88 * Queue_Factory::Register(); // or use defaults
89 * \endcode
90 *
91 * \note \em Thread-Safety <a href="Thread-Safety.md#C++-Standard-Thread-Safety">C++-Standard-Thread-Safety</a>
92 * BUT - special note/restriction - must be called before any threads call Association_Factory::Queue_Factory() OR
93 * Queue_Factory::Default(), which effectively means must be called at the start of main, but before creating any threads
94 * which might use the factory).
95 *
96 * \note this differs markedly from Stroika 2.1, where Register could be called anytime, and was internally synchronized.
97 *
98 * \note If you wanted a dynamically changeable factory (change after main), you could write one yourself with its own internal synchronization,
99 * set the global one here, then perform the changes to its internal structure through another API.
100 */
101 static void Register (const optional<Queue_Factory>& f = nullopt);
102
103 private:
104 FactoryFunctionType fFactory_;
105
106 private:
107 // function to assure magically constructed even if called before main
108 static Queue_Factory& AccessDefault_ ();
109 };
110}
111
112/*
113 ********************************************************************************
114 ******************************* Implementation Details *************************
115 ********************************************************************************
116 */
117#include "Queue_Factory.inl"
118
119#endif /*_Stroika_Foundation_Containers_Concrete_Queue_Factory_h_ */
Singleton factory object - Used to create the default backend implementation of a Queue<> container; ...
static void Register(const optional< Queue_Factory > &f=nullopt)
A Queue is a first-in-first-out (FIFO) data structure, where elements are arranged in well-ordered fa...
Definition Queue.h:95