58 template<
int STACK_SIZE>
103template<
class TYPE>
void
115template<
class TYPE>
void
126template<
class TYPE>
bool
137template<
class TYPE>
void
148template<
class TYPE>
SizeT
151 return this->
queue.Size();
157template<
class TYPE>
bool
161 bool isEmpty = this->
queue.IsEmpty();
169template<
class TYPE>
void
173 this->
queue.Enqueue(e);
184template<
class TYPE>
void
188 this->
queue.Enqueue(std::move(e));
199template<
class TYPE>
void
205 this->
queue.Enqueue(i);
217template<
class TYPE> TYPE
221 TYPE e = this->
queue.Dequeue();
229template<
class TYPE> TYPE
234 if (!this->
queue.IsEmpty())
236 e = this->
queue.Dequeue();
245template<
class TYPE>
void
249#if NEBULA_ENABLE_PERFORMANCE_WARNINGS
250 n_warn_fmt(outArray.
Capacity() >= this->queue.Size(),
"SafeQueue::DequeueAll(): (PERFORMANCE) Output array is too small (%d), requires (%d), array will have to grow.\n", outArray.
Capacity(), this->queue.Size());
265template<
int STACK_SIZE>
270#if NEBULA_ENABLE_PERFORMANCE_WARNINGS
271 n_warn_fmt(outArray.
Capacity() >= this->queue.Size(),
"SafeQueue::DequeueAll(): (PERFORMANCE) Output array is too small (%d), requires (%d), array will have to grow.\n", outArray.
Capacity(), this->queue.Size());
285template<
class TYPE> TYPE
289 TYPE e = this->
queue.Peek();
297template<
class TYPE>
void
309template<
class TYPE>
void
324template<
class TYPE>
void
333template<
class TYPE>
void
338 for (i = this->
queue.Size() - 1; i >= 0; i--)
340 if (e == this->
queue[i])
342 this->
queue.EraseIndex(i);
Critical section objects are used to protect a portion of code from parallel execution.
void DequeueAll(Util::Array< TYPE > &outArray)
dequeue all events (only requires one lock)
Definition safequeue.h:246
void Signal()
signal the internal event, so that Wait() will return
Definition safequeue.h:325
void EnqueueArray(const Util::Array< TYPE > &a)
enqueue an array of elements
Definition safequeue.h:200
TYPE Peek() const
access to element at front of queue without removing it
Definition safequeue.h:286
TYPE DequeueSafe(const TYPE &failed)
remove the element from the front of the queue and returns the failed object if empty
Definition safequeue.h:230
void EraseMatchingElements(const TYPE &e)
erase all matching elements
Definition safequeue.h:334
SafeQueue(const SafeQueue< TYPE > &rhs)
copy constructor
Definition safequeue.h:92
bool IsEmpty() const
return true if queue is empty
Definition safequeue.h:158
void DequeueAll(Util::Array< TYPE, STACK_SIZE > &outArray)
Dequeue all events to an array with a stack size.
Definition safequeue.h:267
void WaitTimeout(int ms)
wait until queue contains at least one element, or time-out happens
Definition safequeue.h:310
void SetSignalOnEnqueueEnabled(bool b)
enable/disable signalling on Enqueue() (default is enabled)
Definition safequeue.h:116
Event enqueueEvent
Definition safequeue.h:73
void Enqueue(const TYPE &e)
add element to the back of the queue
Definition safequeue.h:170
void Wait()
wait until queue contains at least one element
Definition safequeue.h:298
Util::Queue< TYPE > queue
Definition safequeue.h:75
bool signalOnEnqueueEnabled
Definition safequeue.h:74
TYPE Dequeue()
remove the element from the front of the queue
Definition safequeue.h:218
bool IsSignalOnEnqueueEnabled() const
return signalling-on-Enqueue() flag
Definition safequeue.h:127
SizeT Size() const
returns number of elements in the queue
Definition safequeue.h:149
void operator=(const SafeQueue< TYPE > &rhs)
assignment operator
Definition safequeue.h:104
SafeQueue()
constructor
Definition safequeue.h:82
void Clear()
remove all elements from the queue
Definition safequeue.h:138
void Enqueue(TYPE &&e)
Definition safequeue.h:185
CriticalSection criticalSection
Definition safequeue.h:72
Nebula's dynamic array class.
Definition array.h:60
const SizeT Capacity() const
get overall allocated size of array in number of elements
Definition array.h:900
void Clear()
clear array (calls destructors)
Definition array.h:1207
void Append(const TYPE &first, const ELEM_TYPE &... elements)
Append multiple elements to the end of the array.
Definition array.h:1334
Nebula's queue class (a FIFO container).
Definition queue.h:28
#define n_warn_fmt(exp, msg,...)
Definition debug.h:56
The Jobs2 system provides a set of threads and a pool of jobs from which threads can pickup work.
Definition jobs2.h:16
int SizeT
Definition types.h:42
int IndexT
Definition types.h:41