mirror of
https://github.com/python/cpython.git
synced 2025-08-03 16:39:00 +00:00
Remove checking redundantly for checks of PyInt and PyLong.
This commit is contained in:
parent
538d17aa23
commit
1fe5f38852
7 changed files with 14 additions and 15 deletions
|
@ -1153,14 +1153,13 @@ PyNumber_Index(PyObject *item)
|
|||
PyObject *result = NULL;
|
||||
if (item == NULL)
|
||||
return null_error();
|
||||
if (PyInt_Check(item) || PyLong_Check(item)) {
|
||||
if (PyLong_Check(item)) {
|
||||
Py_INCREF(item);
|
||||
return item;
|
||||
}
|
||||
if (PyIndex_Check(item)) {
|
||||
result = item->ob_type->tp_as_number->nb_index(item);
|
||||
if (result &&
|
||||
!PyInt_Check(result) && !PyLong_Check(result)) {
|
||||
if (result && !PyLong_Check(result)) {
|
||||
PyErr_Format(PyExc_TypeError,
|
||||
"__index__ returned non-int "
|
||||
"(type %.200s)",
|
||||
|
@ -1270,7 +1269,7 @@ PyNumber_Long(PyObject *o)
|
|||
}
|
||||
if (m && m->nb_long) { /* This should include subclasses of long */
|
||||
PyObject *res = m->nb_long(o);
|
||||
if (res && (!PyInt_Check(res) && !PyLong_Check(res))) {
|
||||
if (res && !PyLong_Check(res)) {
|
||||
PyErr_Format(PyExc_TypeError,
|
||||
"__long__ returned non-long (type %.200s)",
|
||||
res->ob_type->tp_name);
|
||||
|
|
|
@ -331,7 +331,7 @@ float_richcompare(PyObject *v, PyObject *w, int op)
|
|||
j = PyFloat_AS_DOUBLE(w);
|
||||
|
||||
else if (!Py_IS_FINITE(i)) {
|
||||
if (PyInt_Check(w) || PyLong_Check(w))
|
||||
if (PyLong_Check(w))
|
||||
/* If i is an infinity, its magnitude exceeds any
|
||||
* finite integer, so it doesn't matter which int we
|
||||
* compare i with. If i is a NaN, similarly.
|
||||
|
|
|
@ -106,7 +106,7 @@ PySlice_GetIndices(PySliceObject *r, Py_ssize_t length,
|
|||
if (r->step == Py_None) {
|
||||
*step = 1;
|
||||
} else {
|
||||
if (!PyInt_Check(r->step) && !PyLong_Check(r->step)) return -1;
|
||||
if (!PyLong_Check(r->step)) return -1;
|
||||
*step = PyInt_AsSsize_t(r->step);
|
||||
}
|
||||
if (r->start == Py_None) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue