projects / git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 94537c7) | patch
New "diff-cache" implementation.
authorLinus Torvalds <torvalds@ppc970.osdl.org>
Sat, 23 Apr 2005 00:15:28 +0000 (17:15 -0700)
committerLinus Torvalds <torvalds@ppc970.osdl.org>
Sat, 23 Apr 2005 00:15:28 +0000 (17:15 -0700)
commitb5af9107270171b79d46b099ee0b198e653f3a24
tree8284e5e732d110051beb6281e423488b74ee7593tree | snapshot
parent94537c78a82619b2625cb827ec0094703579bfedcommit | diff
New "diff-cache" implementation.

This one is about a million times simpler, and much more likely to be
correct too.

Instead of trying to match up a tree object against the index, we just
read in the tree object side-by-side into the index, and just walk the
resulting index file. This was what all the read-tree cleanups were
all getting to.
cache.h diff | blob | blame | history
diff-cache.c diff | blob | blame | history
read-cache.c diff | blob | blame | history
Unnamed repository; edit this file 'description' to name the repository.