|
|
Warp wrote:
> I have really hard time believing that if you, for example, calculate
> the sum of all the integers in an array, adding boundary checks to every
> single read operation will add only 4% of overhead.
Accessing "everything in this array" is a pretty common operation - and
one that an optimising compiler can presumably spot and optimise pretty
easily.
Now, if you start accessing an array in some really random order... (And
let's face it, what the hell are arrays especially good at?)
--
http://blog.orphi.me.uk/
http://www.zazzle.com/MathematicalOrchid*
Post a reply to this message
|
|