|
Data Structures UFC
1.0.0
Essential Data Structures for C language
|
Go to the source code of this file.
Typedefs | |
| typedef struct queue | Queue |
Functions | |
| Queue * | queue_create (void) |
| Create a new queue. More... | |
| int | queue_empty (Queue *q) |
| Check if the queueis empty. More... | |
| void | queue_insert (Queue *q, int data) |
| Insert a new elemet on the queue. More... | |
| int | queue_remove (Queue *q) |
| Remove and return the first element on the queue. More... | |
| void | queue_print (Queue *q) |
| Print the queue (wthout newline) More... | |
| void | queue_println (Queue *q) |
| Print the queue (wth a newline) More... | |
| void | queue_free (Queue *q) |
| Free memory of thequeue structure. More... | |
| void | queue_reverse (Queue *q) |
| Reverse the elemens of the queue. More... | |
| int | queue_greater_than (Queue *q, int n) |
Count the number o elements greater than n. More... | |
| int | queue_evens (Queue *q) |
| Count the number o even elements on Queue. More... | |
| typedef struct queue Queue |
| Queue* queue_create | ( | void | ) |
Create a new queue.
| int queue_empty | ( | Queue * | q | ) |
Check if the queueis empty.
| int queue_evens | ( | Queue * | q | ) |
Count the number o even elements on Queue.
| void queue_free | ( | Queue * | q | ) |
Free memory of thequeue structure.
| int queue_greater_than | ( | Queue * | q, |
| int | n | ||
| ) |
Count the number o elements greater than n.
| void queue_insert | ( | Queue * | q, |
| int | data | ||
| ) |
Insert a new elemet on the queue.
| void queue_print | ( | Queue * | q | ) |
Print the queue (wthout newline)
| void queue_println | ( | Queue * | q | ) |
Print the queue (wth a newline)
| int queue_remove | ( | Queue * | q | ) |
Remove and return the first element on the queue.
| void queue_reverse | ( | Queue * | q | ) |
Reverse the elemens of the queue.
1.8.11
