On Mon, 2008-03-24 at 11:25 +0100, Henrik Nordstrom wrote:
> On Sun, 2008-03-23 at 18:29 +0900, Adrian Chadd wrote:
>
> > The real solution is a tree for offset lookups, and a linear walk of order
> > O(1) for subsequent sequential accesses.
>
> Walking a tree is usually a cheap operation, unless
On Sun, 2008-03-23 at 18:29 +0900, Adrian Chadd wrote:
> The real solution is a tree for offset lookups, and a linear walk of order
> O(1) for subsequent sequential accesses.
Walking a tree is usually a cheap operation, unless the tree is wrongly
designed. You just need to remember the current tr
