1. 06 May, 2005 1 commit
  2. 05 May, 2005 1 commit
  3. 27 Apr, 2005 1 commit
  4. 26 Apr, 2005 1 commit
  5. 23 Apr, 2005 1 commit
    • Linus Torvalds's avatar
      New "diff-cache" implementation. · b5af9107
      Linus Torvalds authored
      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.
      b5af9107
  6. 21 Apr, 2005 2 commits
  7. 20 Apr, 2005 2 commits
  8. 18 Apr, 2005 2 commits
  9. 17 Apr, 2005 3 commits
  10. 16 Apr, 2005 2 commits
  11. 15 Apr, 2005 1 commit
  12. 14 Apr, 2005 1 commit
  13. 13 Apr, 2005 4 commits
  14. 11 Apr, 2005 3 commits
  15. 10 Apr, 2005 3 commits
  16. 09 Apr, 2005 5 commits
  17. 08 Apr, 2005 3 commits
  18. 07 Apr, 2005 2 commits