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
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006-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 <stdio.h>
#include <igraph.h>
#include <igraph_types_internal.h>
int main() {
igraph_trie_t trie;
long int id;
int i;
char *str;
/* init */
igraph_trie_init(&trie, 0);
/* add and get values */
igraph_trie_get(&trie, "hello", &id); printf("hello: %li\n", id);
igraph_trie_get(&trie, "hepp", &id); printf("hepp: %li\n", id);
igraph_trie_get(&trie, "alma", &id); printf("alma: %li\n", id);
igraph_trie_get(&trie, "also", &id); printf("also: %li\n", id);
igraph_trie_get(&trie, "hello", &id); printf("hello: %li\n", id);
igraph_trie_get(&trie, "hepp", &id); printf("hepp: %li\n", id);
igraph_trie_get(&trie, "alma", &id); printf("alma: %li\n", id);
igraph_trie_get(&trie, "also", &id); printf("also: %li\n", id);
igraph_trie_get(&trie, "a", &id); printf("a: %li\n", id);
igraph_trie_get(&trie, "axon", &id); printf("axon: %li\n", id);
igraph_trie_get(&trie, "hello", &id); printf("hello: %li\n", id);
igraph_trie_get(&trie, "hepp", &id); printf("hepp: %li\n", id);
igraph_trie_get(&trie, "alma", &id); printf("alma: %li\n", id);
igraph_trie_get(&trie, "also", &id); printf("also: %li\n", id);
/* check for existence */
igraph_trie_check(&trie, "head", &id); printf("head: %li\n", id);
igraph_trie_check(&trie, "alma", &id); printf("alma: %li\n", id);
/* destroy */
igraph_trie_destroy(&trie);
/* the same with index */
igraph_trie_init(&trie, 1);
igraph_trie_get(&trie, "hello", &id); printf("hello: %li\n", id);
igraph_trie_get(&trie, "hepp", &id); printf("hepp: %li\n", id);
igraph_trie_get(&trie, "alma", &id); printf("alma: %li\n", id);
igraph_trie_get(&trie, "also", &id); printf("also: %li\n", id);
igraph_trie_get(&trie, "hello", &id); printf("hello: %li\n", id);
igraph_trie_get(&trie, "hepp", &id); printf("hepp: %li\n", id);
igraph_trie_get(&trie, "alma", &id); printf("alma: %li\n", id);
igraph_trie_get(&trie, "also", &id); printf("also: %li\n", id);
igraph_trie_get(&trie, "a", &id); printf("a: %li\n", id);
igraph_trie_get(&trie, "axon", &id); printf("axon: %li\n", id);
igraph_trie_get(&trie, "hello", &id); printf("hello: %li\n", id);
igraph_trie_get(&trie, "hepp", &id); printf("hepp: %li\n", id);
igraph_trie_get(&trie, "alma", &id); printf("alma: %li\n", id);
igraph_trie_get(&trie, "also", &id); printf("also: %li\n", id);
/* check for existence */
igraph_trie_check(&trie, "head", &id); printf("head: %li\n", id);
igraph_trie_check(&trie, "alma", &id); printf("alma: %li\n", id);
for (i=0; i<igraph_trie_size(&trie); i++) {
igraph_trie_idx(&trie, i, &str);
printf("%d: %s\n", i, str);
}
igraph_trie_destroy(&trie);
if (!IGRAPH_FINALLY_STACK_EMPTY) return 1;
return 0;
}
|
