Jeff King writes:
> The implementation is fairly straightforward. Whenever we do
> the linear search, we cache the interesting commit we find,
> and next time check it before doing another linear search.
> If that commit is removed from the list or becomes
> UNINTERESTING itself, then we fall bac
When we are limiting a rev-list traversal due to
UNINTERESTING refs, we have to walk down the tips (both
interesting and uninteresting) to find where they intersect.
We keep a queue of commits to examine, pop commits off
the queue one by one, and potentially add their parents. The
size of the queu
2 matches
Mail list logo
