I have found out that when I compile my program with bounds checking on, it takes 8 minutes to compile on a 933Mhz machine. However, when I turn off bounds checking, the program compiles in about 2 minutes. Why so much more compile time to put in bounds checking? The Lahey and Salford compilers are able to put in bounds checking with minimal impact on compile times. Anyone else have this problem?
For more complete information about compiler optimizations, see our Optimization Notice.