[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

RE: breadcrumbs for Info . . . . . .

From: Drew Adams
Subject: RE: breadcrumbs for Info . . . . . .
Date: Fri, 13 Jun 2008 13:10:59 -0700

>    Even if the "cache" consisted only of a set of node+parent pairs
>    (regardless of the order among pairs), that would be sufficient.
> A slight twist on that data structure will give us a "reverse trie",
> which is a set of elements (NODE PARENT PARENT^2...), with elements'
> tails sharing storage (i.e, being other elements of the set).

Cf. `Info-build-toc'.

reply via email to

[Prev in Thread] Current Thread [Next in Thread]