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
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
|
/*
* Ouroboros - Copyright (C) 2016 - 2017
*
* Reordering queue test
*
* Dimitri Staessens <dimitri.staessens@ugent.be>
* Sander Vrijders <sander.vrijders@ugent.be>
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public License
* version 2.1 as published by the Free Software Foundation.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., http://www.fsf.org/about/contact/.
*/
#include <ouroboros/rq.h>
#include <stdio.h>
#define Q_SIZE 5
int rq_test(int argc,
char ** argv)
{
struct rq * q;
int i;
(void) argc;
(void) argv;
q = rq_create(Q_SIZE);
if (q == NULL) {
printf("Failed to create.\n");
return -1;
}
if (rq_push(q, 1, 1)) {
printf("Failed to insert.\n");
return -1;
}
if (!rq_has(q, 1)) {
printf("Inserted item not present.\n");
return -1;
}
if (rq_peek(q) != 1) {
printf("Inserted item not present.\n");
return -1;
}
if (rq_pop(q) != 1) {
printf("Bad pop.\n");
return -1;
}
if (rq_push(q, 3, 5)) {
printf("Failed to insert.\n");
return -1;
}
if (rq_push(q, 1, 3)) {
printf("Failed to insert.\n");
return -1;
}
if (rq_push(q, 2, 7)) {
printf("Failed to insert.\n");
return -1;
}
if (!rq_has(q, 3)) {
printf("Inserted item not present.\n");
return -1;
}
if (rq_has(q, 4)) {
printf("Item present that was not inserted.\n");
return -1;
}
if (rq_peek(q) != 1) {
printf("Inserted item not present.\n");
return -1;
}
if (rq_pop(q) != 3) {
printf("Bad pop.\n");
return -1;
}
if (rq_peek(q) != 2) {
printf("Inserted item not present.\n");
return -1;
}
if (rq_pop(q) != 7) {
printf("Bad pop.\n");
return -1;
}
for (i = 0; i < Q_SIZE + 1; i++)
rq_push(q, i, i);
rq_destroy(q);
return 0;
}
|
