| /external/python/cpython3/Modules/ |
| D | _heapqmodule.c | 41 cmp = PyObject_RichCompareBool(newitem, parent, Py_LT); in siftdown()
89 cmp = PyObject_RichCompareBool(a, b, Py_LT); in siftup()
276 cmp = PyObject_RichCompareBool(top, item, Py_LT); in _heapq_heappushpop_impl()
435 cmp = PyObject_RichCompareBool(parent, newitem, Py_LT); in siftdown_max()
483 cmp = PyObject_RichCompareBool(a, b, Py_LT); in siftup_max()
|
| D | _bisectmodule.c | 42 res = PyObject_RichCompareBool(item, litem, Py_LT); in internal_bisect_right()
143 res = PyObject_RichCompareBool(litem, item, Py_LT); in internal_bisect_left()
|
| D | mathmodule.c | 1832 a_too_large = PyObject_RichCompareBool(n, b, Py_LT); in math_isqrt()
3169 cmp = PyObject_RichCompareBool(n, k, Py_LT); in math_perm_impl()
3302 cmp = PyObject_RichCompareBool(temp, k, Py_LT); in math_comb_impl()
|
| D | arraymodule.c | 706 case Py_LT: cmp = result < 0; break; in array_richcompare()
746 case Py_LT: cmp = vs < ws; break; in array_richcompare()
|
| D | _operator.c | 600 return PyObject_RichCompare(a, b, Py_LT); in _operator_lt_impl()
|
| /external/python/cpython3/Objects/ |
| D | rangeobject.c | 278 cmp_result = PyObject_RichCompareBool(arg, _PyLong_Zero, Py_LT); in compute_range_item()
297 cmp_result = PyObject_RichCompareBool(i, _PyLong_Zero, Py_LT); in compute_range_item()
384 cmp3 = PyObject_RichCompareBool(ob, r->stop, Py_LT); in range_contains_long()
388 cmp3 = PyObject_RichCompareBool(r->stop, ob, Py_LT); in range_contains_long()
485 case Py_LT: in range_richcompare()
968 cmp = PyObject_RichCompareBool(state, _PyLong_Zero, Py_LT); in longrangeiter_setstate()
975 cmp = PyObject_RichCompareBool(r->len, state, Py_LT); in longrangeiter_setstate()
1010 if (PyObject_RichCompareBool(r->index, r->len, Py_LT) != 1) in longrangeiter_next()
|
| D | sliceobject.c | 435 cmp_result = PyObject_RichCompareBool(start, lower, Py_LT); in _PySlice_GetLongIndices()
474 cmp_result = PyObject_RichCompareBool(stop, lower, Py_LT); in _PySlice_GetLongIndices()
|
| D | listobject.c | 2005 return PyObject_RichCompareBool(v, w, Py_LT); in safe_object_compare()
2019 return PyObject_RichCompareBool(v, w, Py_LT); in unsafe_object_compare()
2022 res_obj = (*(ms->key_richcompare))(v, w, Py_LT); in unsafe_object_compare()
2026 return PyObject_RichCompareBool(v, w, Py_LT); in unsafe_object_compare()
2067 assert(res == PyObject_RichCompareBool(v, w, Py_LT));; in unsafe_latin_compare()
2095 assert(res == PyObject_RichCompareBool(v, w, Py_LT)); in unsafe_long_compare()
2110 assert(res == PyObject_RichCompareBool(v, w, Py_LT)); in unsafe_float_compare()
2153 return PyObject_RichCompareBool(vt->ob_item[i], wt->ob_item[i], Py_LT); in unsafe_tuple_compare()
|
| D | object.c | 650 int _Py_SwappedOp[] = {Py_GT, Py_GE, Py_EQ, Py_NE, Py_LT, Py_LE};
713 assert(Py_LT <= op && op <= Py_GE); in PyObject_RichCompare()
|
| /external/python/cpython2/Modules/ |
| D | _bisectmodule.c | 31 res = PyObject_RichCompareBool(item, litem, Py_LT); in internal_bisect_right()
137 res = PyObject_RichCompareBool(litem, item, Py_LT); in internal_bisect_left()
|
| D | _heapqmodule.c | 28 return PyObject_RichCompareBool(x, y, Py_LT); in cmp_lt()
|
| D | operator.c | 133 spamrc(op_lt , Py_LT) in spami()
|
| /external/python/cpython2/Include/ |
| D | opcode.h | 163 enum cmp_op {PyCmp_LT=Py_LT, PyCmp_LE=Py_LE, PyCmp_EQ=Py_EQ, PyCmp_NE=Py_NE, PyCmp_GT=Py_GT, PyCmp_…
|
| D | object.h | 887 #define Py_LT 0 macro
|
| /external/python/cpython3/Include/ |
| D | object.h | 534 #define Py_LT 0 macro
551 case Py_LT: if ((val1) < (val2)) Py_RETURN_TRUE; Py_RETURN_FALSE; \
|
| /external/python/cffi/c/ |
| D | minibuffer.h | 222 case Py_LT: cmp = cmp < 0; break; in mb_richcompare()
|
| /external/python/cpython2/Objects/ |
| D | object.c | 603 int _Py_SwappedOp[] = {Py_GT, Py_GE, Py_EQ, Py_NE, Py_LT, Py_LE};
680 {Py_LT, -1}, in try_rich_to_3way_compare()
882 case Py_LT: c = c < 0; break; in convert_3way_to_object()
953 assert(Py_LT <= op && op <= Py_GE); in PyObject_RichCompare()
|
| D | tupleobject.c | 608 case Py_LT: cmp = vlen < wlen; break; in tuplerichcompare()
|
| D | listobject.c | 1030 PyObject_RichCompareBool(X, Y, Py_LT) : \
2409 case Py_LT: cmp = vs < ws; break; in list_richcompare()
|
| D | dictobject.c | 1816 cmp = PyObject_RichCompareBool(akey, thiskey, Py_LT); in characterize()
2975 case Py_LT: in dictview_richcompare()
|
| /external/python/cpython3/Doc/c-api/ |
| D | object.rst | 142 which must be one of :const:`Py_LT`, :const:`Py_LE`, :const:`Py_EQ`,
152 which must be one of :const:`Py_LT`, :const:`Py_LE`, :const:`Py_EQ`,
|
| /external/python/cpython3/Python/ |
| D | bltinmodule.c | 1590 const char *name = op == Py_LT ? "min" : "max"; in min_max()
1608 (op == Py_LT) ? "|$OO:min" : "|$OO:max", in min_max()
1699 return min_max(args, kwds, Py_LT); in builtin_min()
|
| /external/python/cpython2/Doc/c-api/ |
| D | object.rst | 104 which must be one of :const:`Py_LT`, :const:`Py_LE`, :const:`Py_EQ`,
114 which must be one of :const:`Py_LT`, :const:`Py_LE`, :const:`Py_EQ`,
|
| /external/python/cpython3/Doc/extending/ |
| D | newtypes.rst | 380 ``Py_LT`` or ``Py_GT``. It should compare the two objects with respect to the
402 case Py_LT: c = size1 < size2; break;
|
| /external/python/cpython2/Python/ |
| D | bltinmodule.c | 1361 const char *name = op == Py_LT ? "min" : "max"; in min_max()
1449 return min_max(args, kwds, Py_LT); in builtin_min()
|