-
Notifications
You must be signed in to change notification settings - Fork 0
/
Trienode.cpp
140 lines (134 loc) · 2.7 KB
/
Trienode.cpp
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
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
#include "Trienode.h"
Trienode::Trienode():value(-1)
{
sibling=NULL;
child=NULL;
list=NULL;
}
Trienode::~Trienode()
{
if(list!=NULL)
delete(list);
if(child!=NULL)
delete(child);
if(sibling!=NULL)
delete(sibling);
}
void Trienode::insert(char* token,int id)
{
if(value==-1 || value==token[0])
{
value=token[0];
if(strlen(token)==1)
{
if(list==NULL)
list=new listnode(id);
list->add(id);
}
else
{
if(child==NULL)
child=new Trienode();
child->insert(token+1,id);
}
}
else
{
if(sibling==NULL)
sibling=new Trienode();
sibling->insert(token,id);
}
return;
}
int Trienode::tfsearchword(int id,char* word,int curr)
{
if(word[curr]==value)
{
if(curr==strlen(word)-1)
{
if(list!=NULL)
return list->search(id);
else
return 0;
}
else
{
if(child!=NULL)
return child->tfsearchword(id,word,curr+1);
else
return 0;
}
}
else
{
if(sibling!=NULL)
return sibling->tfsearchword(id,word,curr);
else
return 0;
}
}
int Trienode::dsearchword(char* word,int curr)
{
if(word[curr]==value)
{
if(curr==strlen(word)-1)
{
if(list!=NULL)
return list->volume();
else
return 0;
}
else
{
if(child!=NULL)
return child->dsearchword(word,curr+1);
else
return 0;
}
}
else
{
if(sibling!=NULL)
return sibling->dsearchword(word,curr);
else
return 0;
}
}
void Trienode::dsearchall(char* buffer,int curr)
{
buffer[curr]=value;
if(list!=NULL)
cout<<buffer<<" "<<list->volume()<<endl;
if(child!=NULL)
child->dsearchall(buffer,curr+1);
if(sibling!=NULL)
sibling->dsearchall(buffer,curr);
buffer[curr]='\0';
}
void Trienode::search(char* word,int curr,Scorelist* scorelist)
{
if(word[curr]==value)
{
if(curr==strlen(word)-1)
{
if(list!=NULL)
return list->passdocuments(scorelist);
else
return;
}
else
{
if(child!=NULL)
child->search(word,curr+1,scorelist);
else
return;
}
}
else
{
if(sibling!=NULL)
sibling->search(word,curr,scorelist);
else
return;
}
}