Browse thread
RE: [Caml-list] implementing bit vectors in OCaml
- Gregory Morrisett
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
| Date: | -- (:) |
| 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? -Greg ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners