Text_Huffman and questions regarding PEAR membership

Hi Cipriano, hi Devs thanks for your words. As a newbie, I am not completely satisfied, because I simply haven't understood the process of becoming a fully featured PEAR member ;-) As one can see, I changed all things mentioned in the comments of the conditional votings for Text_Huffman. This can clearly be seen by looking at the code, which can be found here: http://pear.docuverse.de/ This is what I did according to the conditional votes: 1. More comments (Justin Patrin) 2. Re-read coding guidelines and changed my code (Michael Wallner, Sérgio Carvalho, Stephan Schmidt) 3. Put protected members of base class final, changed protected methods in derived classes to private (Hans Lellelid, Bertrand Mansion) So what can I do now or what must be done by the PEAR group? I'm a little bit stuck here... In the meantime I started coding a huffman Extension for PECL. As the discussion about Net_IDNA shows, there might be the chance, that someone else is working on that. Please, are there any caveats, comments, wishes for the C-Extension, which currently have the following functions: string huffman_encode( string ) string huffman_decode( string ) bool huffman_encode_file( file in, file out) bool huffman_decode_file( file in, file out) For your information: Huffman compression belongs into a family of algorithms with a variable codeword length. That means that individual symbols (characters in a text file for instance) are replaced by bit sequences that have a distinct length. So symbols that occur a lot in a file are given a short sequence while other that are used seldom get a longer bit sequence. Huffman Compression is about 50 years old and is used in various media formats such as GIF. All the best, Markus