Struct bestFastEncoder

zstd/enc_best.go:69–75

bestFastEncoder uses 2 tables, one for short matches (5 bytes) and one for long matches. The long match table contains the previous entry with the same hash, effectively making it a "chain" of length 2. When we find a long match we choose between the two values and select the longest. When we find a

// When we find a short match, after checking the long, we check if we can find a long at n+1
// and that it is longer (lazy matching).
type bestFastEncoder struct {
	fastBase
	table         [bestShortTableSize]prevEntry
	longTable     [bestLongTableSize]prevEntry
	dictTable     []prevEntry
	dictLongTable []prevEntry
}

// Encode improves compression...
func (e *bestFastEncoder) Encode(blk *blockEnc, src []byte) {