ancestor.deepest: sort revs in C version

This isn't strictly necessary, but it makes the code more consistent with the
Python version.
This commit is contained in:
Siddharth Agarwal 2013-07-25 14:20:37 -07:00
parent ac76c4f1a9
commit 2267993ebc

View File

@ -1311,6 +1311,9 @@ static PyObject *find_deepest(indexObject *self, PyObject *revs)
goto bail; goto bail;
} }
if (PyList_Sort(revs) == -1)
goto bail;
for (i = 0; i < revcount; i++) { for (i = 0; i < revcount; i++) {
int n = (int)PyInt_AsLong(PyList_GET_ITEM(revs, i)); int n = (int)PyInt_AsLong(PyList_GET_ITEM(revs, i));
long b = 1l << i; long b = 1l << i;