Dear Mr. Mechveliani,
I thought efficient arrays are impossible in functional language.
I'm not sharing this thought...
Here is a quote from the Haskell Library Report:
\begin{quote}
``Haskell provides indexable arrays, which may be thought of as functions
whose domains are
Concerning 'rapid access' you found in docs - it is hard to believe
this access is as fast as in C array - i mean changing X[i] in array
X. Because when this change is done fast, it is a side effect, breaks
functionality.
I always thought that this is the main cost the functional world pays
for
Date: Fri, 19 Feb 1999 09:41:58 +0100 (MET)
From: Lennart Augustsson [EMAIL PROTECTED]
CC: [EMAIL PROTECTED], [EMAIL PROTECTED],
[EMAIL PROTECTED]
Concerning 'rapid access' you found in docs - it is hard to believe
this access is as fast as in C array - i mean changing X[i] in
