It doesn't store both, but does provides a flexible indexing strategy (that
allows indices to be non-trivial values). What docs suggest that it stores
both?

On Wed, Dec 16, 2009 at 10:38 PM, michael rice <[email protected]> wrote:

> Based upon docs I've looked at, Haskell seems to store both an array
> element value AND its index/indices, whereas most languages just store the
> value and find its location in memory through mapping calculations.
>
> Is it true?
>
> Michael
>
>
> _______________________________________________
> Haskell-Cafe mailing list
> [email protected]
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
>
_______________________________________________
Haskell-Cafe mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/haskell-cafe

Reply via email to