#include <hash.h>
◆ dict_num_lookups
◆ dict_num_matches
◆ extra
Dynamically allocated areas; regular hasher uses one or two allocations; "composite" hasher uses up to 4 allocations.
◆ is_prepared_
False if hasher needs to be "prepared" before use (before the first invocation of HasherSetup or after HasherReset). "preparation" is hasher data initialization (using input ringbuffer).
◆ is_setup_
False before the fisrt invocation of HasherSetup (where "extra" memory) is allocated.
◆ params
The documentation for this struct was generated from the following files:
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_brotli/brotli-1.0.9/c/enc/hash.h
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_brotli/brotli-1.1.0/c/enc/hash.h
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_brotli2/brotli-1.0.9/c/enc/hash.h
- C:/Pereira/Dua/source forge files my love/tar_dll/val/xcx_brotli2/brotli-1.1.0/c/enc/hash.h