package sortedset

import "github.com/segmentio/asm/sortedset"

Index ¶

• func Dedupe(dst, src []byte, size int) []byte
• func Intersect(dst, a, b []byte, size int) []byte
• func Union(dst, a, b []byte, size int) []byte

Functions ¶

func Dedupe ¶

func Dedupe(dst, src []byte, size int) []byte

Dedupe writes to dst the deduplicated sequence of items of the given size read from src, returning the byte slice containing the result.

If dst is too small, a new slice is allocated and returned instead.

The source and destination slices may be the same to perform in-place deduplication of the elements. The behavior is undefined for any other conditions where the source and destination slices overlap.

The function panics if len(src) is not a multiple of the element size.

func Intersect ¶

func Intersect(dst, a, b []byte, size int) []byte

func Union ¶

func Union(dst, a, b []byte, size int) []byte

Source Files ¶

dedupe.go dedupe_amd64.go intersect.go intersect16_amd64.go union.go union16_amd64.go