-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.go
132 lines (115 loc) · 1.88 KB
/
utils.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
package WaveFunctionCollapse
import "image/color"
type WFCError string
func (e WFCError) Error() string {
return string(e)
}
func addIfNotExists(color color.Color, colors *[]color.Color) int {
for i, ref := range *colors {
if ColorEquals(color, ref) {
return i
}
}
*colors = append(*colors, color)
return len(*colors) - 1
}
type RGBA struct {
R, G, B, A uint32
}
func NewRGBA(R, G, B, A uint32) RGBA {
return RGBA{R, G, B, A}
}
func ColorEquals(c1, c2 color.Color) bool {
rgba1 := NewRGBA(c1.RGBA())
rgba2 := NewRGBA(c2.RGBA())
return rgba1 == rgba2
}
func newUintMatrix(w, h int) [][]uint8 {
mat := make([][]uint8, w)
for i := range mat {
mat[i] = make([]uint8, h)
}
return mat
}
func SymmetryFunc(symmetry string) (a, b func(int) int, cardinality int) {
switch symmetry {
case "L":
cardinality = 4
a = func(i int) int {
return (i + 1) % 4
}
b = func(i int) int {
if i%2 == 0 {
return i + 1
} else {
return i - 1
}
}
case "T":
cardinality = 4
a = func(i int) int {
return (i + 1) % 4
}
b = func(i int) int {
if i%2 == 0 {
return i
} else {
return 4 - i
}
}
case "I":
cardinality = 2
a = func(i int) int {
return 1 - i
}
b = func(i int) int {
return i
}
case "\\":
cardinality = 2
a = func(i int) int {
return 1 - i
}
b = func(i int) int {
return 1 - i
}
default:
cardinality = 1
a = func(i int) int {
return i
}
b = func(i int) int {
return i
}
}
return
}
func RandomDistribution(a []float64, r float64) int {
sum := SumDistribution(a)
if sum == 0 {
for j := range a {
a[j] = 1
}
sum = SumDistribution(a)
}
for j := range a {
a[j] /= sum
}
i := 0
x := float64(0)
n := len(a)
for i < n {
x += a[i]
if r <= x {
return i
}
i++
}
return 0
}
func SumDistribution(a []float64) (sum float64) {
for _, v := range a {
sum += v
}
return
}