Should we compute the adler32 checksum.
Only use matches that are at least 6 bytes long.
Force the compressor to only output raw/uncompressed blocks.
Force the compressor to only output static blocks. (Blocks using the default huffman codes
specified in the deflate specification.)
Should we use greedy parsing (as opposed to lazy parsing where look ahead one or more
bytes to check for better matches.)
Used in miniz to skip zero-initializing hash and dict. We don’t do this here, so
this flag is ignored.
Only look for matches with a distance of 0.
Whether to use a zlib wrapper.