-
Notifications
You must be signed in to change notification settings - Fork 4
/
sort.go
63 lines (49 loc) · 1.06 KB
/
sort.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
package effective
import "github.com/dnovikoff/tempai-core/tile"
type sSortId uint32
func newSortId(uCount, tCount, value int) sSortId {
val := (13 - sSortId(value))
val = (val << 8) | sSortId(uCount)
val = (val << 8) | sSortId(tCount)
return val
}
func (id sSortId) betterThan(other sSortId) bool {
return id > other
}
type ResultsSorted []*Result
func (r ResultsSorted) Best() *Result {
if len(r) == 0 {
return nil
}
return r[0]
}
func (r ResultsSorted) Len() int {
return len(r)
}
func (r ResultsSorted) Swap(i, j int) {
r[i], r[j] = r[j], r[i]
}
func tileSortId(t tile.Tile) int {
return (tilePriority(t) << 8) | int(t)
}
func tileLess(l, r tile.Tile) bool {
return tileSortId(l) < tileSortId(r)
}
func effLess(l, r *Result) bool {
lhs, rhs := l.sortId, r.sortId
if lhs.betterThan(rhs) {
return true
} else if rhs.betterThan(lhs) {
return false
}
return tileLess(l.Tile, r.Tile)
}
func (r ResultsSorted) Less(i, j int) bool {
return effLess(r[i], r[j])
}
func (r ResultsSorted) First() *Result {
if len(r) == 0 {
return nil
}
return r[0]
}