a4ef278c
bjeanlou
init withHash
|
1
2
3
4
5
6
|
#ifndef TREEH_H
#define TREEH_H
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
|
4043090f
bjeanlou
update2 withHash
|
7
|
#include <stdbool.h>
|
cf53766d
bjeanlou
update2 dico
|
8
|
#include <ctype.h>
|
a4ef278c
bjeanlou
init withHash
|
9
|
|
de5faa60
bjeanlou
Update isEnd
|
10
|
#define NBCHAR 26 //A-Z
|
a4ef278c
bjeanlou
init withHash
|
11
|
|
003d3e48
bjeanlou
update6 withHash
|
12
13
14
15
16
17
|
#define COMMON_END 0x03
#define PROPER_END 0x0B
#define ACRONYME_END 0x30
#define STRAIGHT_END 0X15
#define APOSTROPHE_END 0X2A
|
f48297ea
bjeanlou
Update1 treeh
|
18
|
typedef char *string,byte;
|
4043090f
bjeanlou
update2 withHash
|
19
|
typedef struct _node node, *tree;
|
0bc3d1ad
bjeanlou
dico created
|
20
|
struct _node{
|
a4ef278c
bjeanlou
init withHash
|
21
|
char letter;
|
f48297ea
bjeanlou
Update1 treeh
|
22
|
byte isEnd;
|
de5faa60
bjeanlou
Update isEnd
|
23
|
//0 no,1 yes,+2 if ends with 's
|
17b49163
bjeanlou
Update2 treeh
|
24
|
//*4 if proper, *16 if allUpper
|
4043090f
bjeanlou
update2 withHash
|
25
26
|
node* next[NBCHAR];
};
|
a4ef278c
bjeanlou
init withHash
|
27
|
|
de5faa60
bjeanlou
Update isEnd
|
28
29
|
tree make_empty_tree();//create a null node*
node* make_empty_node();//malloc a node and initialize it
|
f48297ea
bjeanlou
Update1 treeh
|
30
|
node* make_node(char,byte);//id
|
de5faa60
bjeanlou
Update isEnd
|
31
32
|
void delete_tree(tree);//free(tree) and delete tree on all t->next
|
f48297ea
bjeanlou
Update1 treeh
|
33
34
|
bool is_empty(const tree);//==NULL
bool is_followed(const tree);//if true tree has following letters
|
de5faa60
bjeanlou
Update isEnd
|
35
|
|
003d3e48
bjeanlou
update6 withHash
|
36
37
38
|
bool is_end(const tree);//true when at least 1 of the following functions is true
bool is_straight_end(const tree);//if true word can end here
bool ends_with_apostrophe(const tree);//if true word can end here with apostrophe
|
f48297ea
bjeanlou
Update1 treeh
|
39
40
41
|
bool is_common_end(const tree);//if true all letters are lower
bool is_proper_end(const tree);//if true 1st letter is upper
bool is_acronyme_end(const tree);//if true all letters are upper
|
4043090f
bjeanlou
update2 withHash
|
42
|
|
0bc3d1ad
bjeanlou
dico created
|
43
|
int hash(char);//need to check if isalpha
|
11c78e6d
bjeanlou
update5 withHash
|
44
45
46
|
bool ischar_of_word(char);//tells if char can be in a word
bool is_word(byte endKind);//pass end_kind() as parameter
byte end_kind(string);
|
a4ef278c
bjeanlou
init withHash
|
47
|
|
11c78e6d
bjeanlou
update5 withHash
|
48
|
//recursive can only be called in a addto_dico
|
f48297ea
bjeanlou
Update1 treeh
|
49
50
|
bool addto_tree(tree,const string,byte);
void addto_tree2(tree,const string,byte);
|
a4ef278c
bjeanlou
init withHash
|
51
|
|
a4ef278c
bjeanlou
init withHash
|
52
|
|
a4ef278c
bjeanlou
init withHash
|
53
|
#endif //TREEH_H
|