Browse thread
[Caml-list] Integer arithmetic: mod
[
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: | Kai Kaminski <kok@w...> |
| Subject: | Re: [Caml-list] Integer arithmetic: mod |
On Mon, Aug 06, 2001 at 11:10:00AM +0200, Xavier Leroy wrote: > > Haskell has both: div & mod truncate downwards, quot & rem truncate > > towards 0. > So does Ada, I think. It's probably a good idea to have two sets of > operators, and document that one of them (those that truncate downwards) > is a bit less efficient. I agree. Is there a chance that this will really happen in a future release of OCaml? Is there a roadmap for OCaml-development? Kai Kaminski ------------------- Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr