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

sorted

package module

v1.2.0 Latest Latest Go to latest Published: Mar 14, 2024 License: MIT Imports: 1 Imported by: 1

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/golang-mods/sorted

Links

Open Source Insights

README ¶

sorted

The operations on sorted collections.

Documentation ¶

Index ¶

func Contains[S ~[]E, E cmp.Ordered](whole, part S) bool
func ContainsWith[S ~[]E, E any](whole, part S, compare func(E, E) int) bool
func DuplicateIndex[S ~[]E, E cmp.Ordered](slice S) int
func DuplicateIndexWith[S ~[]E, E any](slice S, compare func(E, E) int) int
func DuplicateIndexes[S ~[]E, E cmp.Ordered](slice S) []int
func DuplicateIndexesWith[S ~[]E, E any](slice S, compare func(E, E) int) []int
func Intersection[S ~[]E, E cmp.Ordered](self, other S) (S, S)
func IntersectionWith[TS ~[]T, T any, US ~[]U, U any](self TS, other US, compare func(T, U) int) (TS, US)
func IntersectionXor[S ~[]E, E cmp.Ordered](self, other S) (S, S, S, S)
func IntersectionXorWith[TS ~[]T, T any, US ~[]U, U any](self TS, other US, compare func(T, U) int) (TS, TS, US, US)
func Union[S ~[]E, E cmp.Ordered](self, other S) S
func UnionWith[S ~[]E, E any](self, other S, compare func(E, E) int) S
func Xor[S ~[]E, E cmp.Ordered](self S, other S) (S, S)
func XorWith[TS ~[]T, T any, US ~[]U, U any](self TS, other US, compare func(T, U) int) (TS, US)

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func Contains ¶ added in v1.2.0

func Contains[S ~[]E, E cmp.Ordered](whole, part S) bool

func ContainsWith ¶ added in v1.2.0

func ContainsWith[S ~[]E, E any](whole, part S, compare func(E, E) int) bool

func DuplicateIndex ¶ added in v1.2.0

func DuplicateIndex[S ~[]E, E cmp.Ordered](slice S) int

func DuplicateIndexWith ¶ added in v1.2.0

func DuplicateIndexWith[S ~[]E, E any](slice S, compare func(E, E) int) int

func DuplicateIndexes ¶ added in v1.2.0

func DuplicateIndexes[S ~[]E, E cmp.Ordered](slice S) []int

func DuplicateIndexesWith ¶ added in v1.2.0

func DuplicateIndexesWith[S ~[]E, E any](slice S, compare func(E, E) int) []int

func Intersection ¶ added in v1.2.0

func Intersection[S ~[]E, E cmp.Ordered](self, other S) (S, S)

func IntersectionWith ¶ added in v1.2.0

func IntersectionWith[TS ~[]T, T any, US ~[]U, U any](self TS, other US, compare func(T, U) int) (TS, US)

func IntersectionXor ¶ added in v1.2.0

func IntersectionXor[S ~[]E, E cmp.Ordered](self, other S) (S, S, S, S)

func IntersectionXorWith ¶ added in v1.2.0

func IntersectionXorWith[TS ~[]T, T any, US ~[]U, U any](self TS, other US, compare func(T, U) int) (TS, TS, US, US)

func Union ¶ added in v1.2.0

func Union[S ~[]E, E cmp.Ordered](self, other S) S

func UnionWith ¶ added in v1.2.0

func UnionWith[S ~[]E, E any](self, other S, compare func(E, E) int) S

func Xor ¶ added in v1.2.0

func Xor[S ~[]E, E cmp.Ordered](self S, other S) (S, S)

func XorWith ¶ added in v1.2.0

func XorWith[TS ~[]T, T any, US ~[]U, U any](self TS, other US, compare func(T, U) int) (TS, US)

Types ¶

This section is empty.

Source Files ¶

View all Source files