accelerated huffman table allows fast O(1) match of all symbols of length <= STB_VORBIS_FAST_HUFFMAN_LENGTH

if the fast table above doesn't work, we want to binary search them... need to reverse the bits

called twice per file

Assumes that socket_mutex_ is locked and that there are no requests in flight

! @brief returns a const reverse iterator to the last element Returns a const iterator to the reverse-beginning; that is, the last elemen

! @brief returns a const reverse iterator to the last element Returns a const iterator to the reverse-beginning; that is, the last elemen

! @brief returns a const reverse iterator to one before the first Returns a const reverse iterator to the reverse-end; that is, one before

! @brief returns a const reverse iterator to one before the first Returns a const reverse iterator to the reverse-end; that is, one before

transform to use a slow dct-iv; this is STILL basically trivial, but only requires half as many ops

! @brief check whether a string is UTF-8 encoded The function checks each byte of a string whether it is UTF-8 encoded. The result of the

n is 1/2 of the blocksize -- specification: "Correct per-vector decode length is [n]/2"

! For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k. For n == 0, returns 1 and sets pow10 := 1. */

! For n != 0, returns k, such that pow10 := 10^(k-1) <= n < 10^k. For n == 0, returns 1 and sets pow10 := 1. */

fire() sets signals the event, and unblocks any calls to wait().

@brief get next character from the input This function provides the interface to the used input adapter. It does not throw in case the input

! For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached power-of-ten c = f_c * 2^e_c, such that the exponent of the product

! For a normalized diyfp w = f * 2^e, this function returns a (normalized) cached power-of-ten c = f_c * 2^e_c, such that the exponent of the product

rarely used function to seek back to the preceding page while finding the start of a packet

! Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+. M- and M+ must be normalized and share the same exponent -60 <= e <= -32. */

! Generates V = buffer * 10^decimal_exponent, such that M- <= V <= M+. M- and M+ must be normalized and share the same exponent -60 <= e <= -32. */

See documentation in header file. */

See documentation in header file. */

helper functions */

Roll our own versions of these functions to avoid potential locale shenanigans.