-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy pathdice.go
171 lines (165 loc) · 3.08 KB
/
dice.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
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
package main
import (
"math/rand"
"regexp"
"sort"
"strconv"
)
var regex = regexp.MustCompile(`(?i)(?P<op>[×*/^v+-])?\s*((?P<num>\d*)d(?P<sides>[f%]|\d+)(?P<explode>!)?(?P<max>[<>]\d{1,4})?(?P<keep>k-?\d{1,3})?|(?P<alt>\d{1,5})(?P<fudge>f)?)( for (?P<for>[^,;]+))?`)
const (
Add = "+"
Subtract = "-"
Multiply = "*"
Divide = "/"
Max = "^"
Min = "v"
)
type Dice struct {
Operator string
Number int
Sides int
Minimum int
Maximum int
Keep int
Rolls []int
Removed []int
Explode bool
Fudge bool
Total int
For string
}
func Parse(text string) []*Dice {
var rolls []*Dice
for _, m := range regex.FindAllStringSubmatch(text, 8) {
dice := &Dice{
Operator: Add,
Number: 2,
Sides: 6,
}
for i, name := range regex.SubexpNames() {
switch name {
case "op":
if m[i] == "×" {
dice.Operator = "*"
} else if m[i] != "" {
dice.Operator = m[i]
}
case "explode":
dice.Explode = m[i] != ""
case "fudge":
if m[i] != "" {
dice.Fudge = true
dice.Sides = 3
}
case "alt":
if m[i] != "" {
num, _ := strconv.Atoi(m[i])
dice.Number = num
dice.Sides = 1
}
case "num":
num, err := strconv.Atoi(m[i])
if err != nil {
num = 1
}
if num > 100 {
num = 100
}
dice.Number = num
case "sides":
if m[i] == "" {
dice.Sides = 6
} else if m[i] == "f" || m[i] == "F" {
dice.Fudge = true
dice.Sides = 3
} else if m[i] == "%" {
dice.Sides = 100
} else {
dice.Sides, _ = strconv.Atoi(m[i])
if dice.Sides < 1 {
dice.Sides = 0
}
if dice.Sides > 1000000 {
dice.Sides = 1000000
}
}
case "keep":
if m[i] == "" {
break
}
dice.Keep, _ = strconv.Atoi(m[i][1:])
if dice.Keep > dice.Number {
dice.Keep = dice.Number
} else if dice.Keep < -dice.Number {
dice.Keep = -dice.Number
}
case "max":
if m[i] == "" {
break
}
if m[i][0] == '>' {
dice.Minimum, _ = strconv.Atoi(m[i][1:])
if dice.Minimum >= dice.Sides {
dice.Minimum = dice.Sides - 1
}
} else {
dice.Maximum, _ = strconv.Atoi(m[i][1:])
if dice.Maximum < 2 {
dice.Maximum = 2
}
}
case "for":
dice.For = m[i]
}
}
rolls = append(rolls, dice)
}
if len(rolls) == 0 {
rolls = append(rolls, &Dice{
Operator: Add,
Number: 2,
Sides: 6,
})
}
return rolls
}
func (r *Dice) Roll() {
r.Total = 0
r.Rolls = []int{}
if r.Sides == 0 {
r.Total = 0
return
}
if r.Sides == 1 {
r.Total = r.Number
return
}
num := r.Number
for i := 0; i < num; i++ {
n := rand.Intn(r.Sides) + 1
if r.Fudge {
n -= 2
}
r.Total += n
r.Rolls = append(r.Rolls, n)
if r.Explode && n == r.Sides {
num++
}
}
if r.Keep != 0 {
sort.Ints(r.Rolls)
if r.Keep > 0 {
split := len(r.Rolls) - r.Keep
r.Removed = r.Rolls[:split]
r.Rolls = r.Rolls[split:]
} else {
split := -r.Keep
r.Removed = r.Rolls[split:]
r.Rolls = r.Rolls[:split]
}
r.Total = 0
for _, n := range r.Rolls {
r.Total += n
}
}
}