- 22 Jun, 2018 1 commit
-
-
Currently we fail to clear the sorting flag for revwalks when resetting. This caused a poor interaction with the limited flag during a recent patch. This patch clears the revwalk sorting flag and causes it to no longer persist over resets.
Nika Layzell committed
-
- 12 Apr, 2018 1 commit
-
-
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
-
- 24 Feb, 2018 1 commit
-
-
Add a new branch to the `testrepo` repository, where the `README` file has changed to executable. This branch enables typechange tests between the new `executable` branch and `master`.
Edward Thomson committed
-
- 09 Mar, 2017 1 commit
-
-
Fixes #4099
Adam Niedzielski committed
-
- 13 Feb, 2017 1 commit
-
-
Add a new branch that causes a merge conflict to `testrepo` so that we are able to test merging in worktrees.
Patrick Steinhardt committed
-
- 02 Feb, 2017 1 commit
-
-
Adam Niedzielski committed
-
- 06 Oct, 2016 3 commits
-
-
After porting over the commit hiding and selection we were still left with mistmaching output due to the topologial sort. This ports the topological sorting code to make us match with our equivalent of `--date-order` and `--topo-order` against the output from `rev-list`.
Carlos Martín Nieto committed -
We had some home-grown logic to figure out which objects to show during the revision walk, but it was rather inefficient, looking over the same list multiple times to figure out when we had run out of interesting commits. We now use the lists in a smarter way. We also introduce the slop mechanism to determine when to stpo looking. When we run out of interesting objects, we continue preparing the walk for another 5 rounds in order to make it less likely that we miss objects in situations with complex graphs.
Carlos Martín Nieto committed -
Introduce some tests that show some commits, while hiding some commits that have a timestamp older than the common ancestors of these two commits.
Edward Thomson committed
-
- 02 Nov, 2015 2 commits
-
-
Vicent Marti committed
-
Vicent Marti committed
-
- 21 Oct, 2015 2 commits
-
-
Vicent Marti committed
-
Vicent Marti committed
-
- 14 Oct, 2015 1 commit
-
-
We moved the "main" parsing to use 64 bits for the timestamp, but the quick parsing for the revwalk did not. This means that for large timestamps we fail to parse the time and thus the walk. Move this parser to use 64 bits as well.
Carlos Martín Nieto committed
-
- 08 Apr, 2015 1 commit
-
-
When we hide a commit which we later push into the revwalk, we do not handle this well and return commits which we should not.
Carlos Martín Nieto committed
-
- 03 Feb, 2015 1 commit
-
-
Edward Thomson committed
-
- 27 Oct, 2014 1 commit
-
-
Edward Thomson committed
-
- 09 Oct, 2014 1 commit
-
-
Arthur Schreiber committed
-
- 16 Sep, 2014 1 commit
-
-
Ciro Santilli committed
-
- 28 Aug, 2014 1 commit
-
-
The logic was reversed. I have checked manually each pair with git and adjusted the expectation to what git status prints.
Carlos Martín Nieto committed
-
- 27 Jul, 2014 1 commit
-
-
We always calculate multiple merge bases, but up to now we had only exposed the "best" merge base. Introduce git_oidarray which analogously to git_strarray lets us return multiple ids.
Carlos Martín Nieto committed
-
- 01 Jul, 2014 2 commits
-
-
The revwalk::simplify test was not actually tested the values from the revwalk against the expected. (Further, the expected had two IDs transposed.)
Edward Thomson committed -
Edward Thomson committed
-
- 31 Mar, 2014 1 commit
-
-
Anurag Gupta committed
-
- 26 Mar, 2014 1 commit
-
-
Edward Thomson committed
-
- 24 Mar, 2014 3 commits
-
-
Anurag Gupta committed
-
Anurag Gupta committed
-
Anurag Gupta committed
-
- 18 Mar, 2014 1 commit
-
-
Aimeast committed
-
- 12 Mar, 2014 1 commit
-
-
If the pqueue comparison fn returned just 0 or 1 (think "a<b") then the sort order of returned items could be wrong because there was a "< 0" that really needed to be "<= 0". Yikes!!!
Russell Belfer committed
-
- 05 Feb, 2014 3 commits
-
-
This used to be broken, let's make sure we don't break this use-case.
Carlos Martín Nieto committed -
Pushing a whole namespace can cause us to attempt to push non-committish objects. Catch this situation and special-case it for ignoring this.
Carlos Martín Nieto committed -
This shows that pusing a whole namespace can be problematic.
Carlos Martín Nieto committed
-
- 14 Nov, 2013 1 commit
-
-
Ben Straub committed
-