<feed xmlns='http://www.w3.org/2005/Atom'>
<title>delta/libgit2.git/tests/graph/reachable_from_any.c, branch ethomson/diff_enum</title>
<subtitle>github.com: libgit2/libgit2.git
</subtitle>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/libgit2.git/'/>
<entry>
<title>Swap the order of the `git_graph_reachable_from_any` params</title>
<updated>2021-07-27T20:00:31+00:00</updated>
<author>
<name>lhchavez</name>
<email>lhchavez@lhchavez.com</email>
</author>
<published>2021-07-27T20:00:31+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/libgit2.git/commit/?id=8d453f16385c04abfba0211f1e7fb1621f26d609'/>
<id>8d453f16385c04abfba0211f1e7fb1621f26d609</id>
<content type='text'>
len, array -&gt; array, len
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
len, array -&gt; array, len
</pre>
</div>
</content>
</entry>
<entry>
<title>graph: Create `git_graph_reachable_from_any()`</title>
<updated>2021-07-27T15:14:08+00:00</updated>
<author>
<name>lhchavez</name>
<email>lhchavez@lhchavez.com</email>
</author>
<published>2021-01-06T14:26:09+00:00</published>
<link rel='alternate' type='text/html' href='http://git.baserock.org/cgit/delta/libgit2.git/commit/?id=ce5400cdc7cc52ace295a9fbd3cd7a6e7c63be34'/>
<id>ce5400cdc7cc52ace295a9fbd3cd7a6e7c63be34</id>
<content type='text'>
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
</content>
<content type='xhtml'>
<div xmlns='http://www.w3.org/1999/xhtml'>
<pre>
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
</pre>
</div>
</content>
</entry>
</feed>
