add a new point, do not check space */

add a new point, do not check space */

Segher was off (too high) by ~ .3 decibel. Center the conversion correctly. */

Find a given value in the set. * \param pValue The value to find. * \return The value in the set, or NULL if the value is not found in the set. */

precision: YFIX -> TFIX

Mostly used to reduce code size + readability

Aggregated costs

========================================================================= */

convert Half-16 to internal format, only need to handle sign bit

========================================================================= */

Compress whatever is at avail_in and next_in and write to the output file. Return -1 if there is an error writing to the output file, otherwise 0.

Build a set of tables to decode the provided canonical Huffman code. The code lengths are lens[0..codes-1]. The result starts at *table, whose

pixel to float 32!

Place a 32-bit number into a buffer in PNG byte order. We work * with unsigned numbers for convenience, although one supported * ancillary chunk us

Write the start of a PNG chunk. The type is the chunk type. * The total_length is the sum of the lengths of all the data you will be * passing in p

Ensure that png_ptr->zstream.msg holds some appropriate error message string. * If it doesn't 'ret' is used to set it to something appropriate, even

Read one byte, testing for EOF */

pre filter stuff **/ 2-point pre for boundaries **/

add current glyph to the base image -- and prepare for another */

add current glyph to the base image -- and prepare for another */

rewind the glyph loader - reset counters to 0 */

rewind the glyph loader - reset counters to 0 */

Load uncompressed image pixels for 1-, 4-, 8-, 16-, 24- and 32-bit dib @param io FreeImage IO @param handle FreeImage IO handle @param dib Image to be

Fast calculation of v * log2(v) for integer input.