On Wed, 2006-09-13 at 15:52 -0700, Nathaniel Smith wrote: > Regarding the basic dependency-based algorithm, the approach of > throwing everything into blobs and then trying to tease them apart > again seems backwards. What I'm thinking is, first we go through and > build the history graph for each file. Now, advance a frontier across > the all of these graphs simultaneously. Your frontier is basically a > map <filename -> CVS revision>, that represents a tree snapshot. Parsecvs does this, except backwards from now into the past; I found it easier to identify merge points than branch points (Oh, look, these two branches are the same now, they must have merged). However, this means that parsecvs must hold the entire tree state in memory, which turned out to be its downfall with large repositories. Worked great for all of X.org, not so good with Mozilla. -- keith.packard@xxxxxxxxx
Attachment:
signature.asc
Description: This is a digitally signed message part