Data Structures Lerax 1.0.0
Essential Data Structures for C language
Loading...
Searching...
No Matches
queue.h
Go to the documentation of this file.
1
12
13#ifndef QUEUE_H
14#define QUEUE_H
15
16typedef struct queue Queue;
17
18#define EMPTY_QUEUE (Queue*) 0
19#define QUEUE_STATIC_MAX 10
20
25
30
34void queue_insert(Queue *q, int data);
35
40
45
50
55
60
65
70
71
72#endif
void queue_print(Queue *q)
Print the queue (wthout newline)
int queue_evens(Queue *q)
Count the number o even elements on Queue.
void queue_reverse(Queue *q)
Reverse the elemens of the queue.
void queue_insert(Queue *q, int data)
Insert a new elemet on the queue.
int queue_remove(Queue *q)
Remove and return the first element on the queue.
int queue_greater_than(Queue *q, int n)
Count the number o elements greater than n.
void queue_free(Queue *q)
Free memory of thequeue structure.
struct queue Queue
Definition queue.h:16
Queue * queue_create(void)
Create a new queue.
void queue_println(Queue *q)
Print the queue (wth a newline)
int queue_empty(Queue *q)
Check if the queueis empty.