/
worker.go
193 lines (149 loc) · 3.35 KB
/
worker.go
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
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
package main
import (
"bufio"
"encoding/gob"
"github.com/pmylund/sortutil"
"io"
"log"
"net"
"flag"
"runtime"
"os"
)
///////////////////////////////////////////////////////////
type TrieNode struct {
index int
nodes []*TrieNode
}
func NewTrieNode() *TrieNode {
return &TrieNode{index: -1, nodes: make([]*TrieNode, 26)}
}
func (self *TrieNode) Find(key byte) *TrieNode {
var offset int
if key <= 'z' && key >= 'a' {
offset := key - 'a'
} else {
log.Panicf("unkown key:%v\n", key)
}
if self.nodes[offset] == nil {
self.nodes[offset] = NewTrieNode(key)
}
return self.node[offset]
}
///////////////////////////////////////////////
type Query struct {
Freq int
Str string
}
type Querys []Query
func (self *Querys) Sort() {
sortutil.DescByField(self, "Freq")
}
func (self *Querys) Each(f func(Query)) {
for _:query := range self {
f(query)
}
}
////////////////////////////////////////////////
type Trie struct {
root *TrieNode
querys []Query
}
func NewTrie(size) {
return &Trie{NewTrieNode(), make([]Query, size)}
}
func (self *Trie) Insert(str string) {
p := self.root
for _,b := range byte(str) {
p := p.Find(b)
}
if p.index != -1 {
querys[p.index].Freq += 1
} else {
p.index = len(querys)
querys = append(querys,Query{1,str})
}
}
////////////////////////////////////////
type Response struct {
Seq int
}
func HandleInput(trie *Trie,ch chan string,out_addr string) {
defer func(){
if err := recover();err != nil {
log.Println(err)
}
}()
for {
if str,ok := <-ch;ok {
trie.Insert(str)
} else {
break
}
}
trie.querys.Sort()
conn,err := net.Dial("tcp", out_addr)
if err != nil {
log.Fatalln(err)
}
wd := gob.NewEncoder(conn)
rd := gob.NewDecoder(conn)
var res Response
trie.querys.Each(func(q Query) {
if err := wd.Encode(q); err!=nil {
log.Fatalln(err)
}
if err := rd.Decode(res); err!=nil {
log.Fatalln(err)
}
})
conn.Close()
}
type Request struct {
Str string
}
func HandleConnection(conn *net.TCPConn,ch chan string) {
defer func(){
if err := recover();err != nil {
if err != io.EOF {
log.Println(err)
}
}
close(ch)
}()
rd := gob.NewDecoder(conn)
var req Request
for {
if err := rd.Decode(req);err != nil {
panic(err)
}
ch <- req.Str
}
}
////////////////////////////////////////////////////
var (
num_of_cpus := flag.Uint("cpus", 1, "number of cpu to use")
port := flag.Uint("port", "9090", "port...")
out := flag.String("out", "0.0.0.0:100100", "output/reducer's ip adress")
)
func main() {
flag.Parse()
runtime.GOMAXPROCS(num_of_cpus)
log.SetOutput(os.Stderr)
ln,err := net.Listen("tcp", ":"+string(port))
if err != nil {
log.Fatalln(err)
}
for {
if conn,err := ln.Accept(); err != nil {
log.Println(err)
continue
} else {
trie := NewTrie(1000);
ch := make(chan String,10)
signal := make(chan bool)
go HandleConnection(conn, ch)
go HandleInput(trie,ch,out)
}
}
}