summaryrefslogtreecommitdiff
path: root/include
diff options
context:
space:
mode:
authorEdward Thomson <ethomson@github.com>2016-10-07 16:01:28 +0100
committerGitHub <noreply@github.com>2016-10-07 16:01:28 +0100
commit45dc219f656ff05c06246eec2b36e6805cdf8012 (patch)
tree0866d7a31fd9f8208948545bb3cdd76b2cdb4d92 /include
parentd11fcf867ba1397928fa18cf45695ff8db32ae44 (diff)
parentfedc05c89ceb545f29c57bf35ffd066bd9e49386 (diff)
downloadlibgit2-45dc219f656ff05c06246eec2b36e6805cdf8012.tar.gz
Merge pull request #3921 from libgit2/cmn/walk-limit-enough
Improve revision walk preparation logic
Diffstat (limited to 'include')
-rw-r--r--include/git2/revwalk.h10
1 files changed, 4 insertions, 6 deletions
diff --git a/include/git2/revwalk.h b/include/git2/revwalk.h
index 2cc00536e..d9376ceea 100644
--- a/include/git2/revwalk.h
+++ b/include/git2/revwalk.h
@@ -25,17 +25,15 @@ GIT_BEGIN_DECL
*/
typedef enum {
/**
- * Sort the repository contents in no particular ordering;
- * this sorting is arbitrary, implementation-specific
- * and subject to change at any time.
+ * Sort the output with the same default time-order method from git.
* This is the default sorting for new walkers.
*/
GIT_SORT_NONE = 0,
/**
- * Sort the repository contents in topological order
- * (parents before children); this sorting mode
- * can be combined with time sorting.
+ * Sort the repository contents in topological order (parents before
+ * children); this sorting mode can be combined with time sorting to
+ * produce git's "time-order".
*/
GIT_SORT_TOPOLOGICAL = 1 << 0,