On Mon, Feb 16, 2015 at 1:45 PM, Jeff King <peff@xxxxxxxx> wrote: > Somewhat related to this, I was playing this weekend with the idea of > generating fast tree diffs from our on-disk deltas. That is, given a > base tree and a binary delta against it, could I reliably reproduce a > diff (one way or the other) in O(size of diff), rather than O(size of > tree)? If you add a "delta" base cache for v4 trees to avoid the recursion issue Nico mentioned, you effectively have a "diff" that aligns at tree entry boundaries. The v4 tree encoding will become just another delta format from this perspective. I'm very tempted to just go with this to take advantage of v4 SHA-1 encoding, ident and path encoding.. -- Duy -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@xxxxxxxxxxxxxxx More majordomo info at http://vger.kernel.org/majordomo-info.html