Commit 82d4c0e6 by Carlos Martín Nieto

revwalk: update the description for the default sorting

It changed from implementation-defined to git's default sorting, as there are
systems (e.g. rebase) which depend on this order. Also specify more explicitly
how you can get git's "date-order".
parent ea1ceb7f
...@@ -25,17 +25,15 @@ GIT_BEGIN_DECL ...@@ -25,17 +25,15 @@ GIT_BEGIN_DECL
*/ */
typedef enum { typedef enum {
/** /**
* Sort the repository contents in no particular ordering; * Sort the output with the same default time-order method from git.
* this sorting is arbitrary, implementation-specific
* and subject to change at any time.
* This is the default sorting for new walkers. * This is the default sorting for new walkers.
*/ */
GIT_SORT_NONE = 0, GIT_SORT_NONE = 0,
/** /**
* Sort the repository contents in topological order * Sort the repository contents in topological order (parents before
* (parents before children); this sorting mode * children); this sorting mode can be combined with time sorting to
* can be combined with time sorting. * produce git's "time-order".
*/ */
GIT_SORT_TOPOLOGICAL = 1 << 0, GIT_SORT_TOPOLOGICAL = 1 << 0,
......
...@@ -555,10 +555,6 @@ static int prepare_walk(git_revwalk *walk) ...@@ -555,10 +555,6 @@ static int prepare_walk(git_revwalk *walk)
} }
} }
for (list = commits; list; list = list->next) {
printf("%s: commit %s\n", __func__, git_oid_tostr_s(&list->item->oid));
}
if ((error = limit_list(&commits, walk, commits)) < 0) if ((error = limit_list(&commits, walk, commits)) < 0)
return error; return error;
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment