queue

package module

v0.0.0-...-2a29819 Latest Latest Go to latest Published: Mar 24, 2018 License: BSD-3-Clause Imports: 2 Imported by: 0

Details

import "github.com/n1060/queue"

Package queue provides a lock-free queue. The underlying algorithm is one proposed by Michael and Scott. https://doi.org/10.1145/248052.248106

type Queue struct {
    // contains filtered or unexported fields
}

Queue is a lock-free unbounded queue.

func NewQueue() (q *Queue)

NewQueue returns a pointer to an empty queue.

func (q *Queue) Deq() interface{}

Deq removes and returns the value at the head of the queue. It returns nil if the queue is empty.

func (q *Queue) Enq(v interface{})

Enq puts the given value v at the tail of the queue.

Package queue provides a lock-free queue. The underlying algorithm is one proposed by Michael and Scott. https://doi.org/10.1145/248052.248106

This section is empty.

This section is empty.

This section is empty.

type Queue struct {
	// contains filtered or unexported fields
}

Queue is a lock-free unbounded queue.

Example ¶

q := NewQueue()

q.Enq("1st item")
q.Enq("2nd item")
q.Enq("3rd item")

fmt.Println(q.Deq())
fmt.Println(q.Deq())
fmt.Println(q.Deq())

Output:
1st item
2nd item
3rd item

func NewQueue() (q *Queue)

NewQueue returns a pointer to an empty queue.

func (q *Queue) Deq() interface{}

Deq removes and returns the value at the head of the queue. It returns nil if the queue is empty.

func (q *Queue) Enq(v interface{})

Enq puts the given value v at the tail of the queue.