github.com/andybalholm/brotli/matchfinder.Trio.MaxDistance (field)

15 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		trio.go#L8: 	MaxDistance int
		trio.go#L23: 	if z.MaxDistance == 0 {
		trio.go#L24: 		z.MaxDistance = 1 << 16
		trio.go#L27: 	if len(z.history) > z.MaxDistance*2 {
		trio.go#L28: 		delta := len(z.history) - z.MaxDistance
		trio.go#L30: 		z.history = z.history[:z.MaxDistance]
		trio.go#L122: 			if candidate12.offset < s && s-candidate12.offset < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L129: 			if candidate8.offset < s && s-candidate8.offset < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L135: 			if candidate5.offset < s && s-candidate5.offset < int32(z.MaxDistance) && uint32(cv) == candidate5.val &&
		trio.go#L163: 			if candidate12.offset < s+1 && coffset12 < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L167: 			} else if hashLengthFound < 8 && candidate8.offset < s+1 && coffset8 < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&
		trio.go#L214: 			if candidate12.offset < s && s-candidate12.offset < int32(z.MaxDistance) && uint32(cv) == candidate12.val &&
		trio.go#L218: 			} else if candidate8.offset < s && s-candidate8.offset < int32(z.MaxDistance) && uint32(cv) == candidate8.val &&

	github.com/andybalholm/brotli
		writer.go#L141: 		mf = &matchfinder.Trio{MaxDistance: 1 << 20}

	github.com/andybalholm/brotli/flate
		writer.go#L32: 		mf = &matchfinder.Trio{MaxDistance: 1 << 15}