tlds
Transactional Operations for Linked Data Structures
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
queue.c File Reference
#include <assert.h>
#include <stdlib.h>
#include <string.h>
#include "random.h"
#include "tm.h"
#include "types.h"
#include "queue.h"
Include dependency graph for queue.c:

Classes

struct  queue
 

Enumerations

enum  config { QUEUE_GROWTH_FACTOR = 2 }
 

Functions

queue_tqueue_alloc (long initCapacity)
 
queue_tPqueue_alloc (long initCapacity)
 
queue_tTMqueue_alloc (TM_ARGDECL long initCapacity)
 
void queue_free (queue_t *queuePtr)
 
void Pqueue_free (queue_t *queuePtr)
 
void TMqueue_free (TM_ARGDECL queue_t *queuePtr)
 
bool_t queue_isEmpty (queue_t *queuePtr)
 
void queue_clear (queue_t *queuePtr)
 
void TMqueue_clear (TM_ARGDECL queue_t *queuePtr)
 
bool_t TMqueue_isEmpty (TM_ARGDECL queue_t *queuePtr)
 
void queue_shuffle (queue_t *queuePtr, random_t *randomPtr)
 
bool_t queue_push (queue_t *queuePtr, void *dataPtr)
 
bool_t Pqueue_push (queue_t *queuePtr, void *dataPtr)
 
bool_t TMqueue_push (TM_ARGDECL queue_t *queuePtr, void *dataPtr)
 
void * queue_pop (queue_t *queuePtr)
 
void * TMqueue_pop (TM_ARGDECL queue_t *queuePtr)
 

Enumeration Type Documentation

enum config
Enumerator
QUEUE_GROWTH_FACTOR 

Function Documentation

queue_t* Pqueue_alloc ( long  initCapacity)
void Pqueue_free ( queue_t queuePtr)
bool_t Pqueue_push ( queue_t queuePtr,
void *  dataPtr 
)
queue_t* queue_alloc ( long  initCapacity)

Here is the caller graph for this function:

void queue_clear ( queue_t queuePtr)

Here is the caller graph for this function:

void queue_free ( queue_t queuePtr)

Here is the caller graph for this function:

bool_t queue_isEmpty ( queue_t queuePtr)

Here is the caller graph for this function:

void* queue_pop ( queue_t queuePtr)

Here is the caller graph for this function:

bool_t queue_push ( queue_t queuePtr,
void *  dataPtr 
)

Here is the caller graph for this function:

void queue_shuffle ( queue_t queuePtr,
random_t randomPtr 
)

Here is the call graph for this function:

Here is the caller graph for this function:

queue_t* TMqueue_alloc ( TM_ARGDECL long  initCapacity)
void TMqueue_clear ( TM_ARGDECL queue_t queuePtr)
void TMqueue_free ( TM_ARGDECL queue_t queuePtr)
bool_t TMqueue_isEmpty ( TM_ARGDECL queue_t queuePtr)
void* TMqueue_pop ( TM_ARGDECL queue_t queuePtr)
bool_t TMqueue_push ( TM_ARGDECL queue_t queuePtr,
void *  dataPtr 
)