data-structures/queue_8h_source.html

#ifndef QUEUE_H

#define QUEUE_H


typedef struct queue Queue;


#define EMPTY_QUEUE (Queue*) 0

#ifndef QUEUE_STATIC_MAX

#define QUEUE_STATIC_MAX 1000000

#endif


Queue* queue_create(void);


int queue_empty(Queue *q);


void queue_insert(Queue *q, int data);


int queue_remove(Queue *q);


void queue_print(Queue *q);


void queue_println(Queue *q);


void queue_free(Queue *q);


void queue_reverse(Queue *q);


int queue_greater_than(Queue *q, int n);


int queue_evens(Queue *q);


#endif

queue_print
void queue_print(Queue *q)
Prints the elements of a queue to the console.

queue_evens
int queue_evens(Queue *q)
Counts the number of even elements in a queue.

queue_reverse
void queue_reverse(Queue *q)
Reverses the elements of a queue.

queue_insert
void queue_insert(Queue *q, int data)
Inserts an element at the back of a queue.

queue_remove
int queue_remove(Queue *q)
Removes and returns the element at the front of a queue.

queue_greater_than
int queue_greater_than(Queue *q, int n)
Counts the number of elements in a queue that are greater than a given value.

queue_free
void queue_free(Queue *q)
Frees the memory allocated for a queue.

queue_create
Queue * queue_create(void)
Creates an empty queue.

queue_println
void queue_println(Queue *q)
Prints the elements of a queue to the console, followed by a newline character.

queue_empty
int queue_empty(Queue *q)
Checks if a queue is empty.

Queue
struct queue Queue
A queue data structure.
Definition queue.h:19