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

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 or if gz_init(

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

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, whos

* Return the number of elements in a list. */

** search function for integers */

deallocates a osip_to_t structure. */ INPUT : osip_to_t *to | to header. */

* Return a iterator that points position before current position. */

* Return the number of elements in a slist. */

* Access vector data using subscript. */

comput the md5 based on input, (just this one input)

get the md5 value of hex style

------------------------------------------------------------------------------

------------------------------------------------------------------------------

* Element compare function auxiliary */

* Test if a avl tree is empty. */

* Tests if the two avl tree are equal. */

* Inserts an unique element into a avl tree. */

* Test the two pair is have the same type. */

* Test the two pair is have the same type. */

* Initialize hashtable container. */

* Get the number of elements int the hashtable. */

* Test the first iterator is before the second. */

* Tests if the two rb tree are equal. */

* Inserts an unique element into a rb tree. */

* Transfer the range [it_begin, it_end) to position it_pos. */

* Test the type is registered or not */

* Return a iterator that points just beyond the end of basic_string container. */