mirror of
https://github.com/google/brotli.git
synced 2024-11-22 19:50:06 +00:00
28 lines
727 B
C++
28 lines
727 B
C++
#ifndef BROTLI_RESEARCH_DEORUMMOLAE_H_
|
|
#define BROTLI_RESEARCH_DEORUMMOLAE_H_
|
|
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
|
|
#include <string>
|
|
#include <vector>
|
|
|
|
/* log2(maximal number of files). Value 6 provides some speedups. */
|
|
#define LOG_MAX_FILES 6
|
|
|
|
/* Non tunable definitions. */
|
|
#define MAX_FILES (1 << LOG_MAX_FILES)
|
|
|
|
/**
|
|
* Generate a dictionary for given samples.
|
|
*
|
|
* @param dictionary_size_limit maximal dictionary size
|
|
* @param sample_sizes vector with sample sizes
|
|
* @param sample_data concatenated samples
|
|
* @return generated dictionary
|
|
*/
|
|
std::string DM_generate(size_t dictionary_size_limit,
|
|
const std::vector<size_t>& sample_sizes, const uint8_t* sample_data);
|
|
|
|
#endif // BROTLI_RESEARCH_DEORUMMOLAE_H_
|