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
|
/*
igraph library.
Copyright (C) 2010-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard st, Cambridge MA, 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#include <igraph.h>
#include "core/marked_queue.h"
#include "test_utilities.h"
int main(void) {
igraph_marked_queue_int_t Q;
igraph_int_t i;
igraph_marked_queue_int_init(&Q, 100);
for (i = 0; i < 50; i++) {
igraph_marked_queue_int_push(&Q, i);
if (!igraph_marked_queue_int_iselement(&Q, i)) {
return 4;
}
if (! ((i + 1) % 5)) {
igraph_marked_queue_int_start_batch(&Q);
}
}
for (i = 1; i < 50; i++) {
if (!igraph_marked_queue_int_iselement(&Q, i)) {
printf("Problem with %" IGRAPH_PRId ".\n", i);
return 3;
}
}
for (i = 0; i <= 50 / 5; i++) {
if (igraph_marked_queue_int_empty(&Q)) {
return 1;
}
igraph_marked_queue_int_pop_back_batch(&Q);
}
if (!igraph_marked_queue_int_empty(&Q)) {
return 2;
}
igraph_marked_queue_int_destroy(&Q);
VERIFY_FINALLY_STACK();
return 0;
}
|
