brotli

type CompositeHasher struct {
	A, B Hasher
}

type Encoder struct {
	// contains filtered or unexported fields
}

type H2 struct {
	// contains filtered or unexported fields
}

type H3 struct {
	// contains filtered or unexported fields
}

type H4 struct {
	// contains filtered or unexported fields
}

type H5 struct {
	// BlockBits is the base-2 logarithm of the number of entries per hash
	// bucket. The reference implementation sets it to one less than the
	// compression level.
	BlockBits int

	// BucketBits is the base-2 logarithm of the number of hash buckets.
	// The reference implementation sets it to 14 or 15.
	BucketBits int
	// contains filtered or unexported fields
}

type H6 struct {
	// BlockBits is the base-2 logarithm of the number of entries per hash
	// bucket. The reference implementation sets it to one less than the
	// compression level.
	BlockBits int

	// BucketBits is the base-2 logarithm of the number of hash buckets.
	// The reference implementation sets it to 14 or 15.
	BucketBits int

	// HashLen is the number of bytes to hash. The reference implementation
	// normally sets it to 5.
	HashLen int
	// contains filtered or unexported fields
}

type Hasher interface {
	// Init allocates the Hasher's internal storage, or clears it if
	// it is already allocated. Init must be called before any of the other
	// methods.
	Init()

	// Store puts an entry in the hash table for the data at index.
	Store(data []byte, index int)

	// Candidates hashes the data at index, fetches a list of possible matches
	// from the hash table, and appends the list to dst.
	Candidates(dst []int, data []byte, index int) []int
}

type M0 struct {
	// Lazy turns on "lazy matching," for higher compression but less speed.
	Lazy bool

	MaxDistance int
	MaxLength   int
}

type MatchFinder struct {
	Hasher Hasher

	// MaxLength is the limit on the length of matches to find;
	// 0 means unlimited.
	MaxLength int

	// MaxDistance is the limit on the distance to look back for matches;
	// 0 means unlimited.
	MaxDistance int

	// MaxHistory is the limit on how much data from previous blocks is
	// kept around to look for matches in; 0 means that no matches from previous
	// blocks will be found.
	MaxHistory int

	// MinHistory is the amount of data that is used to start a new history
	// buffer after the size exceeds MaxHistory.
	MinHistory int
	// contains filtered or unexported fields
}