unique

README

unique

Package unique provides primitives for sorting slices removing repeated elements.

a quick example

Executing this code:

	s := []int{3, 5, 1, 7, 2, 3, 7, 5, 2}
	less := func(i, j int) bool { return s[i] < s[j] }
	unique.Slice(&s, less)
	fmt.Println(s)

Will output the following:

[1 2 3 5 7]

Documentation

Overview

Package unique provides primitives for sorting slices removing repeated elements.

Index

• func Slice(slicePtr interface{}, less func(i, j int) bool)

Examples

• Slice

Functions

func Slice

func Slice(slicePtr interface{}, less func(i, j int) bool)

Slice sorts the slice pointed by the provided pointer given the provided less function and removes repeated elements. The function panics if the provided interface is not a pointer to a slice.

Example

package main

import (
	"fmt"

	"github.com/campoy/unique"
)

func main() {
	s := []int{3, 5, 1, 7, 2, 3, 7, 5, 2}
	less := func(i, j int) bool { return s[i] < s[j] }
	unique.Slice(&s, less)
	fmt.Println(s)
}

Output:

[1 2 3 5 7]