-
Notifications
You must be signed in to change notification settings - Fork 0
/
selector.go
85 lines (70 loc) · 1.96 KB
/
selector.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
/*
* Copyright 2017, Robert Bieber
*
* This file is part of dailyhindsight.
*
* dailyhindsight is free software: you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* dailyhindsight is distributed in the hope that it will be useful,
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with dailyhindsight. If not, see <http://www.gnu.org/licenses/>.
*/
package main
import (
"log"
"math/rand"
"os"
"sort"
"sync"
"time"
)
const maxQueuedSelections = 1024
const selectTopN = 20
type selectionList []DailySelection
func SelectSynchronously(
config Config,
selection *DailySelection,
selectionLock *sync.RWMutex,
) {
log.Println("Beginning selection process")
results := []DailySelection{}
fetchTime := time.Now()
RunLimited(func(set Dataset) {
result, err := GetRequest(config.APIKey, fetchTime, set)
if err != nil {
log.Println(err)
return
}
results = append(results, DailySelection{set, result, fetchTime})
})
sort.Sort(sort.Reverse(selectionList(results)))
selectionLock.Lock()
*selection = results[rand.Intn(selectTopN)]
selectionLock.Unlock()
cacheFout, err := os.Create(config.TempFile)
defer cacheFout.Close()
if err != nil {
log.Println("Error opening selection cache file")
}
err = WriteBackup(cacheFout, *selection)
if err != nil {
log.Println("Error writing selection cache")
}
log.Println("Completed selection process")
}
func (l selectionList) Len() int {
return len(l)
}
func (l selectionList) Less(i, j int) bool {
return l[i].NewValue/l[i].OldValue < l[j].NewValue/l[j].OldValue
}
func (l selectionList) Swap(i, j int) {
l[i], l[j] = l[j], l[i]
}