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
116
117
118
|
// Gmsh - Copyright (C) 1997-2021 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// issues on https://gitlab.onelab.info/gmsh/gmsh/issues.
//
// Contributor(s):
// Marc Ume
//
#include <stdlib.h>
#include <string.h>
#include "MallocUtils.h"
#include "TreeUtils.h"
Tree_T *Tree_Create(int size, int (*fcmp)(const void *a, const void *b))
{
Tree_T *tree = (Tree_T *)Malloc(sizeof(Tree_T));
tree->size = size;
tree->root = avl_init_table(fcmp);
return tree;
}
void Tree_Delete(Tree_T *tree)
{
if(!tree) return;
avl_free_table(tree->root, Free, nullptr);
Free(tree);
}
void Tree_Delete(Tree_T *tree, void (*freefn)(void *))
{
if(!tree) return;
avl_free_table(tree->root, freefn, nullptr);
Free(tree);
}
void *Tree_Add(Tree_T *tree, void *data)
{
if(!tree) return nullptr;
void *ptr = Malloc(tree->size);
memcpy(ptr, data, tree->size);
avl_insert(tree->root, ptr, ptr);
return ptr;
}
int Tree_Nbr(Tree_T *tree)
{
if(!tree) return 0;
return avl_count(tree->root);
}
int Tree_Insert(Tree_T *tree, void *data)
{
if(!Tree_Search(tree, data)) {
Tree_Add(tree, data);
return 1;
}
return 0;
}
int Tree_Search(Tree_T *tree, void *data)
{
if(!tree) return 0;
void *ptr;
return avl_lookup(tree->root, data, &ptr);
}
int Tree_Query(Tree_T *tree, void *data)
{
if(!tree) return 0;
void *ptr;
if(!avl_lookup(tree->root, data, &ptr)) return 0;
memcpy(data, ptr, tree->size);
return 1;
}
void *Tree_PQuery(Tree_T *tree, void *data)
{
if(!tree) return nullptr;
void *ptr;
if(!avl_lookup(tree->root, data, &ptr)) return nullptr;
return ptr;
}
int Tree_Suppress(Tree_T *tree, void *data)
{
if(!tree) return 0;
void *ptr = data;
if(!avl_delete(tree->root, &ptr, &ptr)) return 0;
Free(ptr);
return 1;
}
int Tree_Size(Tree_T *tree)
{
if(!tree) return 0;
return tree->size;
}
void Tree_Action(Tree_T *tree, void (*action)(void *data, void *dummy))
{
if(!tree) return;
avl_foreach(tree->root, action, AVL_FORWARD);
}
static List_T *pListTransfer;
void TransferList(void *a, void *b) { List_Add(pListTransfer, a); }
List_T *Tree2List(Tree_T *pTree)
{
int Nb;
Nb = Tree_Nbr(pTree);
if(Nb == 0) Nb = 1;
pListTransfer = List_Create(Nb, Nb, Tree_Size(pTree));
Tree_Action(pTree, TransferList);
return pListTransfer;
}
|
