package bytealg

import "internal/bytealg"

Index ¶

• Constants
• Variables
• func Compare(a, b []byte) int
• func Count(b []byte, c byte) int
• func CountString(s string, c byte) int
• func Cutover(n int) int
• func Equal(a, b []byte) bool
• func HashStr(sep string) (uint32, uint32)
• func HashStrBytes(sep []byte) (uint32, uint32)
• func HashStrRev(sep string) (uint32, uint32)
• func HashStrRevBytes(sep []byte) (uint32, uint32)
• func Index(a, b []byte) int
• func IndexByte(b []byte, c byte) int
• func IndexByteString(s string, c byte) int
• func IndexRabinKarp(s, substr string) int
• func IndexRabinKarpBytes(s, sep []byte) int
• func IndexString(a, b string) int

Constants ¶

const MaxBruteForce = 64

const PrimeRK = 16777619

PrimeRK is the prime base used in Rabin-Karp algorithm.

Variables ¶

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.

Functions ¶

func Compare ¶

func Compare(a, b []byte) int

func Count ¶

func Count(b []byte, c byte) int

func CountString ¶

func CountString(s string, c byte) int

func Cutover ¶

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 ¶

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 ¶

func HashStr(sep string) (uint32, uint32)

HashStr returns the hash and the appropriate multiplicative factor for use in Rabin-Karp algorithm.

func HashStrBytes ¶

func HashStrBytes(sep []byte) (uint32, uint32)

HashStrBytes returns the hash and the appropriate multiplicative factor for use in Rabin-Karp algorithm.

func HashStrRev ¶

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 ¶

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 ¶

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 ¶

func IndexByte(b []byte, c byte) int

func IndexByteString ¶

func IndexByteString(s string, c byte) int

func IndexRabinKarp ¶

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 ¶

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 ¶

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.

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