Re: Why doesn't Info `T' cache node tree for current file?

[Eli Zaretskii]

> From: "Drew Adams" <address@hidden>
> Cc: <address@hidden>
> Date: Tue, 10 Jun 2008 11:09:20 -0700
> 
> > AFAIK, Info doesn't maintain the node structure (it doesn't need to be
> > a tree, btw, it could be a graph) in memory at all.  It doesn't need
> > to, except for Info-toc.  So if you are suggesting that the results of
> > Info-toc should be stashed away waiting for the user to invoke
> > Info-toc again for the same Info file, then maybe we should do it;
> 
> Yes, that's what I was thinking of.
> But I was just wondering why it isn't done.

Simple: because it isn't needed.  All Info needs to move from a node
is 3 pointers (next, prev, and up), and these are written on the
header line of each node.  So there's no need to build any structure
in memory at all, the information is always at Info's fingertips.

> Actually, `T' seems to create the TOC buffer quite quickly.

One more reason not to bother saving it.

> I'm a bit surprised, when I look at the code. It seems like it would
> not be so quick.

It gets help from the detailed node listing in the Top node.