package bytealg

Import Path
	internal/bytealg (on golang.org and go.dev)

Dependency Relation
	imports 2 packages, and imported by 6 packages

Involved Source Files
	bytealg.go
	compare_native.go
	count_native.go
	equal_generic.go
	equal_native.go
	index_amd64.go
	index_native.go
	indexbyte_native.go
	compare_amd64.s
	count_amd64.s
	equal_amd64.s
	index_amd64.s
	indexbyte_amd64.s

Exported Values

func Compare(a, b []byte) int
func Count(b []byte, c byte) int
func Cutover(n int) int Cutover reports the number of failures of IndexByte we should tolerate before switching over to Index. n is the number of bytes processed so far. See the bytes.Index implementation for details.
func Equal(a, b []byte) bool Equal reports whether a and b are the same length and contain the same bytes. A nil argument is equivalent to an empty slice. Equal is equivalent to bytes.Equal. It is provided here for convenience, because some packages cannot depend on bytes.
func HashStr(sep string) (uint32, uint32) HashStr returns the hash and the appropriate multiplicative factor for use in Rabin-Karp algorithm.
func HashStrBytes(sep []byte) (uint32, uint32) HashStrBytes returns the hash and the appropriate multiplicative factor for use in Rabin-Karp algorithm.
func HashStrRev(sep string) (uint32, uint32) HashStrRev returns the hash of the reverse of sep and the appropriate multiplicative factor for use in Rabin-Karp algorithm.
func HashStrRevBytes(sep []byte) (uint32, uint32) HashStrRevBytes returns the hash of the reverse of sep and the appropriate multiplicative factor for use in Rabin-Karp algorithm.
func Index(a, b []byte) int Index returns the index of the first instance of b in a, or -1 if b is not present in a. Requires 2 <= len(b) <= MaxLen.
func IndexByte(b []byte, c byte) int
func IndexRabinKarp(s, substr string) int IndexRabinKarp uses the Rabin-Karp search algorithm to return the index of the first occurence of substr in s, or -1 if not present.
func IndexRabinKarpBytes(s, sep []byte) int IndexRabinKarpBytes uses the Rabin-Karp search algorithm to return the index of the first occurence of substr in s, or -1 if not present.
func IndexString(a, b string) int IndexString returns the index of the first instance of b in a, or -1 if b is not present in a. Requires 2 <= len(b) <= MaxLen.
const MaxBruteForce = 64
var MaxLen int MaxLen is the maximum length of the string to be searched for (argument b) in Index. If MaxLen is not 0, make sure MaxLen >= 4.
const PrimeRK = 16777619 PrimeRK is the prime base used in Rabin-Karp algorithm.