package bytesutil

import "github.com/influxdata/influxdb/pkg/bytesutil"

Index ¶

• func Clone(b []byte) []byte
• func CloneSlice(a [][]byte) [][]byte
• func Contains(a [][]byte, x []byte) bool
• func Intersect(a, b [][]byte) [][]byte
• func IsSorted(a [][]byte) bool
• func Pack(a []byte, width int, val byte) []byte
• func SearchBytes(a [][]byte, x []byte) int
• func SearchBytesFixed(a []byte, sz int, fn func(x []byte) bool) int
• func Sort(a [][]byte)
• func SortDedup(a [][]byte) [][]byte
• func Union(a, b [][]byte) [][]byte

Functions ¶

func Clone ¶

func Clone(b []byte) []byte

Clone returns a copy of b.

func CloneSlice ¶

func CloneSlice(a [][]byte) [][]byte

CloneSlice returns a copy of a slice of byte slices.

func Contains ¶

func Contains(a [][]byte, x []byte) bool

Contains returns true if x is an element of the sorted slice a.

func Intersect ¶

func Intersect(a, b [][]byte) [][]byte

Intersect returns the intersection of a & b in sorted order.

func IsSorted ¶

func IsSorted(a [][]byte) bool

func Pack ¶

func Pack(a []byte, width int, val byte) []byte

Pack converts a sparse array to a dense one. It removes sections of a containing runs of val of length width. The returned value is a subslice of a.

func SearchBytes ¶

func SearchBytes(a [][]byte, x []byte) int

SearchBytes performs a binary search for x in the sorted slice a.

func SearchBytesFixed ¶

func SearchBytesFixed(a []byte, sz int, fn func(x []byte) bool) int

SearchBytesFixed searches a for x using a binary search. The size of a must be a multiple of of x or else the function panics. There returned value is the index within a where x should exist. The caller should ensure that x does exist at this index.

func Sort ¶

func Sort(a [][]byte)

Sort sorts a slice of byte slices.

func SortDedup ¶

func SortDedup(a [][]byte) [][]byte

SortDedup sorts the byte slice a and removes duplicates. The ret

func Union ¶

func Union(a, b [][]byte) [][]byte

Union returns the union of a & b in sorted order.

Source Files ¶

bytesutil.go