1a2f01efa6
Update the Go library to the 1.10beta1 release.
Requires a few changes to the compiler for modifications to the map
runtime code, and to handle some nowritebarrier cases in the runtime.
Reviewed-on: https://go-review.googlesource.com/86455
gotools/:
* Makefile.am (go_cmd_vet_files): New variable.
(go_cmd_buildid_files, go_cmd_test2json_files): New variables.
(s-zdefaultcc): Change from constants to functions.
(noinst_PROGRAMS): Add vet, buildid, and test2json.
(cgo$(EXEEXT)): Link against $(LIBGOTOOL).
(vet$(EXEEXT)): New target.
(buildid$(EXEEXT)): New target.
(test2json$(EXEEXT)): New target.
(install-exec-local): Install all $(noinst_PROGRAMS).
(uninstall-local): Uninstasll all $(noinst_PROGRAMS).
(check-go-tool): Depend on $(noinst_PROGRAMS). Copy down
objabi.go.
(check-runtime): Depend on $(noinst_PROGRAMS).
(check-cgo-test, check-carchive-test): Likewise.
(check-vet): New target.
(check): Depend on check-vet. Look at cmd_vet-testlog.
(.PHONY): Add check-vet.
* Makefile.in: Rebuild.
From-SVN: r256365
66 lines
1.5 KiB
Go
66 lines
1.5 KiB
Go
// Copyright 2015 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.
|
|
|
|
// -build !amd64,!s390x,!arm64
|
|
|
|
package bytes
|
|
|
|
// Index returns the index of the first instance of sep in s, or -1 if sep is not present in s.
|
|
func Index(s, sep []byte) int {
|
|
n := len(sep)
|
|
switch {
|
|
case n == 0:
|
|
return 0
|
|
case n == 1:
|
|
return IndexByte(s, sep[0])
|
|
case n == len(s):
|
|
if Equal(sep, s) {
|
|
return 0
|
|
}
|
|
return -1
|
|
case n > len(s):
|
|
return -1
|
|
}
|
|
c := sep[0]
|
|
i := 0
|
|
fails := 0
|
|
t := s[:len(s)-n+1]
|
|
for i < len(t) {
|
|
if t[i] != c {
|
|
o := IndexByte(t[i:], c)
|
|
if o < 0 {
|
|
break
|
|
}
|
|
i += o
|
|
}
|
|
if Equal(s[i:i+n], sep) {
|
|
return i
|
|
}
|
|
i++
|
|
fails++
|
|
if fails >= 4+i>>4 && i < len(t) {
|
|
// Give up on IndexByte, it isn't skipping ahead
|
|
// far enough to be better than Rabin-Karp.
|
|
// Experiments (using IndexPeriodic) suggest
|
|
// the cutover is about 16 byte skips.
|
|
// TODO: if large prefixes of sep are matching
|
|
// we should cutover at even larger average skips,
|
|
// because Equal becomes that much more expensive.
|
|
// This code does not take that effect into account.
|
|
j := indexRabinKarp(s[i:], sep)
|
|
if j < 0 {
|
|
return -1
|
|
}
|
|
return i + j
|
|
}
|
|
}
|
|
return -1
|
|
}
|
|
|
|
// Count counts the number of non-overlapping instances of sep in s.
|
|
// If sep is an empty slice, Count returns 1 + the number of UTF-8-encoded code points in s.
|
|
func Count(s, sep []byte) int {
|
|
return countGeneric(s, sep)
|
|
}
|