Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  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

iterset

package module

Go to main page

Versions in this module

v0

v0.3.0

Jan 26, 2025

Changes in this version

+ func CompactBy[K comparable, V any](values iter.Seq[V], key func(V) K) iter.Seq2[K, []V]

+ func Compact[K comparable](keys iter.Seq[K]) iter.Seq2[K, int]

+ func Intersect[K comparable](keys iter.Seq[K], seqs ...iter.Seq[K]) iter.Seq[K]

+ func Max[K comparable, V cmp.Ordered](m map[K]V) []K

+ func Min[K comparable, V cmp.Ordered](m map[K]V) []K

+ func UniqueBy[K comparable, V any](values iter.Seq[V], key func(V) K) iter.Seq2[K, V]

type MapSet

+ func (m MapSet[K, V]) Remove(keys iter.Seq[K])

+ func (m MapSet[K, V]) Toggle(seq iter.Seq2[K, V])

v0.2.0

Dec 6, 2024

Changes in this version

+ func Difference[K comparable](seq1, seq2 iter.Seq[K]) iter.Seq[K]

+ func IsSubset[K comparable](seq1, seq2 iter.Seq[K]) bool

type MapSet

+ func Collect[K comparable, V any](keys iter.Seq[K], value V) MapSet[K, V]

+ func Memoize[K comparable, V any](keys iter.Seq[K], f func(K) V) MapSet[K, V]

+ func (m MapSet[K, V]) Equal(keys iter.Seq[K]) bool

+ func (m MapSet[K, V]) Insert(keys iter.Seq[K], value V)

+ func (m MapSet[K, V]) IsSubset(keys iter.Seq[K]) bool

+ func (m MapSet[K, V]) ReverseDifference(keys iter.Seq[K]) iter.Seq[K]

+ func (m MapSet[K, V]) SymmetricDifference(keys iter.Seq[K]) iter.Seq[K]

+ func (m MapSet[K, V]) Union(seqs ...iter.Seq2[K, V]) MapSet[K, V]

v0.1.0

Nov 15, 2024

Changes in this version

+ func Sorted[K comparable, V cmp.Ordered](m map[K]V) []K

+ func Unique[K comparable](keys iter.Seq[K]) iter.Seq[K]

+ type MapSet map[K]V

+ func Cast[K comparable, V any](m map[K]V) MapSet[K, V]

+ func Count[K comparable](keys iter.Seq[K]) MapSet[K, int]

+ func GroupBy[K comparable, V any](values iter.Seq[V], key func(V) K) MapSet[K, []V]

+ func IndexBy[K comparable, V any](values iter.Seq[V], key func(V) K) MapSet[K, V]

+ func Index[K comparable](keys iter.Seq[K]) MapSet[K, int]

+ func Set[K comparable](keys ...K) MapSet[K, struct{}]

+ func (m MapSet[K, V]) Add(keys ...K)

+ func (m MapSet[K, V]) Contains(keys ...K) bool

+ func (m MapSet[K, V]) Delete(keys ...K)

+ func (m MapSet[K, V]) Difference(keys iter.Seq[K]) iter.Seq[K]

+ func (m MapSet[K, V]) Get(key K) V

+ func (m MapSet[K, V]) Intersect(keys iter.Seq[K]) iter.Seq2[K, V]

+ func (m MapSet[K, V]) IsDisjoint(keys iter.Seq[K]) bool

+ func (m MapSet[K, V]) IsSuperset(keys iter.Seq[K]) bool

+ func (m MapSet[K, V]) Missing(keys ...K) bool

JackTT - Gopher 🇻🇳