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
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006 Gabor Csardi <csardi@rmki.kfki.hu>
MTA RMKI, Konkoly-Thege Miklos st. 29-33, Budapest 1121, Hungary
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>
int main() {
igraph_stack_t st;
int i;
/* igraph_stack_init, igraph_stack_destroy */
igraph_stack_init(&st, 0);
igraph_stack_destroy(&st);
igraph_stack_init(&st, 10);
igraph_stack_destroy(&st);
/* igraph_stack_reserve */
igraph_stack_init(&st, 0);
igraph_stack_reserve(&st, 10);
igraph_stack_reserve(&st, 5);
/* igraph_stack_empty */
if (!igraph_stack_empty(&st)) {
return 1;
}
igraph_stack_push(&st, 1);
if (igraph_stack_empty(&st)) {
return 2;
}
/* igraph_stack_size */
if (igraph_stack_size(&st) != 1) {
return 3;
}
for (i=0; i<10; i++) {
igraph_stack_push(&st, i);
}
if (igraph_stack_size(&st) != 11) {
return 4;
}
/* igraph_stack_clear */
igraph_stack_clear(&st);
if (!igraph_stack_empty(&st)) {
return 5;
}
igraph_stack_push(&st, 100);
if (igraph_stack_pop(&st) != 100) {
return 6;
}
igraph_stack_clear(&st);
igraph_stack_clear(&st);
/* igraph_stack_push, igraph_stack_pop */
for (i=0; i<100; i++) {
igraph_stack_push(&st, 100-i);
}
for (i=0; i<100; i++) {
if (igraph_stack_pop(&st) != i+1) {
return 7;
}
}
if (!igraph_stack_empty(&st)) {
return 8;
}
igraph_stack_destroy(&st);
if (IGRAPH_FINALLY_STACK_SIZE() != 0) return 9;
return 0;
}
|
