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

sets

package module

Go to main page

Versions in this module

v1

v1.1.0

Nov 1, 2025

Changes in this version

+ func Append[S ~[]E, E comparable](s S, e ...E) S

+ func CloneOrderedSet[S ~[]E, E comparable](s S) S

+ func CloneUnorderedSet[S ~map[K]V, K comparable, V any](s S) S

+ func Deduplicate[S ~[]E, E comparable](s S) S

+ func Insert[S ~map[K]V, K comparable, V any](s S, e S) S

+ func OrderedRemove[S ~[]E, E comparable](s S, e ...E) S

+ func Prepend[S ~[]E, E comparable](s S, e ...E) S

+ func RemoveFirstN[S ~[]E, E comparable](s S, n int) S

+ func RemoveLastN[S ~[]E, E comparable](s S, n int) S

+ func Splice[S ~[]E, E comparable](s S, i int, e ...E) S

+ func UnorderedRemove[S ~map[K]V, K comparable, V any](s S, k K) S

v1.0.2

Nov 1, 2025

v1.0.1

Nov 1, 2025

v1.0.0

Nov 1, 2025

Changes in this version

+ func IsOrderedSubsetOf[S ~[]E, E comparable](super, sub S) bool

+ func IsUnorderedSubsetOf[S ~map[K]V, K comparable, V any](super, sub S) bool

+ func OrderedComplement[S ~[]E, E comparable](sets ...S) S

+ func OrderedIntersect[S ~[]E, E comparable](sets ...S) S

+ func OrderedUnion[S ~[]E, E comparable](sets ...S) S

+ func UnorderedComplement[S ~map[K]V, K comparable, V any](sets ...S) S

+ func UnorderedIntersect[S ~map[K]V, K comparable, V any](sets ...S) S

+ func UnorderedUnion[S ~map[K]V, K comparable, V any](sets ...S) S