github.com/andybalholm/brotli/matchfinder.Match.Distance (field)

29 uses

	github.com/andybalholm/brotli/matchfinder (current package)
		bargain1.go#L192: 				Distance: int(a.distance),
		bargain2.go#L224: 				Distance: int(a.distance),
		bargain3.go#L250: 				Distance: int(a.distance),
		emitter.go#L31: 		Distance:  m.Start - m.Match,
		m0.go#L138: 			Distance:  base - candidate,
		m4.go#L130: 			prevDistance := e.Dst[len(e.Dst)-1].Distance
		matchfinder.go#L19: 	Distance  int // how far back in the stream to copy from
		pathfinder.go#L312: 				Distance: int(a.distance),
		textencoder.go#L19: 			dst = append(dst, []byte(fmt.Sprintf("<%d,%d>", m.Length, m.Distance))...)
		trio.go#L110: 				prevDistance := int32(e.Dst[len(e.Dst)-1].Distance)
		zdfast.go#L122: 					Distance:  int(start - repIndex),
		zdfast.go#L190: 			Distance:  int(s - t),
		zdfast.go#L231: 				Distance: int(offset2),
		zfast.go#L116: 					Distance:  int(start - repIndex),
		zfast.go#L165: 			Distance:  int(s - t),
		zfast.go#L183: 				Distance: int(offset2),
		zm.go#L101: 				prevDistance := int32(e.Dst[len(e.Dst)-1].Distance)

	github.com/andybalholm/brotli
		encoder.go#L63: 		command := combineLengthCodes(insertCode, copyCode, i > 0 && m.Distance == matches[i-1].Distance)
		encoder.go#L69: 			switch m.Distance {
		encoder.go#L94: 				distCode = getDistanceCode(m.Distance)
		encoder.go#L100: 				d[0], d[1], d[2], d[3] = d[1], d[2], d[3], m.Distance
		encoder.go#L130: 		command := combineLengthCodes(insertCode, copyCode, i > 0 && m.Distance == matches[i-1].Distance)
		encoder_fast.go#L154: 			if i == 0 || m.Distance != matches[i-1].Distance {
		encoder_fast.go#L155: 				distCode = getDistanceCode(m.Distance)

	github.com/andybalholm/brotli/flate
		huffman_bit_writer.go#L444: 		w.offsetFreq[offsetCode(m.Distance)]++
		huffman_bit_writer.go#L494: 		offset := m.Distance