Re: [PATCH] Restore expected list order for --merge-order switch
- From
Jon Seymour <jon.seymour@gmail.com>
- Date
- Jul 5, 2005, 23:21 UTC
- Message-ID
- <2cfc403205070516216b911160@mail.gmail.com>
- In-Reply-To
- <20050705010619.13581.qmail@blackcubes.dyndns.org>
G'day Linus,
Is there some reason why this didn't get applied?
jon.
On 7/5/05, Jon Seymour <jon.seymour@gmail.com> wrote:
Show 15 quoted lines
> > A recent change to rev-list altered the order in which start points > are presented to the merge-order sort algorithm. This caused > breaks in the t/t6001 unit tests. > > This change restores the order in which start points are presented to the > the merge-order sort algorithm (but leaves the order unchanged from > the immediately preceding behaviour for non --merge-order sorts). > > The order in which arguments are presented to the merge-order > sort algorithm is significant, since left-most arguments > are expected to sort last so as to be consistent with > how left-most parents sort. > > Signed-off-by: Jon Seymour <jon.seymour@gmail.com>