-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathrr.go
110 lines (92 loc) · 1.48 KB
/
rr.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
package balancer
import (
"sync"
)
// RoundRobin
type rr struct {
items []string
count int
current int
sync.Mutex
}
func NewRoundRobin(items ...[]string) (lb *rr) {
lb = &rr{}
if len(items) > 0 && len(items[0]) > 0 {
lb.Update(items[0])
}
return
}
func (b *rr) Add(item string, _ ...int) {
b.Lock()
b.items = append(b.items, item)
b.count++
b.Unlock()
}
func (b *rr) All() interface{} {
all := make([]string, b.count)
b.Lock()
for i, v := range b.items {
all[i] = v
}
b.Unlock()
return all
}
func (b *rr) Name() string {
return "RoundRobin"
}
func (b *rr) Select(_ ...string) (item string) {
b.Lock()
switch b.count {
case 0:
item = ""
case 1:
item = b.items[0]
default:
item = b.items[b.current]
b.current = (b.current + 1) % b.count
}
b.Unlock()
return
}
func (b *rr) Remove(item string, asClean ...bool) (ok bool) {
b.Lock()
defer b.Unlock()
clean := len(asClean) > 0 && asClean[0]
for i := 0; i < b.count; i++ {
if item == b.items[i] {
b.items = append(b.items[:i], b.items[i+1:]...)
b.count--
ok = true
// remove all or remove one
if !clean {
return
}
i--
}
}
return
}
func (b *rr) RemoveAll() {
b.Lock()
b.items = b.items[:0]
b.count = 0
b.current = 0
b.Unlock()
}
func (b *rr) Reset() {
b.Lock()
b.current = 0
b.Unlock()
}
func (b *rr) Update(items interface{}) bool {
v, ok := items.([]string)
if !ok {
return false
}
b.Lock()
b.items = v
b.count = len(v)
b.current = 0
b.Unlock()
return true
}