From patchwork Thu Jul 25 22:50:02 2013
Content-Type: text/plain; charset="utf-8"
MIME-Version: 1.0
Content-Transfer-Encoding: 7bit
Subject: [1,of,3,stable,V2] ancestor.deepest: sort revs in C version
From: Siddharth Agarwal <sid0@fb.com>
X-Patchwork-Id: 1966
Message-Id: <acd8063547ca3cb47f65.1374792602@dev1091.prn1.facebook.com>
To: mercurial-devel@selenic.com
Date: Thu, 25 Jul 2013 15:50:02 -0700

# HG changeset patch
# User Siddharth Agarwal <sid0@fb.com>
# Date 1374787237 25200
#      Thu Jul 25 14:20:37 2013 -0700
# Branch stable
# Node ID acd8063547ca3cb47f65140be7930b60fefd9cdc
# Parent  7a5cdf0c90ed57f914d864fdb7d0cbfcaa2637fa
ancestor.deepest: sort revs in C version

This isn't strictly necessary, but it makes the code more consistent with the
Python version.

diff --git a/mercurial/parsers.c b/mercurial/parsers.c
--- a/mercurial/parsers.c
+++ b/mercurial/parsers.c
@@ -1311,6 +1311,9 @@
 		goto bail;
 	}
 
+	if (PyList_Sort(revs) == -1)
+		goto bail;
+
 	for (i = 0; i < revcount; i++) {
 		int n = (int)PyInt_AsLong(PyList_GET_ITEM(revs, i));
 		long b = 1l << i;