| /*[clinic input] |
| preserve |
| [clinic start generated code]*/ |
| |
| PyDoc_STRVAR(_bisect_bisect_right__doc__, |
| "bisect_right($module, /, a, x, lo=0, hi=None, *, key=None)\n" |
| "--\n" |
| "\n" |
| "Return the index where to insert item x in list a, assuming a is sorted.\n" |
| "\n" |
| "The return value i is such that all e in a[:i] have e <= x, and all e in\n" |
| "a[i:] have e > x. So if x already appears in the list, i points just\n" |
| "beyond the rightmost x already there\n" |
| "\n" |
| "Optional args lo (default 0) and hi (default len(a)) bound the\n" |
| "slice of a to be searched."); |
| |
| #define _BISECT_BISECT_RIGHT_METHODDEF \ |
| {"bisect_right", (PyCFunction)(void(*)(void))_bisect_bisect_right, METH_FASTCALL|METH_KEYWORDS, _bisect_bisect_right__doc__}, |
| |
| static Py_ssize_t |
| _bisect_bisect_right_impl(PyObject *module, PyObject *a, PyObject *x, |
| Py_ssize_t lo, Py_ssize_t hi, PyObject *key); |
| |
| static PyObject * |
| _bisect_bisect_right(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames) |
| { |
| PyObject *return_value = NULL; |
| static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL}; |
| static _PyArg_Parser _parser = {NULL, _keywords, "bisect_right", 0}; |
| PyObject *argsbuf[5]; |
| Py_ssize_t noptargs = nargs + (kwnames ? PyTuple_GET_SIZE(kwnames) : 0) - 2; |
| PyObject *a; |
| PyObject *x; |
| Py_ssize_t lo = 0; |
| Py_ssize_t hi = -1; |
| PyObject *key = Py_None; |
| Py_ssize_t _return_value; |
| |
| args = _PyArg_UnpackKeywords(args, nargs, NULL, kwnames, &_parser, 2, 4, 0, argsbuf); |
| if (!args) { |
| goto exit; |
| } |
| a = args[0]; |
| x = args[1]; |
| if (!noptargs) { |
| goto skip_optional_pos; |
| } |
| if (args[2]) { |
| { |
| Py_ssize_t ival = -1; |
| PyObject *iobj = _PyNumber_Index(args[2]); |
| if (iobj != NULL) { |
| ival = PyLong_AsSsize_t(iobj); |
| Py_DECREF(iobj); |
| } |
| if (ival == -1 && PyErr_Occurred()) { |
| goto exit; |
| } |
| lo = ival; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| if (args[3]) { |
| if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) { |
| goto exit; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| skip_optional_pos: |
| if (!noptargs) { |
| goto skip_optional_kwonly; |
| } |
| key = args[4]; |
| skip_optional_kwonly: |
| _return_value = _bisect_bisect_right_impl(module, a, x, lo, hi, key); |
| if ((_return_value == -1) && PyErr_Occurred()) { |
| goto exit; |
| } |
| return_value = PyLong_FromSsize_t(_return_value); |
| |
| exit: |
| return return_value; |
| } |
| |
| PyDoc_STRVAR(_bisect_insort_right__doc__, |
| "insort_right($module, /, a, x, lo=0, hi=None, *, key=None)\n" |
| "--\n" |
| "\n" |
| "Insert item x in list a, and keep it sorted assuming a is sorted.\n" |
| "\n" |
| "If x is already in a, insert it to the right of the rightmost x.\n" |
| "\n" |
| "Optional args lo (default 0) and hi (default len(a)) bound the\n" |
| "slice of a to be searched."); |
| |
| #define _BISECT_INSORT_RIGHT_METHODDEF \ |
| {"insort_right", (PyCFunction)(void(*)(void))_bisect_insort_right, METH_FASTCALL|METH_KEYWORDS, _bisect_insort_right__doc__}, |
| |
| static PyObject * |
| _bisect_insort_right_impl(PyObject *module, PyObject *a, PyObject *x, |
| Py_ssize_t lo, Py_ssize_t hi, PyObject *key); |
| |
| static PyObject * |
| _bisect_insort_right(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames) |
| { |
| PyObject *return_value = NULL; |
| static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL}; |
| static _PyArg_Parser _parser = {NULL, _keywords, "insort_right", 0}; |
| PyObject *argsbuf[5]; |
| Py_ssize_t noptargs = nargs + (kwnames ? PyTuple_GET_SIZE(kwnames) : 0) - 2; |
| PyObject *a; |
| PyObject *x; |
| Py_ssize_t lo = 0; |
| Py_ssize_t hi = -1; |
| PyObject *key = Py_None; |
| |
| args = _PyArg_UnpackKeywords(args, nargs, NULL, kwnames, &_parser, 2, 4, 0, argsbuf); |
| if (!args) { |
| goto exit; |
| } |
| a = args[0]; |
| x = args[1]; |
| if (!noptargs) { |
| goto skip_optional_pos; |
| } |
| if (args[2]) { |
| { |
| Py_ssize_t ival = -1; |
| PyObject *iobj = _PyNumber_Index(args[2]); |
| if (iobj != NULL) { |
| ival = PyLong_AsSsize_t(iobj); |
| Py_DECREF(iobj); |
| } |
| if (ival == -1 && PyErr_Occurred()) { |
| goto exit; |
| } |
| lo = ival; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| if (args[3]) { |
| if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) { |
| goto exit; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| skip_optional_pos: |
| if (!noptargs) { |
| goto skip_optional_kwonly; |
| } |
| key = args[4]; |
| skip_optional_kwonly: |
| return_value = _bisect_insort_right_impl(module, a, x, lo, hi, key); |
| |
| exit: |
| return return_value; |
| } |
| |
| PyDoc_STRVAR(_bisect_bisect_left__doc__, |
| "bisect_left($module, /, a, x, lo=0, hi=None, *, key=None)\n" |
| "--\n" |
| "\n" |
| "Return the index where to insert item x in list a, assuming a is sorted.\n" |
| "\n" |
| "The return value i is such that all e in a[:i] have e < x, and all e in\n" |
| "a[i:] have e >= x. So if x already appears in the list, i points just\n" |
| "before the leftmost x already there.\n" |
| "\n" |
| "Optional args lo (default 0) and hi (default len(a)) bound the\n" |
| "slice of a to be searched."); |
| |
| #define _BISECT_BISECT_LEFT_METHODDEF \ |
| {"bisect_left", (PyCFunction)(void(*)(void))_bisect_bisect_left, METH_FASTCALL|METH_KEYWORDS, _bisect_bisect_left__doc__}, |
| |
| static Py_ssize_t |
| _bisect_bisect_left_impl(PyObject *module, PyObject *a, PyObject *x, |
| Py_ssize_t lo, Py_ssize_t hi, PyObject *key); |
| |
| static PyObject * |
| _bisect_bisect_left(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames) |
| { |
| PyObject *return_value = NULL; |
| static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL}; |
| static _PyArg_Parser _parser = {NULL, _keywords, "bisect_left", 0}; |
| PyObject *argsbuf[5]; |
| Py_ssize_t noptargs = nargs + (kwnames ? PyTuple_GET_SIZE(kwnames) : 0) - 2; |
| PyObject *a; |
| PyObject *x; |
| Py_ssize_t lo = 0; |
| Py_ssize_t hi = -1; |
| PyObject *key = Py_None; |
| Py_ssize_t _return_value; |
| |
| args = _PyArg_UnpackKeywords(args, nargs, NULL, kwnames, &_parser, 2, 4, 0, argsbuf); |
| if (!args) { |
| goto exit; |
| } |
| a = args[0]; |
| x = args[1]; |
| if (!noptargs) { |
| goto skip_optional_pos; |
| } |
| if (args[2]) { |
| { |
| Py_ssize_t ival = -1; |
| PyObject *iobj = _PyNumber_Index(args[2]); |
| if (iobj != NULL) { |
| ival = PyLong_AsSsize_t(iobj); |
| Py_DECREF(iobj); |
| } |
| if (ival == -1 && PyErr_Occurred()) { |
| goto exit; |
| } |
| lo = ival; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| if (args[3]) { |
| if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) { |
| goto exit; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| skip_optional_pos: |
| if (!noptargs) { |
| goto skip_optional_kwonly; |
| } |
| key = args[4]; |
| skip_optional_kwonly: |
| _return_value = _bisect_bisect_left_impl(module, a, x, lo, hi, key); |
| if ((_return_value == -1) && PyErr_Occurred()) { |
| goto exit; |
| } |
| return_value = PyLong_FromSsize_t(_return_value); |
| |
| exit: |
| return return_value; |
| } |
| |
| PyDoc_STRVAR(_bisect_insort_left__doc__, |
| "insort_left($module, /, a, x, lo=0, hi=None, *, key=None)\n" |
| "--\n" |
| "\n" |
| "Insert item x in list a, and keep it sorted assuming a is sorted.\n" |
| "\n" |
| "If x is already in a, insert it to the left of the leftmost x.\n" |
| "\n" |
| "Optional args lo (default 0) and hi (default len(a)) bound the\n" |
| "slice of a to be searched."); |
| |
| #define _BISECT_INSORT_LEFT_METHODDEF \ |
| {"insort_left", (PyCFunction)(void(*)(void))_bisect_insort_left, METH_FASTCALL|METH_KEYWORDS, _bisect_insort_left__doc__}, |
| |
| static PyObject * |
| _bisect_insort_left_impl(PyObject *module, PyObject *a, PyObject *x, |
| Py_ssize_t lo, Py_ssize_t hi, PyObject *key); |
| |
| static PyObject * |
| _bisect_insort_left(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames) |
| { |
| PyObject *return_value = NULL; |
| static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL}; |
| static _PyArg_Parser _parser = {NULL, _keywords, "insort_left", 0}; |
| PyObject *argsbuf[5]; |
| Py_ssize_t noptargs = nargs + (kwnames ? PyTuple_GET_SIZE(kwnames) : 0) - 2; |
| PyObject *a; |
| PyObject *x; |
| Py_ssize_t lo = 0; |
| Py_ssize_t hi = -1; |
| PyObject *key = Py_None; |
| |
| args = _PyArg_UnpackKeywords(args, nargs, NULL, kwnames, &_parser, 2, 4, 0, argsbuf); |
| if (!args) { |
| goto exit; |
| } |
| a = args[0]; |
| x = args[1]; |
| if (!noptargs) { |
| goto skip_optional_pos; |
| } |
| if (args[2]) { |
| { |
| Py_ssize_t ival = -1; |
| PyObject *iobj = _PyNumber_Index(args[2]); |
| if (iobj != NULL) { |
| ival = PyLong_AsSsize_t(iobj); |
| Py_DECREF(iobj); |
| } |
| if (ival == -1 && PyErr_Occurred()) { |
| goto exit; |
| } |
| lo = ival; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| if (args[3]) { |
| if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) { |
| goto exit; |
| } |
| if (!--noptargs) { |
| goto skip_optional_pos; |
| } |
| } |
| skip_optional_pos: |
| if (!noptargs) { |
| goto skip_optional_kwonly; |
| } |
| key = args[4]; |
| skip_optional_kwonly: |
| return_value = _bisect_insort_left_impl(module, a, x, lo, hi, key); |
| |
| exit: |
| return return_value; |
| } |
| /*[clinic end generated code: output=b3a5be025aa4ed7e input=a9049054013a1b77]*/ |