-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsplit.go
77 lines (65 loc) · 1.64 KB
/
split.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
package main
import (
"fmt"
"sort"
"time"
)
type Bucket struct {
Cap int
Len int
Want int
}
func main() {
a := Bucket{Cap: 12, Len: 12, Want: 6}
b := Bucket{Cap: 9, Len: 0, Want: 6}
c := Bucket{Cap: 5, Len: 0, Want: 0}
var success = make(chan Bucket, 100)
go SwapBucket(a, b, c, cap(success), success, []Bucket{a, b, c})
i := 0
LOOP:
for {
select {
case v := <-success:
if v.Cap == 0 {
break LOOP
}
fmt.Print(v.Len, " ")
i++
if i%3 == 0 {
fmt.Println()
}
}
}
}
func SwapBucket(a, b, c Bucket, depth int, success chan Bucket, caches []Bucket) {
if depth <= 0 || len(success) > 0 {
return
}
time.Sleep(time.Millisecond * 100)
delta := b.Cap - b.Len
if a.Len < delta {
delta = a.Len
}
if delta > 0 {
a.Len -= delta
b.Len += delta
temp := []Bucket{a, b, c}
sort.SliceStable(temp, func(i, j int) bool {
return temp[i].Cap > temp[j].Cap
})
caches = append(caches, temp...)
if a.Len == a.Want && b.Len == b.Want && c.Len == c.Want && len(success) == 0 {
for k := range caches {
success <- caches[k]
}
success <- Bucket{}
return
}
}
caches = append([]Bucket{}, caches...)
depth -= 1
go SwapBucket(a, c, b, depth, success, caches)
go SwapBucket(b, c, a, depth, success, caches)
go SwapBucket(c, a, b, depth, success, caches)
go SwapBucket(c, b, a, depth, success, caches)
}