[Top][All Lists]

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

Re: breadcrumbs for Info . . . . . .

From: Thien-Thi Nguyen
Subject: Re: breadcrumbs for Info . . . . . .
Date: Fri, 13 Jun 2008 21:55:54 +0200
User-agent: Gnus/5.13 (Gnus v5.13) Emacs/23.0.60 (gnu/linux)

() "Drew Adams" <address@hidden>
() Fri, 13 Jun 2008 10:52:06 -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).


reply via email to

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