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

fnutil

package

Go to main page

Versions in this module

v1

v1.32.0

Jan 8, 2025

v1.31.2

Feb 10, 2025

v1.30.8

Feb 10, 2025

Changes in this version

+ func Filter[T any](f func(T) bool, xs []T) []T

+ func Intersection[D comparable](xs, ys []D) []D

+ func IsAll[T any](f func(T) bool, xs []T) bool

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

+ func Map[T any, R any](f func(T) R, xs []T) []R

+ func PlanHashCode[D comparable](data D) D

+ func RemoveIf[T any](f func(T) bool, xs []T) []T

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

+ type IndexSetWithComparableIndex struct

+ func IndexSet[D comparable](xs []D) *IndexSetWithComparableIndex[D, D]

+ func NewIndexSetWithComparableIndex[I comparable, D any](hashCode func(data D) I, xs []D) *IndexSetWithComparableIndex[I, D]

+ func (xs *IndexSetWithComparableIndex[I, D]) Contains(data D) bool

+ func (xs *IndexSetWithComparableIndex[I, D]) Intersection(ys []D) []D

+ func (xs *IndexSetWithComparableIndex[I, D]) SubtractedBy(ys []D) []D