Re: Calculating tree nodes

Hi,

On Tue, 4 Sep 2007, Jon Smirl wrote:

> In my scheme the path info is moved into the file object nodes and the 
> SHA list is in the commit node.

And how should this "SHA list" be any different from a single tree object, except that you now merge it with the commit object?

Really, go back to the mail Martin mentioned. Having all objects in one list kills performance.

> Diffing two trees in the scheme is quite fast. Just get their commit
> objects into RAM and compare the lists of SHAs.

No, it is not fast. Just loading the complete list into RAM is likely much, much slower than a simple diff _right_ _now_.

Hth, Dscho