[m-dev.] diff: Array reorganisation

[Fergus Henderson]

Andrew Bromage, you wrote:
> +% The heart of the implementation of bt_array is a `random access list'
> +% or ra_list for short.  It is very similar to a list data type, and
> +% it supports O(1) head/tail/cons operations, but O(log n) lookup and
> +% update.  The representation is a list of perfectly balanced forest
> +% of binary trees.

Delete `forest of'.

> +% For mode details on the implementation:

s/mode/more/

Otherwise those changes look fine.

-- 
Fergus Henderson <fjh at cs.mu.oz.au>   |  "I have always known that the pursuit
WWW: <http://www.cs.mu.oz.au/~fjh>   |  of excellence is a lethal habit"
PGP: finger fjh at 128.250.37.3         |     -- the last words of T. S. Garp.