a4ef278c
bjeanlou
init withHash
|
1
2
|
#include "treeh.h"
|
4043090f
bjeanlou
update2 withHash
|
3
|
//initializers & destroyer
|
a637cab8
bjeanlou
update1 withHash
|
4
5
6
|
tree make_empty_tree(){
return NULL;
}
|
4043090f
bjeanlou
update2 withHash
|
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
node* make_empty_node(){
node*n=malloc(sizeof(node));
n->letter='\0';
n->isEnd=false;
for(int i=0;i<NBCHAR;i++)
n->next[i]=make_empty_tree();
}
node* make_node(char l,bool end){
node*n=malloc(sizeof(node));
n->letter=l;
n->isEnd=end;
for(int i=0;i<NBCHAR;i++)
n->next[i]=make_empty_tree();
}
void delete_tree(tree t){
if(is_empty(t))return;
for(int i=0;i<NBCHAR;i++)
delete_tree(t->next[i]);
free(t);
|
a637cab8
bjeanlou
update1 withHash
|
26
|
}
|
a637cab8
bjeanlou
update1 withHash
|
27
|
|
4043090f
bjeanlou
update2 withHash
|
28
29
30
31
32
33
34
|
//Casual functions
bool is_empty(tree t){
return t==NULL;
}
bool is_followed(tree t){
|
a637cab8
bjeanlou
update1 withHash
|
35
36
37
|
int i;
for(i=0;i<NBCHAR;i++){
if(t->next[i]!=NULL)
|
4043090f
bjeanlou
update2 withHash
|
38
|
return true;
|
a637cab8
bjeanlou
update1 withHash
|
39
|
}
|
4043090f
bjeanlou
update2 withHash
|
40
|
return false;
|
a637cab8
bjeanlou
update1 withHash
|
41
|
}
|
4043090f
bjeanlou
update2 withHash
|
42
43
|
bool is_end(tree t){
return t->isEnd;
|
a637cab8
bjeanlou
update1 withHash
|
44
|
}
|
a637cab8
bjeanlou
update1 withHash
|
45
|
int hash(char c){
|
4043090f
bjeanlou
update2 withHash
|
46
|
//needs to check c wether isalpha or '\''
|
a637cab8
bjeanlou
update1 withHash
|
47
48
|
if(c='\'')
return 0;
|
395ede86
bjeanlou
update3 withHash
|
49
|
return c%32;
|
a637cab8
bjeanlou
update1 withHash
|
50
|
}
|
4043090f
bjeanlou
update2 withHash
|
51
52
53
54
|
//
|
395ede86
bjeanlou
update3 withHash
|
55
|
bool addto_tree(tree t,string s,unsigned int index,bool isIn){
|
4043090f
bjeanlou
update2 withHash
|
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
|
//recursive, when called : set isIn to true
//return wether s is already in t or not
if(s[0]=='\0'){
t->isEnd=true;
return isIn;
}
if(t->next[hash(s[0])]==NULL)
t->next[hash(s[0])]=make_node(s[0],false);
}
void addto_tree2(tree t,string s){
//faster than addto_tree, used when it is knowned the word is not yet in dictionnary
if(s[0]=='\0'){
t->isEnd=true;
return;
}
t->next[hash(s[0])]=make_node(s[0],false);
addto_tree2(t->next[hash(s[0])],
}
void loadfrom_file(tree,FILE*){}
void loadfrom_keyboard(tree){}
|