> Date: Tue, 27 Feb 2001 23:55:41 +0530
> From: varadharajan <[log in to unmask]>
> Hello.
>
> Actually during one of our applications we ran into similar trouble with
> array size being too large to be represented. But that I guess was a
> system limitation. But knowing that a program would involve such a large
> size we can design our data structures to circumvent this problem can't
> we? After all the actual problem is not that there is no memory but just
> that the "address" required is unmanageable. For instance, if the indices
> go from -n/2 .. n/2 instead of 0 .. n we reduce the highest integer
> involved.
This may get around the computtion of the subscript position
but won't help SIZE, as the size of the array will exceed magnitude.
> Thanks
>
> Varadharajan S
|