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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
package index
import "fmt"
import "os"
import "io"
import "bufio"
import "sort"
import "errors"
import "strings"
import "strconv"
/* TODO
- Implement Forward Creation
- Implement Inverted from Forward
- Switch Indexer.go over to this package
/*********
* Types *
*********/
type F_info struct {
Word string;
In_title bool;
Freq float64;
};
type I_info struct {
Doc string;
In_title bool;
Freq float64;
};
type F_entry struct{
This *F_info;
Next *F_entry;
};
type I_entry struct{
This *I_info;
Next *I_entry;
};
type F_index map[string]*F_entry;
type I_index map[string]*I_entry;
type sortInverted struct{
w string;
root *I_entry;
};
/***************************
* Forward Index Funcitons *
***************************/
func NewForwardEntryStrings(text, title []string) (*F_entry, error) {
return nil, errors.New("not implemented");
}
/****************************
* Inverted Index Functions *
****************************/
func new_I_info() *I_info{
return &I_info{"", false, 0.0};
}
func NewInvertedIndexFromFile(fname string) (I_index, error) {
var fd *os.File;
var br *bufio.Reader;
var err error;
var buf []byte;
var tmp *I_info;
var cur *I_entry;
var index I_index;
var word string
var info []string;
fd, err = os.Open(fname);
if err != nil {
return nil, err;
}
br = bufio.NewReader(fd);
if br == nil {
return nil, errors.New("Could not initialize reader");
}
index = make(I_index);
for buf, err = br.ReadBytes('\n'); err != io.EOF; buf, err = br.ReadBytes('\n'){
tmp = new_I_info();
if err != nil {
return nil, err;
}
if buf[0] != '\t' {
word = strings.TrimSpace(string(buf));
} else {
info = strings.Fields(string(buf));
tmp.Doc = info[0];
tmp.In_title = (info[1] == "1");
tmp.Freq, _ = strconv.ParseFloat(info[2], 32);
if (index[word] == nil) {
index[word] = &I_entry{This: tmp, Next: nil};
} else {
cur = index[word];
for cur.Next != nil {
cur = cur.Next;
}
cur.Next = &I_entry{This: tmp, Next: nil};
}
}
}
return index, nil;
}
func NewInvertedFromForward(f F_index) (I_index, error) {
return nil, errors.New("not implemented");
}
func (x I_index) PrintToFile(fd *os.File) error{
var i int;
var cur *I_entry;
var index []sortInverted;
index = x.sortIndex();
for i = 0; i < len(index); i++ {
fmt.Fprintf(fd, "%s\n", index[i].w);
for cur = index[i].root; cur != nil; cur = cur.Next {
fmt.Fprintf(fd, "\t%s %d %.3f\n", cur.This.Doc, toInt(cur.This.In_title), cur.This.Freq);
}
}
return nil;
}
func toInt(t bool) int{
if (t){
return 1;
}
return 0;
}
func (unsort I_index) sortIndex() []sortInverted {
var i int;
var sorted []sortInverted;
sorted = make([]sortInverted, len(unsort));
i = 0;
for k, v := range unsort {
sorted[i].w = k;
sorted[i].root = v;
i++;
}
sort.Slice(sorted, func(i, j int) bool {
return sorted[i].w < sorted[j].w;
});
return sorted
}
|
