Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
RE: [Caml-list] implementing bit vectors in OCaml
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-06-02 (13:30)
From: Gregory Morrisett <jgm@C...>
Subject: RE: [Caml-list] implementing bit vectors in OCaml
>   * An array of tagged integers, which will be less efficient as
>     dividing by 31 is more expensive than shifting.

Wait -- you can still use tagged integers.  Why do you need
to divide by 31?  You can still use Bits.lsr/lsl/land/etc, no?


To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: