I am trying to implement data compression code (lzw) and have been using a home grown binary tree implementation which runs too slowly. I would prefer to use a fast/destructive finite map implementation... Can anyone recommend one? -Alex- ___________________________________________________________________ S. Alexander Jacobson i2x Media 1-212-697-0184 voice 1-212-697-1427 fax
Fast Finite Maps w/ destructive update
S. Alexander Jacobson Mon, 7 Dec 1998 14:03:50 -0500 (Eastern Standard Time)
- Re: Fast Finite Maps w/ destructive update S. Alexander Jacobson
- Re: Fast Finite Maps w/ destructive update Ralf Hinze
