Gecko [ 167.86.127.34 ]

Name	Size	Permission
example_interface_test.go	1.47 KB	-rw-r--r--
example_keys_test.go	2.68 KB	-rw-r--r--
example_multi_test.go	4.05 KB	-rw-r--r--
example_search_test.go	1.16 KB	-rw-r--r--
example_test.go	2.85 KB	-rw-r--r--
example_wrapper_test.go	1.63 KB	-rw-r--r--
export_test.go	239 B	-rw-r--r--
genzfunc.go	2.91 KB	-rw-r--r--
search.go	4.14 KB	-rw-r--r--
search_test.go	4.25 KB	-rw-r--r--
slice.go	1.26 KB	-rw-r--r--
slice_go113.go	305 B	-rw-r--r--
slice_go14.go	468 B	-rw-r--r--
slice_go18.go	291 B	-rw-r--r--
sort.go	15.8 KB	-rw-r--r--
sort_test.go	15.09 KB	-rw-r--r--
zfuncversion.go	4.82 KB	-rw-r--r--

Code Editor : example_search_test.go

// Copyright 2016 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package sort_test

import (
	"fmt"
	"sort"
)

// This example demonstrates searching a list sorted in ascending order.
func ExampleSearch() {
	a := []int{1, 3, 6, 10, 15, 21, 28, 36, 45, 55}
	x := 6

i := sort.Search(len(a), func(i int) bool { return a[i] >= x })
	if i < len(a) && a[i] == x {
		fmt.Printf("found %d at index %d in %v\n", x, i, a)
	} else {
		fmt.Printf("%d not found in %v\n", x, a)
	}
	// Output:
	// found 6 at index 2 in [1 3 6 10 15 21 28 36 45 55]
}

// This example demonstrates searching a list sorted in descending order.
// The approach is the same as searching a list in ascending order,
// but with the condition inverted.
func ExampleSearch_descendingOrder() {
	a := []int{55, 45, 36, 28, 21, 15, 10, 6, 3, 1}
	x := 6

i := sort.Search(len(a), func(i int) bool { return a[i] <= x })
	if i < len(a) && a[i] == x {
		fmt.Printf("found %d at index %d in %v\n", x, i, a)
	} else {
		fmt.Printf("%d not found in %v\n", x, a)
	}
	// Output:
	// found 6 at index 7 in [55 45 36 28 21 15 10 6 3 1]
}

${this.title}

Code Editor : example_search_test.go