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
[Caml-list] Int overflow in literals
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2003-10-30 (19:40)
From: Marcin 'Qrczak' Kowalczyk <qrczak@k...>
Subject: Re: [Caml-list] Int overflow in literals
W li¶cie z czw, 30-10-2003, godz. 20:20, Oleg Trott pisze:

> I'm also curious if raising an exception in case of arithmetic overflows
> instead of silently accepting them would have a significant performance
> impact on modern CPUs - few, if anyone, mean to do mod 2^31 
> arithmetic.

Perhaps it should be like array bounds checking: separate functions for
both variants, with + resolving to either depending on -unsafe option?

   __("<         Marcin Kowalczyk

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