2020-05-18 00:38:35 -03:00
|
|
|
/*[clinic input]
|
|
|
|
preserve
|
|
|
|
[clinic start generated code]*/
|
|
|
|
|
|
|
|
PyDoc_STRVAR(_bisect_bisect_right__doc__,
|
2020-10-20 02:04:01 -03:00
|
|
|
"bisect_right($module, /, a, x, lo=0, hi=None, *, key=None)\n"
|
2020-05-18 00:38:35 -03:00
|
|
|
"--\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"
|
2021-06-06 15:22:48 -03:00
|
|
|
"a[i:] have e > x. So if x already appears in the list, a.insert(i, x) will\n"
|
|
|
|
"insert just after the rightmost x already there.\n"
|
2020-05-18 00:38:35 -03:00
|
|
|
"\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 \
|
2022-05-03 15:25:41 -03:00
|
|
|
{"bisect_right", _PyCFunction_CAST(_bisect_bisect_right), METH_FASTCALL|METH_KEYWORDS, _bisect_bisect_right__doc__},
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static Py_ssize_t
|
|
|
|
_bisect_bisect_right_impl(PyObject *module, PyObject *a, PyObject *x,
|
2020-10-20 02:04:01 -03:00
|
|
|
Py_ssize_t lo, Py_ssize_t hi, PyObject *key);
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static PyObject *
|
|
|
|
_bisect_bisect_right(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames)
|
|
|
|
{
|
|
|
|
PyObject *return_value = NULL;
|
2020-10-20 02:04:01 -03:00
|
|
|
static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL};
|
2020-05-18 00:38:35 -03:00
|
|
|
static _PyArg_Parser _parser = {NULL, _keywords, "bisect_right", 0};
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *argsbuf[5];
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *key = Py_None;
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
2020-05-28 04:33:45 -03:00
|
|
|
PyObject *iobj = _PyNumber_Index(args[2]);
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
2020-10-20 02:04:01 -03:00
|
|
|
if (args[3]) {
|
|
|
|
if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) {
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
if (!--noptargs) {
|
|
|
|
goto skip_optional_pos;
|
|
|
|
}
|
2020-05-18 00:38:35 -03:00
|
|
|
}
|
|
|
|
skip_optional_pos:
|
2020-10-20 02:04:01 -03:00
|
|
|
if (!noptargs) {
|
|
|
|
goto skip_optional_kwonly;
|
|
|
|
}
|
|
|
|
key = args[4];
|
|
|
|
skip_optional_kwonly:
|
|
|
|
_return_value = _bisect_bisect_right_impl(module, a, x, lo, hi, key);
|
2020-05-18 00:38:35 -03:00
|
|
|
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__,
|
2020-10-20 02:04:01 -03:00
|
|
|
"insort_right($module, /, a, x, lo=0, hi=None, *, key=None)\n"
|
2020-05-18 00:38:35 -03:00
|
|
|
"--\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 \
|
2022-05-03 15:25:41 -03:00
|
|
|
{"insort_right", _PyCFunction_CAST(_bisect_insort_right), METH_FASTCALL|METH_KEYWORDS, _bisect_insort_right__doc__},
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static PyObject *
|
|
|
|
_bisect_insort_right_impl(PyObject *module, PyObject *a, PyObject *x,
|
2020-10-20 02:04:01 -03:00
|
|
|
Py_ssize_t lo, Py_ssize_t hi, PyObject *key);
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static PyObject *
|
|
|
|
_bisect_insort_right(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames)
|
|
|
|
{
|
|
|
|
PyObject *return_value = NULL;
|
2020-10-20 02:04:01 -03:00
|
|
|
static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL};
|
2020-05-18 00:38:35 -03:00
|
|
|
static _PyArg_Parser _parser = {NULL, _keywords, "insort_right", 0};
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *argsbuf[5];
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *key = Py_None;
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
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;
|
2020-05-28 04:33:45 -03:00
|
|
|
PyObject *iobj = _PyNumber_Index(args[2]);
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
2020-10-20 02:04:01 -03:00
|
|
|
if (args[3]) {
|
|
|
|
if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) {
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
if (!--noptargs) {
|
|
|
|
goto skip_optional_pos;
|
|
|
|
}
|
2020-05-18 00:38:35 -03:00
|
|
|
}
|
|
|
|
skip_optional_pos:
|
2020-10-20 02:04:01 -03:00
|
|
|
if (!noptargs) {
|
|
|
|
goto skip_optional_kwonly;
|
|
|
|
}
|
|
|
|
key = args[4];
|
|
|
|
skip_optional_kwonly:
|
|
|
|
return_value = _bisect_insort_right_impl(module, a, x, lo, hi, key);
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
exit:
|
|
|
|
return return_value;
|
|
|
|
}
|
|
|
|
|
|
|
|
PyDoc_STRVAR(_bisect_bisect_left__doc__,
|
2020-10-20 02:04:01 -03:00
|
|
|
"bisect_left($module, /, a, x, lo=0, hi=None, *, key=None)\n"
|
2020-05-18 00:38:35 -03:00
|
|
|
"--\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"
|
2021-06-06 15:22:48 -03:00
|
|
|
"a[i:] have e >= x. So if x already appears in the list, a.insert(i, x) will\n"
|
|
|
|
"insert just before the leftmost x already there.\n"
|
2020-05-18 00:38:35 -03:00
|
|
|
"\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 \
|
2022-05-03 15:25:41 -03:00
|
|
|
{"bisect_left", _PyCFunction_CAST(_bisect_bisect_left), METH_FASTCALL|METH_KEYWORDS, _bisect_bisect_left__doc__},
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static Py_ssize_t
|
|
|
|
_bisect_bisect_left_impl(PyObject *module, PyObject *a, PyObject *x,
|
2020-10-20 02:04:01 -03:00
|
|
|
Py_ssize_t lo, Py_ssize_t hi, PyObject *key);
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static PyObject *
|
|
|
|
_bisect_bisect_left(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames)
|
|
|
|
{
|
|
|
|
PyObject *return_value = NULL;
|
2020-10-20 02:04:01 -03:00
|
|
|
static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL};
|
2020-05-18 00:38:35 -03:00
|
|
|
static _PyArg_Parser _parser = {NULL, _keywords, "bisect_left", 0};
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *argsbuf[5];
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *key = Py_None;
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
2020-05-28 04:33:45 -03:00
|
|
|
PyObject *iobj = _PyNumber_Index(args[2]);
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
2020-10-20 02:04:01 -03:00
|
|
|
if (args[3]) {
|
|
|
|
if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) {
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
if (!--noptargs) {
|
|
|
|
goto skip_optional_pos;
|
|
|
|
}
|
2020-05-18 00:38:35 -03:00
|
|
|
}
|
|
|
|
skip_optional_pos:
|
2020-10-20 02:04:01 -03:00
|
|
|
if (!noptargs) {
|
|
|
|
goto skip_optional_kwonly;
|
|
|
|
}
|
|
|
|
key = args[4];
|
|
|
|
skip_optional_kwonly:
|
|
|
|
_return_value = _bisect_bisect_left_impl(module, a, x, lo, hi, key);
|
2020-05-18 00:38:35 -03:00
|
|
|
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__,
|
2020-10-20 02:04:01 -03:00
|
|
|
"insort_left($module, /, a, x, lo=0, hi=None, *, key=None)\n"
|
2020-05-18 00:38:35 -03:00
|
|
|
"--\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 \
|
2022-05-03 15:25:41 -03:00
|
|
|
{"insort_left", _PyCFunction_CAST(_bisect_insort_left), METH_FASTCALL|METH_KEYWORDS, _bisect_insort_left__doc__},
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static PyObject *
|
|
|
|
_bisect_insort_left_impl(PyObject *module, PyObject *a, PyObject *x,
|
2020-10-20 02:04:01 -03:00
|
|
|
Py_ssize_t lo, Py_ssize_t hi, PyObject *key);
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
static PyObject *
|
|
|
|
_bisect_insort_left(PyObject *module, PyObject *const *args, Py_ssize_t nargs, PyObject *kwnames)
|
|
|
|
{
|
|
|
|
PyObject *return_value = NULL;
|
2020-10-20 02:04:01 -03:00
|
|
|
static const char * const _keywords[] = {"a", "x", "lo", "hi", "key", NULL};
|
2020-05-18 00:38:35 -03:00
|
|
|
static _PyArg_Parser _parser = {NULL, _keywords, "insort_left", 0};
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *argsbuf[5];
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
2020-10-20 02:04:01 -03:00
|
|
|
PyObject *key = Py_None;
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
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;
|
2020-05-28 04:33:45 -03:00
|
|
|
PyObject *iobj = _PyNumber_Index(args[2]);
|
2020-05-18 00:38:35 -03:00
|
|
|
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;
|
|
|
|
}
|
|
|
|
}
|
2020-10-20 02:04:01 -03:00
|
|
|
if (args[3]) {
|
|
|
|
if (!_Py_convert_optional_to_ssize_t(args[3], &hi)) {
|
|
|
|
goto exit;
|
|
|
|
}
|
|
|
|
if (!--noptargs) {
|
|
|
|
goto skip_optional_pos;
|
|
|
|
}
|
2020-05-18 00:38:35 -03:00
|
|
|
}
|
|
|
|
skip_optional_pos:
|
2020-10-20 02:04:01 -03:00
|
|
|
if (!noptargs) {
|
|
|
|
goto skip_optional_kwonly;
|
|
|
|
}
|
|
|
|
key = args[4];
|
|
|
|
skip_optional_kwonly:
|
|
|
|
return_value = _bisect_insort_left_impl(module, a, x, lo, hi, key);
|
2020-05-18 00:38:35 -03:00
|
|
|
|
|
|
|
exit:
|
|
|
|
return return_value;
|
|
|
|
}
|
2022-05-03 15:25:41 -03:00
|
|
|
/*[clinic end generated code: output=ee8c32ff8d3d1fac input=a9049054013a1b77]*/
|