On 13 Sep, Simon Marlow wrote:

> The common case of applying a dyadic operation to small Integers would
> then be pretty close in performance to that of Int (a couple of
> indirect jumps, and a test/branch for the overflow detection, to be
> precise).

Now that's more like what I had in mind. Isn't it also possible to
reduce the number of checks for sequences of operations?

-- 
Jon Fairbairn                                 [EMAIL PROTECTED]
18 Kimberley Road                                        [EMAIL PROTECTED]
Cambridge CB4 1HH                      +44 1223 570179 (pm only, please)



Reply via email to