* Rebase the bit writer onto a reallocated buffer. * * @param buffer the buffer where to put bits * @param buffer_size the size in bytes of buffer,

random generated table

* two-loop quantizers search taken from ISO 13818-7 Appendix C */

* Change the end of the buffer. * * @param size the new size in bytes of the buffer where to put bits */

* write signed exp golomb code. 16 bits at most. */

* write signed golomb rice code (ffv1). */

* write signed golomb rice code (flac). */

* write truncated unsigned exp golomb code. */

* write unsigned exp golomb code. 2^32-2 at most. */

* Skip the given number of bytes. * PutBitContext must be flushed & aligned to a byte boundary before calling this. */

@note not speed critical, hence not optimized */

P(7)

DCTextra

fixme: add 1 bit to all the calls to this?

how probabilities are associated with decisions is different I think well, the new scheme fits in the old but this way has one fewer branches per deci

XOR four bytes into one. */

Virtual destructor. */

Virtual destructor. */

Virtual destructor. */

Virtual destructor. */

Virtual destructor. */