2015-11-27 10:27:11 +00:00
|
|
|
/* Copyright 2013 Google Inc. All Rights Reserved.
|
|
|
|
|
2015-12-11 10:11:51 +00:00
|
|
|
Distributed under MIT license.
|
2015-11-27 10:27:11 +00:00
|
|
|
See file LICENSE for detail or copy at https://opensource.org/licenses/MIT
|
|
|
|
*/
|
|
|
|
|
2014-03-20 13:32:35 +00:00
|
|
|
// Class to model the static dictionary.
|
|
|
|
|
|
|
|
#ifndef BROTLI_ENC_STATIC_DICT_H_
|
|
|
|
#define BROTLI_ENC_STATIC_DICT_H_
|
|
|
|
|
2015-10-01 10:08:14 +00:00
|
|
|
#include "./types.h"
|
2015-04-01 14:29:04 +00:00
|
|
|
|
2014-03-20 13:32:35 +00:00
|
|
|
namespace brotli {
|
|
|
|
|
2016-01-07 15:27:49 +00:00
|
|
|
static const size_t kMaxDictionaryMatchLen = 37;
|
|
|
|
static const uint32_t kInvalidMatch = 0xfffffff;
|
2015-06-12 14:45:17 +00:00
|
|
|
|
|
|
|
// Matches data against static dictionary words, and for each length l,
|
|
|
|
// for which a match is found, updates matches[l] to be the minimum possible
|
|
|
|
// (distance << 5) + len_code.
|
|
|
|
// Prerequisites:
|
|
|
|
// matches array is at least kMaxDictionaryMatchLen + 1 long
|
|
|
|
// all elements are initialized to kInvalidMatch
|
|
|
|
bool FindAllStaticDictionaryMatches(const uint8_t* data,
|
2016-01-07 15:27:49 +00:00
|
|
|
size_t min_length,
|
|
|
|
size_t max_length,
|
|
|
|
uint32_t* matches);
|
2014-03-20 13:32:35 +00:00
|
|
|
|
|
|
|
} // namespace brotli
|
|
|
|
|
|
|
|
#endif // BROTLI_ENC_STATIC_DICT_H_
|