queue

Documentation

Index

• type Queue
  • func New(n int) *Queue
  • func (q *Queue) Clear()
  • func (q *Queue) Empty() bool
  • func (q *Queue) Has(pc uint32) bool
  • func (q *Queue) Pop() uint32
  • func (q *Queue) Push(pc uint32)

Types

type Queue

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

Queue is a fast unique items queue which stores positive integers up to a fixed bound.

func New

func New(n int) *Queue

New creates a Queue where n-1 is the maximum positive integer which can be stored in the queue.

func (*Queue) Clear

func (q *Queue) Clear()

Clear clears the queue

func (*Queue) Empty

func (q *Queue) Empty() bool

Empty returns true if the queue is empty

func (*Queue) Has

func (q *Queue) Has(pc uint32) bool

Has checks the queue to see if pc is in it

func (*Queue) Pop

func (q *Queue) Pop() uint32

Pop removes an item from the queue

func (*Queue) Push

func (q *Queue) Push(pc uint32)

Push adds an item to the queue