| Commit message (Collapse) | Author | Age | Files | Lines | |
|---|---|---|---|---|---|
| * | Swap the order of the `git_graph_reachable_from_any` params | lhchavez | 2021-07-27 | 1 | -2/+2 |
| | | | | | len, array -> array, len | ||||
| * | graph: Create `git_graph_reachable_from_any()` | lhchavez | 2021-07-27 | 1 | -2/+20 |
| | | | | | | | | | | | | | | | This change introduces a new API function `git_graph_reachable_from_any()`, that answers the question whether a commit is reachable from any of the provided commits through following parent edges. This function can take advantage of optimizations provided by the existence of a `commit-graph` file, since it makes it faster to know whether, given two commits X and Y, X cannot possibly be an reachable from Y. Part of: #5757 | ||||
| * | graph: document that a commit isn't a descendant of itself | Jacob Wahlgren | 2017-10-06 | 1 | -0/+3 |
| | | |||||
| * | Add `git_graph_descendant_of`. | Arthur Schreiber | 2014-01-28 | 1 | -0/+14 |
| | | |||||
| * | graph: make the ahead-behind docs clearer | Carlos MartÃn Nieto | 2013-03-22 | 1 | -5/+10 |
| | | | | | | Explain it in local-upstream branch terms so it's easier to grasp than with the `one` and `two` naming from the merge-base code. | ||||
| * | update copyrights | Edward Thomson | 2013-01-08 | 1 | -1/+1 |
| | | |||||
| * | Rename git_count_ahead_behind -> git_graph_ahead_behind | Scott J. Goldman | 2012-11-28 | 1 | -0/+36 |
| Moved it into graph.{c,h} which i created for the new "graph" functions namespace. Also adjusted the function prototype to use `size_t` and `const git_oid *`. | |||||
 |
index : delta/libgit2.git | |
| github.com: libgit2/libgit2.git |
| summaryrefslogtreecommitdiff |