-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathsource.go
More file actions
251 lines (219 loc) · 4.8 KB
/
Copy pathsource.go
File metadata and controls
251 lines (219 loc) · 4.8 KB
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
package disttopk
import (
// "fmt"
"bytes"
crand "crypto/rand"
"encoding/binary"
"io"
"math"
"math/rand"
"sort"
)
type ZipfSource struct {
MaxItems uint32
zipParam float64
zipNorm float64
}
func NewZipfSource(max uint32, param float64) ZipfSource {
var norm float64
norm = 0
i := uint32(1)
for i < max {
norm += math.Pow(float64(i), -param)
i++
}
return ZipfSource{max, param, norm}
}
type Item struct {
Id int
Score float64
}
func (t *Item) Serialize(w io.Writer) error {
id := uint32(t.Id)
if err := binary.Write(w, binary.BigEndian, &id); err != nil {
return err
}
if err := binary.Write(w, binary.BigEndian, &t.Score); err != nil {
return err
}
bytes := 4 + 8
rs := RECORD_SIZE
if bytes < rs {
//pad with random bytes
left := rs - bytes
b := make([]byte, left)
_, err := crand.Read(b)
if err != nil {
panic("wtf")
}
_, err = w.Write(b)
if err != nil {
panic("wtf")
}
} else {
panic("Really?")
}
return nil
}
func (t *Item) Deserialize(r io.Reader) error {
id := uint32(0)
if err := binary.Read(r, binary.BigEndian, &id); err != nil {
return err
}
t.Id = int(id)
if err := binary.Read(r, binary.BigEndian, &t.Score); err != nil {
return err
}
bytes := 4 + 8
rs := RECORD_SIZE
if bytes < rs {
left := rs - bytes
b := make([]byte, left)
if _, err := io.ReadFull(r, b); err != nil {
panic(err)
}
} else {
panic("Really?")
}
return nil
}
func (t Item) MarshalBinary() ([]byte, error) {
buf := new(bytes.Buffer)
if err := t.Serialize(buf); err != nil {
return nil, err
}
out := buf.Bytes()
//fmt.Println("Serializing", len(out))
return out, nil
}
func (t *Item) UnmarshalBinary(data []byte) error {
buf := bytes.NewReader(data)
return t.Deserialize(buf)
}
func NewItemList() ItemList {
return make([]Item, 0)
}
type ItemList []Item
func (il ItemList) Swap(i, j int) { il[i], il[j] = il[j], il[i] }
func (il ItemList) Len() int { return len(il) }
func (il ItemList) Less(i, j int) bool {
if il[i].Score == il[j].Score {
return il[i].Id < il[j].Id
}
return il[i].Score < il[j].Score
}
func (il ItemList) Append(i Item) ItemList { return append(il, i) }
func (il ItemList) Sort() { sort.Sort(sort.Reverse(il)) }
func (il ItemList) AddToMap(m map[int]float64) map[int]float64 {
if m == nil {
m = make(map[int]float64)
}
for _, item := range il {
score := m[item.Id]
m[item.Id] = score + item.Score
}
return m
}
func (il ItemList) AddToReverseIndexMap(m map[int]int) map[int]int {
if m == nil {
m = make(map[int]int)
}
for index, item := range il {
m[item.Id] = index
}
return m
}
func (il ItemList) AddToCountMap(m map[int]int) map[int]int {
if m == nil {
m = make(map[int]int)
}
for _, item := range il {
score := m[item.Id]
m[item.Id] = score + 1
}
return m
}
func (t ItemList) MakeHashTable() *HashTable {
ht_bits := uint8(math.Ceil(math.Log2(float64(t.Len()))))
ht := NewHashTable(ht_bits)
for _, v := range t {
ht.Insert(v.Id, v.Score)
}
return ht
}
/*
func (t *ItemList) Serialize(w io.Writer) error {
l := uint32(len(t))
if err := binary.Write(w, binary.BigEndian, &l); err != nil {
return err
}
for _, item := range t {
item.Serialize(w)
}
return nil
}*/
func MakeItemList(m map[int]float64) ItemList {
il := make([]Item, len(m))
i := 0
for k, v := range m {
il[i] = Item{k, v}
i++
}
return ItemList(il)
}
func (src *ZipfSource) GenerateItem(rank int, offset int) Item {
id := rand.Int()
// id = rank
//score := (float64(rank) + (float64(offset) * 0.1)) * 100
score := float64(int((math.Pow(float64(rank), -(src.zipParam))/src.zipNorm)*10000000 + float64(offset)))
//score := math.Pow(float64(rank), -(src.zipParam)) / src.zipNorm
return Item{id, score}
}
func (src *ZipfSource) GetList(offset int) ItemList {
l := make([]Item, 0, src.MaxItems)
i := uint32(1)
sum := 0.0
for i < src.MaxItems {
l = append(l, src.GenerateItem(int(i), offset))
sum += l[len(l)-1].Score
i++
}
//fmt.Println("sum = ", sum)
return ItemList(l)
}
func GetListSet(nlists int, nitems uint32, param float64, overlap float64) []ItemList {
src := NewZipfSource(nitems, param)
lists := make([]ItemList, nlists)
for k, _ := range lists {
lists[k] = src.GetList(k)
}
nOver := int(overlap * float64(nitems))
//nOver := 10
for i := 0; i <= nOver; i++ {
first := lists[0]
index := rand.Int() % len(first)
id := first[index].Id
for _, l := range lists[1:] {
index := rand.Int() % len(l)
//println("over", id, index, k)
l[index].Id = id
}
}
for k, l := range lists {
m := ItemList(l).AddToMap(nil)
//v, ok := m[2553153660041385501]
//println(v, ok)
l := MakeItemList(m)
l.Sort()
lists[k] = l
}
return lists
}
func GetTrueList(lists []ItemList) ItemList {
m := lists[0].AddToMap(nil)
for _, list := range lists[1:] {
list.AddToMap(m)
}
il := MakeItemList(m)
return il
}