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
|
package data
import (
"fmt"
"math"
)
import "strconv"
const maxDigits = 6
func ff(x float64) string {
minExact := strconv.FormatFloat(x, 'g', -1, 64)
fixed := strconv.FormatFloat(x, 'g', maxDigits, 64)
if len(minExact) < len(fixed) {
return minExact
}
return fixed
}
type Bin struct {
LeftInclusive float64
Right float64
RightInclusive bool
Count uint64
CountNorm float64
}
func (b *Bin) String() string {
if b.RightInclusive {
return fmt.Sprintf("[%s,%s]", ff(b.LeftInclusive), ff(b.Right))
}
return fmt.Sprintf("[%s,%s)", ff(b.LeftInclusive), ff(b.Right))
}
type Bins struct {
Number int
min, max float64
numPoints int
}
func BinsSqrt(numPoints int) int {
return int(math.Sqrt(float64(numPoints)))
}
func BinsSturges(numPoints int) int {
return int(math.Ceil(math.Log2(float64(numPoints))) + 1)
}
func BinsRice(numPoints int) int {
return int(math.Ceil(2 * math.Pow(float64(numPoints), 1.0/3.0)))
}
func NewBins(points []float64) *Bins {
bins := new(Bins)
bins.numPoints = len(points)
bins.Number = 5
bins.min = math.Inf(1)
bins.max = math.Inf(-1)
for _, x := range points {
bins.min = math.Min(bins.min, x)
bins.max = math.Max(bins.max, x)
}
return bins
}
func (b *Bins) left(i int) float64 {
return b.min + ((b.max - b.min) / float64(b.Number) * float64(i))
}
func (b *Bins) right(i int) float64 {
return b.left(i + 1)
}
func (b *Bins) All() (out []Bin) {
if b.max == b.min {
b.Number = 1
}
for i := 0; i < b.Number; i++ {
out = append(out, Bin{
LeftInclusive: b.left(i),
Right: b.right(i),
})
}
out[b.Number-1].RightInclusive = true
return
}
func (b *Bins) Point(x float64) int {
if b.max == b.min {
return 0
}
i := int((x - b.min) / (b.max - b.min) * float64(b.Number))
if i >= b.Number {
i--
}
return i
}
func Histogram(points []float64, bins *Bins) (out []Bin) {
out = bins.All()
for _, b := range out {
b.Count = 0
}
for _, x := range points {
out[bins.Point(x)].Count++
}
return
}
type Bins2D struct {
X *Bins
Y *Bins
}
func NewBins2D(points [][2]float64) *Bins2D {
bins := new(Bins2D)
xs := make([]float64, len(points))
ys := make([]float64, len(points))
for i := range points {
xs[i] = points[i][0]
ys[i] = points[i][1]
}
bins.X = NewBins(xs)
bins.Y = NewBins(ys)
return bins
}
func Histogram2D(points [][2]float64, bins *Bins2D) (x, y []Bin, z [][]uint64) {
x = bins.X.All()
y = bins.Y.All()
z = make([][]uint64, len(y))
for _, b := range x {
b.Count = 0
}
for i, b := range y {
z[i] = make([]uint64, len(x))
b.Count = 0
}
for _, p := range points {
i := bins.X.Point(p[0])
j := bins.Y.Point(p[1])
x[i].Count++
y[j].Count++
z[i][j]++
}
return
}
|
