Commit c6a945134c85da577eb23e53031073da3e373eee
1 parent
435232c3
treeh.ch OK
Showing
2 changed files
with
4 additions
and
2 deletions
Show diff stats
treeh.c
@@ -74,7 +74,8 @@ bool addto_tree(tree t,string s){ | @@ -74,7 +74,8 @@ bool addto_tree(tree t,string s){ | ||
74 | addto_tree(t->next[hash(s[0])],s+1,isIn); | 74 | addto_tree(t->next[hash(s[0])],s+1,isIn); |
75 | } | 75 | } |
76 | void addto_tree2(tree t,string s){ | 76 | void addto_tree2(tree t,string s){ |
77 | - //faster than addto_treeused when it is knowned the word is not yet in dictionnary | 77 | + //faster than addto_tree |
78 | + //used when it is known the word is not yet in dictionnary | ||
78 | if(s[0]=='\0'){ | 79 | if(s[0]=='\0'){ |
79 | t->isEnd=true; | 80 | t->isEnd=true; |
80 | return; | 81 | return; |
treeh.h
@@ -26,7 +26,8 @@ bool is_end(tree); | @@ -26,7 +26,8 @@ bool is_end(tree); | ||
26 | bool is_followed(tree);//tells if tree has following letters | 26 | bool is_followed(tree);//tells if tree has following letters |
27 | int hash(char); | 27 | int hash(char); |
28 | 28 | ||
29 | -void addto_tree(tree,char*,int); | 29 | +void addto_tree(tree,string,int); |
30 | +void addto_tree2(tree,string); | ||
30 | void loadfrom_file(tree,FILE*); | 31 | void loadfrom_file(tree,FILE*); |
31 | void loadfrom_keyboard(tree); | 32 | void loadfrom_keyboard(tree); |
32 | 33 |