diff --git a/Include/longobject.h b/Include/longobject.h index 72bcd98e185..02bf7ef2c0d 100644 --- a/Include/longobject.h +++ b/Include/longobject.h @@ -101,13 +101,13 @@ PyAPI_FUNC(int) _PyLong_Sign(PyObject *v); */ PyAPI_FUNC(size_t) _PyLong_NumBits(PyObject *v); -/* _PyLong_Divmod_Near. Given integers a and b, compute the nearest +/* _PyLong_DivmodNear. Given integers a and b, compute the nearest integer q to the exact quotient a / b, rounding to the nearest even integer in the case of a tie. Return (q, r), where r = a - q*b. The remainder r will satisfy abs(r) <= abs(b)/2, with equality possible only if q is even. */ -PyAPI_FUNC(PyObject *) _PyLong_Divmod_Near(PyObject *, PyObject *); +PyAPI_FUNC(PyObject *) _PyLong_DivmodNear(PyObject *, PyObject *); /* _PyLong_FromByteArray: View the n unsigned bytes as a binary integer in base 256, and return a Python long with the same numeric value. diff --git a/Modules/datetimemodule.c b/Modules/datetimemodule.c index 71aba6d797a..30816ed418e 100644 --- a/Modules/datetimemodule.c +++ b/Modules/datetimemodule.c @@ -161,7 +161,7 @@ divide_nearest(PyObject *m, PyObject *n) PyObject *result; PyObject *temp; - temp = _PyLong_Divmod_Near(m, n); + temp = _PyLong_DivmodNear(m, n); if (temp == NULL) return NULL; result = PyTuple_GET_ITEM(temp, 0); diff --git a/Objects/longobject.c b/Objects/longobject.c index ed41010b04a..c9c9817f123 100644 --- a/Objects/longobject.c +++ b/Objects/longobject.c @@ -4218,7 +4218,7 @@ long__format__(PyObject *self, PyObject *args) round-half-to-even. */ PyObject * -_PyLong_Divmod_Near(PyObject *a, PyObject *b) +_PyLong_DivmodNear(PyObject *a, PyObject *b) { PyLongObject *quo = NULL, *rem = NULL; PyObject *one = NULL, *twice_rem, *result, *temp; @@ -4363,7 +4363,7 @@ long_round(PyObject *self, PyObject *args) if (result == NULL) return NULL; - temp = _PyLong_Divmod_Near(self, result); + temp = _PyLong_DivmodNear(self, result); Py_DECREF(result); result = temp; if (result == NULL)