As for array updating, there are many ways to improve the O(n) update.
You can use a tree representation and get O(log n) for all operations.
You can use the array single threaded in the ST monad and get all the
usual array operation complexities.
Etc. etc.
On Mon, Aug 18, 2008 at 8:16 AM, Ramin Honary
Really? Where the bounds checking can be done at compile-time? (Excluding cases where the array object is accessed by a constant value set at run-time...) I have seen an array type, but not a "bounded array" type where the size of the array is given in the type definition, (as I explained with the example in my last e-mail.) Then is there any work being done in Haskell prime to improve the efficiency of updating arrays. From the wiki pages I have read, it is impossible to make any array that updates faster than O(n). (Also, should I send replies to the haskell wiki?)