FreeRDP
Queue.c File Reference
#include <winpr/crt.h>
#include <winpr/assert.h>
#include <winpr/collections.h>

Functions

size_t Queue_Count (wQueue *queue)
 
void Queue_Lock (wQueue *queue)
 
void Queue_Unlock (wQueue *queue)
 
HANDLE Queue_Event (wQueue *queue)
 
wObject * Queue_Object (wQueue *queue)
 
void Queue_Clear (wQueue *queue)
 
BOOL Queue_Contains (wQueue *queue, const void *obj)
 
static BOOL Queue_EnsureCapacity (wQueue *queue, size_t count)
 
BOOL Queue_Enqueue (wQueue *queue, void *obj)
 
void * Queue_Dequeue (wQueue *queue)
 
void * Queue_Peek (wQueue *queue)
 
static BOOL default_queue_equals (const void *obj1, const void *obj2)
 
wQueue * Queue_New (BOOL synchronized, SSIZE_T capacity, SSIZE_T growthFactor)
 
void Queue_Free (wQueue *queue)
 

Function Documentation

◆ default_queue_equals()

static BOOL default_queue_equals ( const void *  obj1,
const void *  obj2 
)
static
Here is the caller graph for this function:

◆ Queue_Clear()

void Queue_Clear ( wQueue *  queue)

Methods Removes all objects from the Queue.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_Contains()

BOOL Queue_Contains ( wQueue *  queue,
const void *  obj 
)

Determines whether an element is in the Queue.

Here is the call graph for this function:

◆ Queue_Count()

size_t Queue_Count ( wQueue *  queue)

C equivalent of the C# Queue Class: http://msdn.microsoft.com/en-us/library/system.collections.queue.aspx Properties Gets the number of elements contained in the Queue.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_Dequeue()

void* Queue_Dequeue ( wQueue *  queue)

Removes and returns the object at the beginning of the Queue.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_Enqueue()

BOOL Queue_Enqueue ( wQueue *  queue,
void *  obj 
)

Adds an object to the end of the Queue.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_EnsureCapacity()

static BOOL Queue_EnsureCapacity ( wQueue *  queue,
size_t  count 
)
static
Here is the caller graph for this function:

◆ Queue_Event()

HANDLE Queue_Event ( wQueue *  queue)

Gets an event which is set when the queue is non-empty

Here is the caller graph for this function:

◆ Queue_Free()

void Queue_Free ( wQueue *  queue)
Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_Lock()

void Queue_Lock ( wQueue *  queue)

Lock access to the ArrayList

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_New()

wQueue* Queue_New ( BOOL  synchronized,
SSIZE_T  capacity,
SSIZE_T  growthFactor 
)

Construction, Destruction

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_Object()

wObject* Queue_Object ( wQueue *  queue)
Here is the caller graph for this function:

◆ Queue_Peek()

void* Queue_Peek ( wQueue *  queue)

Returns the object at the beginning of the Queue without removing it.

Here is the call graph for this function:
Here is the caller graph for this function:

◆ Queue_Unlock()

void Queue_Unlock ( wQueue *  queue)

Unlock access to the ArrayList

Here is the call graph for this function:
Here is the caller graph for this function: