mirror of
https://github.com/google/brotli.git
synced 2025-01-16 19:24:12 +00:00
c6b9c7c5c8
This commit contains a batch of changes that were made to the Brotli compression algorithm in the last three weeks. Most important changes: * Added UTF8 context model for good text compression. * Simplified context modeling by having only 4 context modes. * Per-block context mode selection. * Faster backward copying and bit reading functions. * More efficient histogram coding. * Streaming support for the decoder and encoder.
34 lines
1.2 KiB
C++
34 lines
1.2 KiB
C++
// Copyright 2013 Google Inc. All Rights Reserved.
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
//
|
|
// Literal cost model to allow backward reference replacement to be efficient.
|
|
|
|
#ifndef BROTLI_ENC_LITERAL_COST_H_
|
|
#define BROTLI_ENC_LITERAL_COST_H_
|
|
|
|
#include <stddef.h>
|
|
#include <stdint.h>
|
|
|
|
namespace brotli {
|
|
|
|
// Estimates how many bits the literals in the interval [pos, pos + len) in the
|
|
// ringbuffer (data, mask) will take entropy coded and writes these estimates
|
|
// to the ringbuffer (cost, mask).
|
|
void EstimateBitCostsForLiterals(size_t pos, size_t len, size_t mask,
|
|
const uint8_t *data, float *cost);
|
|
|
|
} // namespace brotli
|
|
|
|
#endif // BROTLI_ENC_LITERAL_COST_H_
|