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
|
/**
* 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 3 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, see
* <http://www.gnu.org/licenses/>.
*
* (c) Vincenzo Nicosia 2009-2017 -- <v.nicosia@qmul.ac.uk>
*
* This file is part of NetBunch, a package for complex network
* analysis and modelling. For more information please visit:
*
* http://www.complex-networks.net/
*
* If you use this software, please add a reference to
*
* V. Latora, V. Nicosia, G. Russo
* "Complex Networks: Principles, Methods and Applications"
* Cambridge University Press (2017)
* ISBN: 9781107103184
*
***********************************************************************
*/
#ifndef __ILTREE_H__
#define __ILTREE_H__
typedef struct node{
void* info;
struct node* left;
struct node* right;
} node_t;
typedef struct{
void* (*alloc)();
void (*dealloc)(void*);
void (*copy)(void *src, void *dst);
int (*compare)(void*, void*);
void (*print)(void*, void*);
void *fileout;
} ilfunc_t;
typedef struct {
node_t* root;
ilfunc_t funs;
} iltree_struct_t;
typedef iltree_struct_t* iltree_t;
void iltree_set_funs(iltree_t, ilfunc_t *);
void iltree_destroy(iltree_t);
void iltree_empty(iltree_t);
void iltree_insert(iltree_t, void*);
void* iltree_lookup(iltree_t, void*);
void iltree_view_pre(iltree_t);
iltree_t iltree_create(iltree_t);
void iltree_empty_cache(iltree_t);
void iltree_map(iltree_t, void (*func)(void*));
void iltree_map_args(iltree_t, void (*func)(void*, void*), void*);
void* iltree_get_fileout(iltree_t t);
void iltree_set_fileout(iltree_t t, void *f);
void* iltree_getmin(iltree_t t);
void* iltree_getmax(iltree_t t);
#endif /* __ILTREE_H__*/
|
