mirror of
https://github.com/google/brotli.git
synced 2024-11-08 05:10:06 +00:00
7f740f1308
- fix formatting - fix type conversion - fix no-op arithmetic with null-pointer - improve performance of hash_longest_match64 - go: detect read after close - java decoder: support compound dictionary - remove executable flag on non-scripts
22 lines
598 B
C++
22 lines
598 B
C++
#ifndef BROTLI_RESEARCH_SIEVE_H_
|
|
#define BROTLI_RESEARCH_SIEVE_H_
|
|
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
/**
|
|
* Generate a dictionary for given samples.
|
|
*
|
|
* @param dictionary_size_limit maximal dictionary size
|
|
* @param slice_len text slice size
|
|
* @param sample_sizes vector with sample sizes
|
|
* @param sample_data concatenated samples
|
|
* @return generated dictionary
|
|
*/
|
|
std::string sieve_generate(size_t dictionary_size_limit, size_t slice_len,
|
|
const std::vector<size_t>& sample_sizes, const uint8_t* sample_data);
|
|
|
|
#endif // BROTLI_RESEARCH_SIEVE_H_
|