-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathbasic_ring.go
65 lines (53 loc) · 1.27 KB
/
basic_ring.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
package o
// BasicRing contains the accounting data for a ring buffer or other
// data structure of arbitrary length. It uses three variables (insert
// index, length of buffer, ring capacity) to keep track of the
// state.
//
// The index wrap-around operation is implemented with modulo division.
type basicRing struct {
cap, read, length uint
}
func (r *basicRing) mask(val uint) uint {
return val % r.cap
}
func (r *basicRing) start() uint {
return r.read
}
func (r *basicRing) end() uint {
return r.mask(r.read + r.length)
}
func (r *basicRing) capacity() uint {
return r.cap
}
func (r *basicRing) reset() {
r.length = 0
}
func (r *basicRing) pushN(n uint) (uint, uint, error) {
start := r.length
if n > r.cap-r.length {
idx := r.mask(r.read + start)
return idx, idx, ErrFull
}
r.length += n
return r.mask(r.read + start), r.mask(r.read + r.length), nil
}
func (r *basicRing) shiftN(n uint) (uint, uint, error) {
start := r.read
if n > r.size() {
return start, start, ErrEmpty
}
r.length -= n
r.read = r.mask(r.read + n)
return start, r.read, nil
}
func (r *basicRing) full() bool {
return r.cap == r.length
}
func (r *basicRing) empty() bool {
return r.length == 0
}
func (r *basicRing) size() uint {
return r.length
}
var _ ringBackend = &basicRing{}