Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

basic

package

Go to main page

Versions in this module

v0

v0.1.3

Jun 22, 2024

Changes in this version

+ type Fifo interface

+ Front func() T

+ PopFront func()

+ PushBack func(v T)

+ type Filo interface

+ Back func() T

+ PopBack func()

+ PushBack func(e T)

+ type List struct

+ 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 (q *Queue[T]) Back() T

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

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

type Stack

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

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

+ 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]) PeekAt(i int) T

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

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

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

type StackCmp

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

v0.1.2

Jun 10, 2024

Changes in this version

+ const MinCap

+ type LinkQueue struct

+ func NewLinkQueue[T any]() *LinkQueue[T]

+ func (q *LinkQueue[T]) Peek() *T

+ func (q *LinkQueue[T]) PopFront() T

+ func (q *LinkQueue[T]) PushBack(e T)

+ func (q *LinkQueue[T]) Size() int

+ type Queue struct

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

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

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

+ func (q *Queue[T]) Peek() *T

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

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

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

+ type Set map[T]struct

+ 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 struct

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

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

+ func (s *Stack[T]) Drain() []T

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

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

+ func (s *Stack[T]) IterateRange(lo, hi int, fn func(T) bool)

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

+ func (s *Stack[T]) PeekIndex(i int) T

+ func (s *Stack[T]) Pop() T

+ func (s *Stack[T]) Push(e T)

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

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

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

+ type StackCmp struct

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

+ func (s *StackCmp[T]) Contains(e T) bool

+ type UnionFind struct

+ 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)

v0.1.1

May 29, 2024

v0.1.0

May 29, 2024