-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmatrix.go
More file actions
67 lines (59 loc) · 1.23 KB
/
matrix.go
File metadata and controls
67 lines (59 loc) · 1.23 KB
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
package randmatrix
import (
"errors"
"math/rand"
"time"
)
func CreateArray(x, y int, min int, max int) ([][]int, error) {
gen := NewIntGenerator(time.Now().UnixNano())
matrix := make([][]int, x)
for i := 0; i < x; i++ {
line := make([]int, y)
for j := 0; j < y; j++ {
v, err := gen.Unique(min, max)
if err != nil {
return nil, err
}
line[j] = v
}
matrix[i] = line
}
return matrix, nil
}
type IntGenerator struct {
seed int64
uniqueVals map[int]bool
}
func NewIntGenerator(seed int64) *IntGenerator {
g := new(IntGenerator)
rand.Seed(g.seed)
g.uniqueVals = map[int]bool{}
return g
}
var (
ErrInvalidRange = errors.New("invalid use of min and max value")
ErrRangeTooSmall = errors.New("not enough numbers in a range")
)
func (g *IntGenerator) Rand(min, max int) (int, error) {
if min >= max {
return 0, ErrInvalidRange
}
randNum := rand.Intn(max-min) + min
return randNum, nil
}
func (g *IntGenerator) Unique(min, max int) (int, error) {
for {
v, err := g.Rand(min, max)
if err != nil {
return 0, err
}
if _, exist := g.uniqueVals[v]; !exist {
g.uniqueVals[v] = true
return v, nil
}
//no more numbers
if len(g.uniqueVals) == (max - min) {
return 0, ErrRangeTooSmall
}
}
}