1. 07 May, 2018 1 commit
  2. 05 May, 2018 1 commit
  3. 04 May, 2018 1 commit
  4. 02 May, 2018 1 commit
  5. 30 Apr, 2018 3 commits
  6. 26 Apr, 2018 1 commit
  7. 25 Apr, 2018 2 commits
  8. 22 Apr, 2018 3 commits
  9. 20 Apr, 2018 10 commits
  10. 19 Apr, 2018 1 commit
  11. 17 Apr, 2018 10 commits
  12. 16 Apr, 2018 5 commits
  13. 12 Apr, 2018 1 commit
    • revwalk: fix uninteresting revs sometimes not limiting graphwalk · 54fd80e3
      When we want to limit our graphwalk, we use the heuristic of checking
      whether the newest limiting (uninteresting) revision is newer than the
      oldest interesting revision. We do so by inspecting whether the first
      item's commit time of the user-supplied list of revisions is newer than
      the last added interesting revision. This is wrong though, as the user
      supplied list is in no way guaranteed to be sorted by increasing commit
      dates. This could lead us to abort the revwalk early before applying all
      relevant limiting revisions, outputting revisions which should in fact
      have been hidden.
      
      Fix the heuristic by instead checking whether _any_ of the limiting
      commits was made earlier than the last interesting commit. Add a test.
      Patrick Steinhardt committed