README
¶
Go Queues Test
Performance test of different concurrent queue implementations
--
Warning: not for production use!
--
Available Structure:
- CFifo : Channel based fifo
- LcLifo : list.List based lifo using chan for locking
- LcFifo : list.List based fifo using chan for locking
- LmLifo : list.List based lifo using mutex for locking
- LmFifo : list.List based fifo using mutex for locking
- ZLifo : lockfree lifo implementation (broken, ABA problem)
- ZFifo : lockfree fifo implementation (probably broken)
- ZcFifo : lockfree fifo implementation using chan based freelist (crashes)
- ZrFifo : lockfree fifo implementation using ring.Ring based freelist (probably broken)
- RmLifo : ring.Ring based lifo using mutex for locking
- RmFifo : ring.Ring based fifo using mutex for locking
- SmLifo : slice based lifo using mutex for locking
- SmFifo : slice based fifo using mutex for locking
Tests:
- Single threaded
- Add N, Remove N
- N times (Add 1, Remove 1)
- N/2 times (Add 2, Remove 1), Remove N/2
- Add N/2, N/2 times (Add 1, Remove 2)
ZcFifo was excluded due to crash.
General recommendation use chan if it suits otherwise use slice + "chan as a lock".
Documentation
¶
Overview ¶
implements fifo using a channel
implements locking queues, using list and mutex
implements locking queues, using list and mutex
implements locking queues, using list and channel
implements locking queues, using list and mutex
implements locking queues, using list and mutex
implements locking queues, using list and mutex
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type LCFifo ¶
type LCFifo struct {
// contains filtered or unexported fields
}
func NewListCFifo ¶
func NewListCFifo() *LCFifo
type LCLifo ¶
type LCLifo struct {
// contains filtered or unexported fields
}
func NewListCLifo ¶
func NewListCLifo() *LCLifo
type LFifo ¶
type LFifo struct {
// contains filtered or unexported fields
}
func NewListFifo ¶
func NewListFifo() *LFifo
type LLifo ¶
type LLifo struct {
// contains filtered or unexported fields
}
func NewListLifo ¶
func NewListLifo() *LLifo
type Queue ¶
type Queue interface {
Enqueue(value interface{})
Dequeue() (value interface{}, ok bool)
}
type ZFifo ¶
type ZFifo struct {
// contains filtered or unexported fields
}
type ZFifoFreechan ¶
type ZFifoFreechan struct {
// contains filtered or unexported fields
}
func (*ZFifoFreechan) Dequeue ¶
func (q *ZFifoFreechan) Dequeue() (value interface{}, ok bool)
Dequeue returns the value at the head of the queue and true, or if the queue is empty, it returns a nil value and false
func (*ZFifoFreechan) Enqueue ¶
func (q *ZFifoFreechan) Enqueue(value interface{})
Enqueue inserts the value at the tail of the queue
type ZFifoFreering ¶
type ZFifoFreering struct {
// contains filtered or unexported fields
}
func NewZFifoFreering ¶
func NewZFifoFreering() *ZFifoFreering
func (*ZFifoFreering) Dequeue ¶
func (q *ZFifoFreering) Dequeue() (value interface{}, ok bool)
Dequeue returns the value at the head of the queue and true, or if the queue is empty, it returns a nil value and false
func (*ZFifoFreering) Enqueue ¶
func (q *ZFifoFreering) Enqueue(value interface{})
Enqueue inserts the value at the tail of the queue
Source Files
Directories