basic

Documentation

Index

• type Fifo
• type Filo
• type List
  • func NewList[T any]() *List[T]
  • func (q *List[T]) Front() T
  • func (q *List[T]) PopFront()
  • func (q *List[T]) PushBack(e T)
  • func (q *List[T]) Size() int
• type Queue
  • func NewQueue[T any](cap int) *Queue[T]
  • func QueueFrom[T any](elems []T) *Queue[T]
  • func (q *Queue[T]) Back() T
  • func (q *Queue[T]) Clone() []T
  • func (q *Queue[T]) Front() T
  • func (q *Queue[T]) PopBack()
  • func (q *Queue[T]) PopFront()
  • func (q *Queue[T]) PushBack(e T)
  • func (q *Queue[T]) Size() int
• type Set
  • func NewSet[T comparable]() Set[T]
  • func (s Set[T]) Add(e T)
  • func (s Set[T]) Clear()
  • func (s Set[T]) Contains(e T) bool
  • func (s Set[T]) Drain() []T
  • func (s Set[T]) Len() int
  • func (s Set[T]) Remove(e T)
  • func (s Set[T]) TakeOne() T
• type Stack
  • func NewStack[T any](c int) *Stack[T]
  • func NewStackFrom[T any](elems []T) *Stack[T]
  • func (s *Stack[T]) Back() T
  • func (s *Stack[T]) Cap() int
  • func (s *Stack[T]) Find(fn func(T) bool) int
  • func (s *Stack[T]) IterRange(src, dst int, fn func(T) bool)
  • func (s *Stack[T]) Iterate(popOrd bool, fn func(T) bool)
  • func (s *Stack[T]) Peek() T
  • func (s *Stack[T]) PeekAt(i int) T
  • func (s *Stack[T]) PopBack()
  • func (s *Stack[T]) PushBack(e T)
  • func (s *Stack[T]) Reverse()
  • func (s *Stack[T]) Size() int
  • func (s *Stack[T]) String() string
  • func (s *Stack[T]) ToSlice() []T
• type StackCmp
  • func NewStackCmp[T comparable](c int) *StackCmp[T]
  • func (s *StackCmp[T]) Find(e T) int
• type UnionFind
  • func NewUnionFind(numV int) *UnionFind
  • func (uf *UnionFind) Find(v int) int
  • func (uf *UnionFind) IsConnected(v1, v2 int) bool
  • func (uf *UnionFind) NumConnectedComponent() int
  • func (uf *UnionFind) Union(v1, v2 int)

Examples

• Stack

Types

type Fifo

type Fifo[T any] interface {
	Front() T
	PopFront()
	PushBack(v T)
}

type Filo

type Filo[T any] interface {
	Back() T
	PopBack()
	PushBack(e T)
}

type List

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

func NewList

func NewList[T any]() *List[T]

func (*List[T]) Front

func (q *List[T]) Front() T

func (*List[T]) PopFront

func (q *List[T]) PopFront()

func (*List[T]) PushBack

func (q *List[T]) PushBack(e T)

func (*List[T]) Size

func (q *List[T]) Size() int

type Queue

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

func NewQueue

func NewQueue[T any](cap int) *Queue[T]

func QueueFrom

func QueueFrom[T any](elems []T) *Queue[T]

func (*Queue[T]) Back

func (q *Queue[T]) Back() T

func (*Queue[T]) Clone

func (q *Queue[T]) Clone() []T

func (*Queue[T]) Front

func (q *Queue[T]) Front() T

func (*Queue[T]) PopBack

func (q *Queue[T]) PopBack()

func (*Queue[T]) PopFront

func (q *Queue[T]) PopFront()

func (*Queue[T]) PushBack

func (q *Queue[T]) PushBack(e T)

func (*Queue[T]) Size

func (q *Queue[T]) Size() int

type Set

type Set[T comparable] map[T]struct{}

func NewSet

func NewSet[T comparable]() Set[T]

func (Set[T]) Add

func (s Set[T]) Add(e T)

func (Set[T]) Clear

func (s Set[T]) Clear()

func (Set[T]) Contains

func (s Set[T]) Contains(e T) bool

func (Set[T]) Drain

func (s Set[T]) Drain() []T

func (Set[T]) Len

func (s Set[T]) Len() int

func (Set[T]) Remove

func (s Set[T]) Remove(e T)

func (Set[T]) TakeOne

func (s Set[T]) TakeOne() T

TakeOne take out an element

type Stack

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

Example

testTimes := 100
s := NewStack[int](10)
for i := 0; i < testTimes; i++ {
	s.PushBack(i)
}
for i := 0; i < testTimes; i++ {
	e := s.Back()
	s.PopBack()
	fmt.Print(e, " ")
}

func NewStack

func NewStack[T any](c int) *Stack[T]

func NewStackFrom

func NewStackFrom[T any](elems []T) *Stack[T]

func (*Stack[T]) Back

func (s *Stack[T]) Back() T

func (*Stack[T]) Cap

func (s *Stack[T]) Cap() int

func (*Stack[T]) Find

func (s *Stack[T]) Find(fn func(T) bool) int

func (*Stack[T]) IterRange

func (s *Stack[T]) IterRange(src, dst int, fn func(T) bool)

func (*Stack[T]) Iterate

func (s *Stack[T]) Iterate(popOrd bool, fn func(T) bool)

func (*Stack[T]) Peek

func (s *Stack[T]) Peek() T

func (*Stack[T]) PeekAt

func (s *Stack[T]) PeekAt(i int) T

func (*Stack[T]) PopBack

func (s *Stack[T]) PopBack()

func (*Stack[T]) PushBack

func (s *Stack[T]) PushBack(e T)

func (*Stack[T]) Reverse

func (s *Stack[T]) Reverse()

func (*Stack[T]) Size

func (s *Stack[T]) Size() int

func (*Stack[T]) String

func (s *Stack[T]) String() string

func (*Stack[T]) ToSlice

func (s *Stack[T]) ToSlice() []T

type StackCmp

type StackCmp[T comparable] struct {
	Stack[T]
}

func NewStackCmp

func NewStackCmp[T comparable](c int) *StackCmp[T]

func (*StackCmp[T]) Find

func (s *StackCmp[T]) Find(e T) int

type UnionFind

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

func NewUnionFind

func NewUnionFind(numV int) *UnionFind

func (*UnionFind) Find

func (uf *UnionFind) Find(v int) int

func (*UnionFind) IsConnected

func (uf *UnionFind) IsConnected(v1, v2 int) bool

func (*UnionFind) NumConnectedComponent

func (uf *UnionFind) NumConnectedComponent() int

func (*UnionFind) Union

func (uf *UnionFind) Union(v1, v2 int)