I must have misremembered it from somewhere, perhaps confusing it with -fliberate-case-threshold mentioned a while ago (which probably belongs in the "experimental" category?)
Turing off bounds checking could be fairly useful, I think, if there is a significant speedup to be gained. My impression is that the typical Ada programmer tests the program thoroughly with bounds checking, but compiles without for deployment. (Of course, we would rather *know* a priori that we're not going out of bounds, rather than just test for it, but it seems to work all right for them)
I don't know how the Ada guys do it. Perhaps they have an alternate set of compiled libraries with bounds-checking turned off?
There are array operations that avoid bounds checking, however (eg. unsafeRead, unsafeWrite).
I suppose I can do it by wrapping array accesses in a class or otherwise, with a safe and an unsafe implementation, and switch when I'm satisfied things work.
Yes, that would do it.
-kzm
PS: is large file support in the vicinity yet?
Large file support will be in 6.2. Cheers, Simon