package simd

import "github.com/dgraph-io/ristretto/z/simd"

Index ¶

• func Binary(keys []uint64, key uint64) int16
• func Clever(xs []uint64, k uint64) int16
• func Naive(xs []uint64, k uint64) int16
• func Parallel(xs []uint64, k uint64) int16
• func Search(xs []uint64, k uint64) int16

Functions ¶

func Binary ¶

func Binary(keys []uint64, key uint64) int16

func Clever ¶

func Clever(xs []uint64, k uint64) int16

func Naive ¶

func Naive(xs []uint64, k uint64) int16

Search finds the key using the naive way

func Parallel ¶

func Parallel(xs []uint64, k uint64) int16

func Search ¶

func Search(xs []uint64, k uint64) int16

Search finds the first idx for which xs[idx] >= k in xs.

Source Files ¶

baseline.go stub_search_amd64.go