go/src/sort/search_test.go

func f(a []int, x int) func(int) bool { … }

var data …

var tests …

func TestSearch(t *testing.T) { … }

func TestFind(t *testing.T) { … }

// log2 computes the binary logarithm of x, rounded up to the next integer.
// (log2(0) == 0, log2(1) == 0, log2(2) == 1, log2(3) == 2, etc.)
func log2(x int) int { … }

func TestSearchEfficiency(t *testing.T) { … }

var fdata …

var sdata …

var wrappertests …

func TestSearchWrappers(t *testing.T) { … }

func runSearchWrappers() { … }

func TestSearchWrappersDontAlloc(t *testing.T) { … }

func BenchmarkSearchWrappers(b *testing.B) { … }

// Abstract exhaustive test: all sizes up to 100,
// all possible return values. If there are any small
// corner cases, this test exercises them.
func TestSearchExhaustive(t *testing.T) { … }

// Abstract exhaustive test for Find.
func TestFindExhaustive(t *testing.T) { … }