blob: ced94b7ab772c8e56ac8ccc4bf8f78f5022abef6 (
plain)
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
|
package search
import (
"searchEngine/analyzer"
"searchEngine/index"
)
func Search(idx *index.InvertedIndex, query string) []string {
tokenizedQuery := analyzer.ProcessText(query)
if len(tokenizedQuery) == 0 {
return nil
}
idx.Mu.RLock()
defer idx.Mu.RUnlock()
firstToken := tokenizedQuery[0]
baseIDs, exists := idx.Data[firstToken]
if !exists {
return nil
}
intersection := make([]int, len(baseIDs))
copy(intersection, baseIDs)
for i := 1; i < len(tokenizedQuery); i++ {
token := tokenizedQuery[i]
nextIDs, exists := idx.Data[token]
if !exists {
return nil
}
lookup := make(map[int]struct{})
for _, id := range nextIDs {
lookup[id] = struct{}{}
}
var filtered []int
for _, id := range intersection {
if _, found := lookup[id]; found {
filtered = append(filtered, id)
}
}
intersection = filtered
}
var results []string
for _, id := range intersection {
if title, exists := idx.DocNames[id]; exists {
results = append(results, title)
}
}
return results
}
|
