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

collections

package

Go to main page

Versions in this module

v0

v0.6.0

Sep 29, 2024

v0.5.9

Sep 29, 2024

v0.5.8

Sep 7, 2024

v0.5.7

Sep 3, 2024

v0.5.6

Jul 14, 2024

v0.5.5

Jun 9, 2024

v0.5.4

Jun 9, 2024

v0.5.3

Jun 2, 2024

v0.5.2

Apr 15, 2024

Changes in this version

+ func MakeGrid[T any](rows, cols int) [][]T

+ type LinkedList struct

+ Head *ListNode[T]

+ Tail *ListNode[T]

+ func NewLinkedList[T any]() *LinkedList[T]

+ func (l *LinkedList[T]) Add(value T)

+ func (l *LinkedList[T]) Append(value T)

+ func (l *LinkedList[T]) GetValueAt(index int) (T, error)

+ func (l *LinkedList[T]) Insert(value T, index int) error

+ type List struct

+ func NewList[T cmp.Ordered]() *List[T]

+ func (l *List[T]) Append(value T)

+ func (l *List[T]) Clear()

+ func (l *List[T]) Contains(value T) bool

+ func (l *List[T]) Filter(filterFunc func(T) bool) *List[T]

+ func (l *List[T]) Get(index int) (T, error)

+ func (l *List[T]) GetFirst() T

+ func (l *List[T]) GetLast() T

+ func (l *List[T]) GetRandom() T

+ func (l *List[T]) IndexOf(value T) int

+ func (l *List[T]) Insert(index int, value T) error

+ func (l *List[T]) Length() int

+ func (l *List[T]) Map(mapFunc func(T) T) *List[T]

+ func (l *List[T]) Prepend(value T)

+ func (l *List[T]) Remove(index int) (T, error)

+ func (l *List[T]) RemoveFirst() T

+ func (l *List[T]) RemoveLast() T

+ func (l *List[T]) Reverse()

+ func (l *List[T]) Shuffle()

+ func (l *List[T]) Slice() []T

+ func (l *List[T]) Sort()

+ func (l *List[T]) String() string

+ type ListNode struct

+ Next *ListNode[T]

+ Prev *ListNode[T]

+ Value T

+ func NewListNode[T any](value T) *ListNode[T]

+ type MaxPQ struct

+ func NewMaxPQ[T cmp.Ordered]() *MaxPQ[T]

+ func (m *MaxPQ[T]) DelMax() T

+ func (m *MaxPQ[T]) Insert(value T)

+ func (m *MaxPQ[T]) IsEmpty() bool

+ func (m *MaxPQ[T]) Max() T

+ func (m *MaxPQ[T]) Size() int

+ func (m *MaxPQ[T]) String() string

+ type MinPQ struct

+ func NewMinPQ[T cmp.Ordered]() *MinPQ[T]

+ func (m *MinPQ[T]) DelMin() T

+ func (m *MinPQ[T]) Insert(value T)

+ func (m *MinPQ[T]) IsEmpty() bool

+ func (m *MinPQ[T]) Min() T

+ func (m *MinPQ[T]) Size() int

+ func (m *MinPQ[T]) String() string

+ type Stack []T

+ func NewStack[T any]() Stack[T]

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

+ func (q *Stack[T]) Push(item T)

+ func (q *Stack[T]) PushAll(items []T)

+ func (q Stack[T]) HasItems() bool

+ func (q Stack[T]) IsEmpty() bool

+ func (q Stack[T]) Size() int

v0.5.1

Mar 4, 2024

Changes in this version

+ type Queue []T

+ func NewQueue[T any]() Queue[T]

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

+ func (q *Queue[T]) Enqueue(item T)

+ func (q *Queue[T]) EnqueueAll(items []T)

+ func (q Queue[T]) HasItems() bool

+ func (q Queue[T]) IsEmpty() bool

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

+ type Set map[T]bool

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

+ func (s Set[T]) Add(item T)

+ func (s Set[T]) Delete(item T)

+ func (s Set[T]) Has(item T) bool

+ func (s Set[T]) HasItems() bool

+ func (s Set[T]) IsEmpty() bool

+ func (s Set[T]) Items() []T

+ func (s Set[T]) Size() int