Hi Jonathan,
On Fri, 27 Jul 2018, Johannes Schindelin wrote:
> On Thu, 26 Jul 2018, Jonathan Tan wrote:
>
> > > On Mon, 16 Jul 2018, Jonathan Tan wrote:
> > >
> > > > t/t5552-skipping-fetch-negotiator.sh | 179 +++
> > >
> > > This test seems to be failing consistently in the
> > +fetch.negotiationAlgorithm::
> > + Control how information about the commits in the local repository is
> > + sent when negotiating the contents of the packfile to be sent by the
> > + server. Set to "skipping" to use an algorithm that skips commits in an
> > + effort to converge
On Mon, Jul 16 2018, Jonathan Tan wrote:
Didn't catch this until this was in next, sorry.
Re-arranged the diff a bit:
> -void fetch_negotiator_init(struct fetch_negotiator *negotiator)
> +void fetch_negotiator_init(struct fetch_negotiator *negotiator,
> +const char
Hi Jonathan,
On Thu, 26 Jul 2018, Jonathan Tan wrote:
> > On Mon, 16 Jul 2018, Jonathan Tan wrote:
> >
> > > t/t5552-skipping-fetch-negotiator.sh | 179 +++
> >
> > This test seems to be failing consistently in the recent `pu` builds:
> >
> >
> Hi Jonathan,
>
> On Mon, 16 Jul 2018, Jonathan Tan wrote:
>
> > t/t5552-skipping-fetch-negotiator.sh | 179 +++
>
> This test seems to be failing consistently in the recent `pu` builds:
>
> https://git-for-windows.visualstudio.com/git/_build/results?buildId=14337=logs
>
>
Hi Jonathan,
On Thu, 26 Jul 2018, Johannes Schindelin wrote:
> On Mon, 16 Jul 2018, Jonathan Tan wrote:
>
> > t/t5552-skipping-fetch-negotiator.sh | 179 +++
>
> This test seems to be failing consistently in the recent `pu` builds:
>
>
Hi Jonathan,
On Mon, 16 Jul 2018, Jonathan Tan wrote:
> t/t5552-skipping-fetch-negotiator.sh | 179 +++
This test seems to be failing consistently in the recent `pu` builds:
https://git-for-windows.visualstudio.com/git/_build/results?buildId=14337=logs
Could you have a look,
Jonathan Tan writes:
> Introduce a new negotiation algorithm used during fetch that skips
> commits in an effort to find common ancestors faster. The skips grow
> similarly to the Fibonacci sequence as the commit walk proceeds further
> away from the tips. The skips may cause unnecessary commits
Introduce a new negotiation algorithm used during fetch that skips
commits in an effort to find common ancestors faster. The skips grow
similarly to the Fibonacci sequence as the commit walk proceeds further
away from the tips. The skips may cause unnecessary commits to be
included in the
9 matches
Mail list logo