-
Notifications
You must be signed in to change notification settings - Fork 7
/
ringbuffer.go
52 lines (42 loc) · 1.08 KB
/
ringbuffer.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
// Copyright (c) 2013 Zhen, LLC. http://zhen.io. All rights reserved.
// Use of this source code is governed by the Apache 2.0 license.
// Ringbuffer implements a ring buffer that can leverage different storage engines
// and wait strategies. It is modeled after the LMAX Disruptor architecture.
package ringbuffer
import (
"log"
)
var _ = log.Ldate
type RingBuffer interface {
NewProducer() (Producer, error)
NewConsumer() (Consumer, error)
}
type Producer interface {
Put(interface{}) (int, error)
}
type Consumer interface {
Get() (interface{}, error)
}
type Sequencer interface {
Get() (int64, error)
Set(int64) error
Next(int) (int64, error)
Request(int) (int64, error)
Commit(int64) error
AddGatingSequence(...Sequencer)
RemoveGatingSequence(Sequencer)
}
func GetMinSeq(gates []Sequencer, min int64) (int64, error) {
for _, seq := range gates {
if v, err := seq.Get(); err != nil {
return 0, err
} else if v < min {
min = v
}
}
return min, nil
}
// powerOfTwo determines whether n is of power of two
func PowerOfTwo(n int) bool {
return n != 0 && (n&(n-1)) == 0
}