Re: To increase speed on manipulating big arrays in Java with minimal bounds checking, ...

Chris Uppal wrote: 
Thomas Hawtin wrote:

This sort of low level optimisation is not something to be concerned
about.


Unless, of course, you are manipulating large amounts of data and the
application is running too[*] slow.

Which is a perfectly reasonable scenario.

I'd start at oprimisations that reduce the amount of data involved and accesses to it, rather than focus on some kind of made up worries.

Tom Hawtin

> ([*] for any of several possible values of "too", eg:
> - three times slower than the legacy application we are trying to replace.
> - it takes a week to run, but we need to run it once per day.
> - it takes 120 millisecs to run, but I need to refresh the frame 25
> times/second.
> - it takes several hours to run, so any significant speedup would be useful
> - ...
> )

I'm not seeing how array bounds checking comes into this. This kind of optimisation is handled by the runtime.
--
Unemployed English Java programmer
http://jroller.com/page/tackline/
.