lists

Index ¶

• func Contains[T comparable](s []T, i T) bool
• func Fill[T any](x int, def T) []T
• func Fill2D[T any](x, y int, def T) [][]T
• func Filter[S ~[]E, E any](s S, predicate func(E) bool) S
• func Intersection[T comparable](a, b []T) []T
• func Map[T, U any](s []T, f func(T) U) []U
• func MapMap[T, U any, V, W comparable](s map[V]T, f func(V, T) (W, U)) map[W]U
• func Range[N math.Number](a, b N) []N
• func Reduce[T any, U any](s []T, f func(U, T) U) U
• func Reverse[T any](s []T) []T
• type DoublyLinked
• • func NewDoublyLinked[T any]() DoublyLinked[T]
• • func (d *DoublyLinked[T]) Append(v T)
  • func (d *DoublyLinked[T]) Empty() bool
  • func (d *DoublyLinked[T]) TakeFirst() T
  • func (d *DoublyLinked[T]) TakeLast() T
• type Linked
• • func NewLinked[T any]() Linked[T]
• • func (l *Linked[T]) Append(v T)
  • func (l *Linked[T]) Empty() bool
  • func (l *Linked[T]) TakeFirst() T
• type Pair
• type Pairs
• • func MapToSlice[T comparable, U any](s map[T]U) Pairs[T, U]
• • func (p Pairs[T, U]) Keys() []T
  • func (p Pairs[T, U]) Vals() []U
• type Queue
• • func NewQueue[T any]() Queue[T]
• • func (q *Queue[T]) Peek() T
  • func (q *Queue[T]) Pop() T
  • func (q *Queue[T]) Push(items ...T)
  • func (q *Queue[T]) Seq(yield func(T) bool)
• type Stack
• • func NewStack[T any]() Stack[T]
• • func (s *Stack[T]) Peek() T
  • func (s *Stack[T]) Pop() T
  • func (s *Stack[T]) Push(items ...T)
  • func (s *Stack[T]) Seq(yield func(T) bool)