-
Notifications
You must be signed in to change notification settings - Fork 0
/
product.go
61 lines (55 loc) · 1.11 KB
/
product.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
package internal
type CartesianProduct struct {
length int
counters []int
lengths []int
lists [][]string
}
func NewCartesianProduct(input [][]string) CartesianProduct {
length := len(input)
ret := CartesianProduct{
length: length,
counters: make([]int, length),
lengths: make([]int, length),
lists: input,
}
for i := 0; i < length; i++ {
ret.lengths[i] = len(input[i])
}
return ret
}
func (c *CartesianProduct) Next() ([]string, bool) {
ret := make([]string, c.length)
for i := 0; i < c.length; i++ {
ret[i] = c.lists[i][c.counters[i]]
}
return ret, c.step()
}
func (c *CartesianProduct) NextP(ret *[]*string) bool {
for i := 0; i < c.length; i++ {
(*ret)[i] = &c.lists[i][c.counters[i]]
}
return c.step()
}
func (c *CartesianProduct) step() bool {
for i := c.length - 1; i >= 0; i-- {
if c.counters[i] < c.lengths[i]-1 {
c.counters[i] += 1
return false
} else {
c.counters[i] = 0
}
}
return true
}
func (c *CartesianProduct) All() [][]string {
ret := make([][]string, 0)
for {
o, stop := c.Next()
ret = append(ret, o)
if stop {
break
}
}
return ret
}