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

Functions

int Queue_Count (wQueue *queue)
 
void Queue_Lock (wQueue *queue)
 
void Queue_Unlock (wQueue *queue)
 
HANDLE Queue_Event (wQueue *queue)
 
void Queue_Clear (wQueue *queue)
 
BOOL Queue_Contains (wQueue *queue, void *obj)
 
BOOL Queue_Enqueue (wQueue *queue, void *obj)
 
voidQueue_Dequeue (wQueue *queue)
 
voidQueue_Peek (wQueue *queue)
 
static BOOL default_queue_equals (const void *obj1, const void *obj2)
 
wQueue * Queue_New (BOOL synchronized, int capacity, int growthFactor)
 
void Queue_Free (wQueue *queue)
 

Function Documentation

static BOOL default_queue_equals ( const void obj1,
const void obj2 
)
static

Here is the caller graph for this function:

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:

BOOL Queue_Contains ( wQueue *  queue,
void obj 
)

Determines whether an element is in the Queue.

Here is the call graph for this function:

int Queue_Count ( wQueue *  queue)

WinPR: Windows Portable Runtime System.Collections.Queue

Copyright 2012 Marc-Andre Moreau marca.nosp@m.ndre.nosp@m..more.nosp@m.au@g.nosp@m.mail..nosp@m.com

Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. 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:

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:

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:

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:

void Queue_Free ( wQueue *  queue)

Here is the call graph for this function:

Here is the caller graph for this function:

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:

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

Construction, Destruction

Here is the call graph for this function:

Here is the caller graph for this function:

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:

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: