queue

Documentation

Overview

This implements a simple linked list Queue. Nothing complicated. The queue is thread safe and easy to use.

Index

• func Hash(data []byte) []byte
• type Queue
  • func NewQueue(allowDups bool) *Queue
  • func (self *Queue) Deque() (data []byte, err error)
  • func (self *Queue) Empty() bool
  • func (self *Queue) Enque(data []byte) error
  • func (self *Queue) Has(hash []byte) bool
  • func (self *Queue) Size() int
  • func (self *Queue) String() string

Functions

func Hash

func Hash(data []byte) []byte

Generate a sha256 hash of the data

Types

type Queue

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

func NewQueue

func NewQueue(allowDups bool) *Queue

Construct a new queue

func (*Queue) Deque

func (self *Queue) Deque() (data []byte, err error)

Read data off the queue in FIFO order

func (*Queue) Empty

func (self *Queue) Empty() bool

Check to see if it empty

func (*Queue) Enque

func (self *Queue) Enque(data []byte) error

Put data on the queue

func (*Queue) Has

func (self *Queue) Has(hash []byte) bool

func (*Queue) Size

func (self *Queue) Size() int

How many items are on the queue?

func (*Queue) String

func (self *Queue) String() string