container

Documentation

Index

• Variables
• type HashSet
  • func NewHashSet(s ...string) HashSet
  • func (set *HashSet) Contains(s string) bool
  • func (set *HashSet) Insert(s ...string)
  • func (set *HashSet) ToList() []string
• type PriorityQueue
  • func NewPriorityQueue[T any](comp func(this, that *T) bool) *PriorityQueue[T]
  • func (pq *PriorityQueue[T]) Len() int
  • func (pq *PriorityQueue[T]) Pop() (*T, error)
  • func (pq *PriorityQueue[T]) Push(x *T)

Variables

var ErrEmpty = errors.New("queue is empty")

ErrEmpty is returned for queues with no items

Types

type HashSet

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

func NewHashSet

func NewHashSet(s ...string) HashSet

func (*HashSet) Contains

func (set *HashSet) Contains(s string) bool

func (*HashSet) Insert

func (set *HashSet) Insert(s ...string)

func (*HashSet) ToList

func (set *HashSet) ToList() []string

type PriorityQueue

type PriorityQueue[T any] struct {
	// contains filtered or unexported fields
}

func NewPriorityQueue

func NewPriorityQueue[T any](comp func(this, that *T) bool) *PriorityQueue[T]

NewPriorityQueue initializes internal data structure and returns new PriorityQueue accepting a comparator function comp function decides ordering in queue, Sort `this` before `that` if True.

func (*PriorityQueue[T]) Len

func (pq *PriorityQueue[T]) Len() int

Len returns items in queue

func (*PriorityQueue[T]) Pop

func (pq *PriorityQueue[T]) Pop() (*T, error)

Pop pops the highest priority item from queue The complexity is O(log n) where n = h.Len().

func (*PriorityQueue[T]) Push

func (pq *PriorityQueue[T]) Push(x *T)

Push pushes the element x onto the heap. The complexity is O(log n) where n = h.Len().