Another possible optimization is to use tags. Suppose we have the patches:
ABCDEFGHIJK<Tag>LM
If M depends on anything inside <Tag>, we just say that it depends on
<Tag> and leave it at that. So once you reach the most recent tag you
can stop processing. Very fast.
So, for example:
* L depends on B only, so it's minimal context is defined as <Tag>.
* M creates a new file, so its minimal context is the empty context.
Daniel.
_______________________________________________
darcs-users mailing list
[email protected]
http://lists.osuosl.org/mailman/listinfo/darcs-users
