-
Notifications
You must be signed in to change notification settings - Fork 1
/
queue.h
53 lines (43 loc) · 1.62 KB
/
queue.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
#pragma once
/*
* queue.h -- public interface to the queue module
*/
#include <stdint.h>
#include <stdbool.h>
/* the queue representation is hidden from users of the module */
typedef void queue_t;
/* create an empty queue */
queue_t* qopen(void);
/* deallocate a queue, frees everything in it */
void qclose(queue_t *qp);
/* put element at the end of the queue
* returns 0 is successful; nonzero otherwise
*/
int32_t qput(queue_t *qp, void *elementp);
/* get the first first element from queue, removing it from the queue */
void* qget(queue_t *qp);
/* apply a function to every element of the queue */
void qapply(queue_t *qp, void (*fn)(void* elementp));
/* search a queue using a supplied boolean function
* skeyp -- a key to search for
* searchfn -- a function applied to every element of the queue
* -- elementp - a pointer to an element
* -- keyp - the key being searched for (i.e. will be
* set to skey at each step of the search
* -- returns TRUE or FALSE as defined in bool.h
* returns a pointer to an element, or NULL if not found
*/
void* qsearch(queue_t *qp,
bool (*searchfn)(void* elementp,const void* keyp),
const void* skeyp);
/* search a queue using a supplied boolean function (as in qsearch),
* removes the element from the queue and returns a pointer to it or
* NULL if not found
*/
void* qremove(queue_t *qp,
bool (*searchfn)(void* elementp,const void* keyp),
const void* skeyp);
/* concatenatenates elements of q2 into q1
* q2 is dealocated, closed, and unusable upon completion
*/
void qconcat(queue_t *q1p, queue_t *q2p);