[Haskell-cafe] Implementations of bit vectors

Bulat Ziganshin bulat.ziganshin at gmail.com
Sat Nov 25 12:26:16 EST 2006

Hello Tomasz,

Saturday, November 25, 2006, 5:13:55 PM, you wrote:

> On Sat, Nov 25, 2006 at 10:41:56AM -0200, Maurí­cio wrote:
>>   Does anyone knows of a nice implementation of bit vectors?
>> I like the functions I see in Data.Bits (rotate, shift etc.),
>> but that only works  with predefined sizes and I need a bit
>> vector of exactly 33 bits.

> Unboxed arrays (UArray, IOUArray, STUArray) of Bools work just like a
> bit vector, with 8 elements packed in one byte.

they don't support rotate/shift operations. i think it's better to
implement this himself using Word64

Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com

More information about the Haskell-Cafe mailing list