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

sequence

package

Go to main page

Versions in this module

v1

v1.1.0

Nov 25, 2024

Changes in this version

type ComparableSequence

+ func (c *ComparableSequence[T]) Clone() *ComparableSequence[T]

+ func (c *ComparableSequence[T]) Concat(sequences ...*ComparableSequence[T]) *ComparableSequence[T]

+ func (c *ComparableSequence[T]) Concatenated(s *ComparableSequence[T]) iter.Seq[T]

+ func (c *ComparableSequence[T]) Corresponds(s *ComparableSequence[T], f func(T, T) bool) bool

+ func (c *ComparableSequence[T]) Diffed(s *ComparableSequence[T]) iter.Seq[T]

+ func (c *ComparableSequence[T]) Distincted() iter.Seq[T]

+ func (c *ComparableSequence[T]) EndsWith(other *ComparableSequence[T]) bool

+ func (c *ComparableSequence[T]) Intersect(s *ComparableSequence[T]) *ComparableSequence[T]

+ func (c *ComparableSequence[T]) Intersected(s *ComparableSequence[T]) iter.Seq[T]

+ func (c *ComparableSequence[T]) StartsWith(other *ComparableSequence[T]) bool

type Sequence

+ func (c *Sequence[T]) Concatenated(s *Sequence[T]) iter.Seq[T]

+ func (c *Sequence[T]) Diff(s *Sequence[T], f func(T, T) bool) *Sequence[T]

+ func (c *Sequence[T]) Diffed(s *Sequence[T], f func(T, T) bool) iter.Seq[T]

+ func (c *Sequence[T]) Distincted(f func(T, T) bool) iter.Seq[T]

+ func (c *Sequence[T]) Filtered(f func(T) bool) iter.Seq[T]

+ func (c *Sequence[T]) Intersect(s *Sequence[T], f func(T, T) bool) *Sequence[T]

+ func (c *Sequence[T]) Intersected(s *Sequence[T], f func(T, T) bool) iter.Seq[T]

+ func (c *Sequence[T]) Rejected(f func(T) bool) iter.Seq[T]

+ func (l *Sequence[T]) Reject(f func(T) bool) *Sequence[T]

v1.0.0

Nov 20, 2024

Changes in this version

+ type ComparableSequence struct

+ func NewComparableSequence[T cmp.Ordered](s ...[]T) *ComparableSequence[T]

+ func (c *ComparableSequence[T]) Contains(v T) bool

+ func (c *ComparableSequence[T]) Diff(s *ComparableSequence[T]) *ComparableSequence[T]

+ func (c *ComparableSequence[T]) Distinct() *ComparableSequence[T]

+ func (c *ComparableSequence[T]) Equals(c2 *ComparableSequence[T]) bool

+ func (c *ComparableSequence[T]) Exists(v T) bool

+ func (c *ComparableSequence[T]) IndexOf(v T) int

+ func (c *ComparableSequence[T]) LastIndexOf(v T) int

+ func (c *ComparableSequence[T]) Max() T

+ func (c *ComparableSequence[T]) Min() T

+ func (c *ComparableSequence[T]) New(s ...[]T) collection.Collection[T]

+ func (c *ComparableSequence[T]) NewOrdered(s ...[]T) collection.OrderedCollection[T]

+ func (c *ComparableSequence[T]) Sum() T

+ type Sequence struct

+ func NewSequence[T any](s ...[]T) *Sequence[T]

+ func (c *Sequence[T]) Add(v T)

+ func (c *Sequence[T]) All() iter.Seq2[int, T]

+ func (c *Sequence[T]) Apply(f func(T) T) *Sequence[T]

+ func (c *Sequence[T]) At(index int) T

+ func (c *Sequence[T]) Backward() iter.Seq2[int, T]

+ func (c *Sequence[T]) Clone() *Sequence[T]

+ func (c *Sequence[T]) Concat(sequences ...Sequence[T]) *Sequence[T]

+ func (c *Sequence[T]) Contains(f func(T) bool) bool

+ func (c *Sequence[T]) Corresponds(s *Sequence[T], f func(T, T) bool) bool

+ func (c *Sequence[T]) Count(f func(T) bool) int

+ func (c *Sequence[T]) Dequeue() (T, error)

+ func (c *Sequence[T]) Distinct(f func(T, T) bool) *Sequence[T]

+ func (c *Sequence[T]) Drop(n int) *Sequence[T]

+ func (c *Sequence[T]) DropRight(n int) *Sequence[T]

+ func (c *Sequence[T]) DropWhile(f func(T) bool) *Sequence[T]

+ func (c *Sequence[T]) Enqueue(v T)

+ func (c *Sequence[T]) Equals(c2 *Sequence[T], f func(T, T) bool) bool

+ func (c *Sequence[T]) Exists(f func(T) bool) bool

+ func (c *Sequence[T]) Filter(f func(T) bool) *Sequence[T]

+ func (c *Sequence[T]) FilterNot(f func(T) bool) *Sequence[T]

+ func (c *Sequence[T]) Find(f func(T) bool) (int, T)

+ func (c *Sequence[T]) FindLast(f func(T) bool) (int, T)

+ func (c *Sequence[T]) ForAll(f func(T) bool) bool

+ func (c *Sequence[T]) Head() (T, error)

+ func (c *Sequence[T]) Init() *Sequence[T]

+ func (c *Sequence[T]) IsEmpty() bool

+ func (c *Sequence[T]) Last() (T, error)

+ func (c *Sequence[T]) Length() int

+ func (c *Sequence[T]) New(s ...[]T) collection.Collection[T]

+ func (c *Sequence[T]) NewOrdered(s ...[]T) collection.OrderedCollection[T]

+ func (c *Sequence[T]) NonEmpty() bool

+ func (c *Sequence[T]) Partition(f func(T) bool) (*Sequence[T], *Sequence[T])

+ func (c *Sequence[T]) Pop() (T, error)

+ func (c *Sequence[T]) Push(v T)

+ func (c *Sequence[T]) Random() T

+ func (c *Sequence[T]) Reverse() *Sequence[T]

+ func (c *Sequence[T]) Slice(start, end int) collection.OrderedCollection[T]

+ func (c *Sequence[T]) SplitAt(n int) (*Sequence[T], *Sequence[T])

+ func (c *Sequence[T]) String() string

+ func (c *Sequence[T]) Tail() *Sequence[T]

+ func (c *Sequence[T]) Take(n int) *Sequence[T]

+ func (c *Sequence[T]) TakeRight(n int) *Sequence[T]

+ func (c *Sequence[T]) ToSlice() []T

+ func (c *Sequence[T]) Values() iter.Seq[T]