generic

Documentation

Index

• type Hashable
• type Queue
  • func NewQueue() Queue
  • func (q *Queue) Empty() bool
  • func (q *Queue) Pull() Hashable
  • func (q *Queue) Push(items ...Hashable)
  • func (q *Queue) Size() int
• type Stack
  • func NewStack() Stack
  • func (s *Stack) IsEmpty() bool
  • func (s *Stack) Peek() interface{}
  • func (s *Stack) Pop() interface{}
  • func (s *Stack) Push(item interface{})
  • func (s *Stack) Size() int

Types

type Hashable

type Hashable interface {
	Hash() interface{}
}

Hashable object. The hash can be used for cache.

type Queue

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

Queue is a simple queue with unique items.

func NewQueue

func NewQueue() Queue

NewQueue create a new Queue.

func (*Queue) Empty

func (q *Queue) Empty() bool

Empty or not?

func (*Queue) Pull

func (q *Queue) Pull() Hashable

Pull an item from the Queue.

func (*Queue) Push

func (q *Queue) Push(items ...Hashable)

Push items into the queue. The queue contains only unique items.

func (*Queue) Size

func (q *Queue) Size() int

Size of the queue.

type Stack

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

Stack is a basic stack.

func NewStack

func NewStack() Stack

NewStack creates a new empty stack.

func (*Stack) IsEmpty

func (s *Stack) IsEmpty() bool

IsEmpty tells if the stack is empty or not.

func (*Stack) Peek

func (s *Stack) Peek() interface{}

Peek the top item.

func (*Stack) Pop

func (s *Stack) Pop() interface{}

Pop the top item.

func (*Stack) Push

func (s *Stack) Push(item interface{})

Push an item onto the stack.

func (*Stack) Size

func (s *Stack) Size() int

Size of the stack.