"Walter Bright" wrote in message news:m4mggi$e1h$1...@digitalmars.com...
BTW, granted the 0x7FFFFFFF problems exhibit the bugs less often, but
paradoxically this can make the bug worse, because then it only gets found
much, much later in supposedly tested & robust code.
0 crossing bugs tend to show up much sooner, and often immediately.
I don't think I have ever written a D program where an array had more than
2^^31 elements. And I'm sure I've never had it where 2^31-1 wasn't enough
and yet 2^^32-1 was.
Zero, on the other hand, is usually quite near the typical array lengths and
differences in lengths.
