Trent W. Buck writes: > I'm struggling to grasp this, so let me just ask: > > Are these answers inherent in a darcs-style dvcs (i.e. "patch > theory"),
I doubt it's inherent.[1] But performance-wise it's probably going to kill you because of the combinatorics of context computation. Footnotes: [1] For example, you could represent a patch as Darcs understands it as a set of git-style SHA1 pairs. Each SHA1 pair represents the before and after trees, and the contexts where "the patch" may be applied correspond to all "before" SHA1s that are in some one of these pairs. Sort the (finite :-) set in numerical order of "before" SHA1s, and Gödelize. Now, sign the Gödel number. For some value of "now" involving fire turning to ice. :-) _______________________________________________ darcs-users mailing list [email protected] http://lists.osuosl.org/mailman/listinfo/darcs-users
