Gecko [ www.foryou-vip.com ]

Name	Size	Permission	Date
_abc.c.h	4.83 KB	-rw-r--r--	2024-03-19 22:46
_asynciomodule.c.h	26.93 KB	-rw-r--r--	2024-03-19 22:46
_bisectmodule.c.h	9.79 KB	-rw-r--r--	2024-03-19 22:46
_bz2module.c.h	4.54 KB	-rw-r--r--	2024-03-19 22:46
_codecsmodule.c.h	79.5 KB	-rw-r--r--	2024-03-19 22:46
_collectionsmodule.c.h	1.98 KB	-rw-r--r--	2024-03-19 22:46
_contextvarsmodule.c.h	605 B	-rw-r--r--	2024-03-19 22:46
_cryptmodule.c.h	1.89 KB	-rw-r--r--	2024-03-19 22:46
_curses_panel.c.h	12.01 KB	-rw-r--r--	2024-03-19 22:46
_cursesmodule.c.h	116.36 KB	-rw-r--r--	2024-03-19 22:46
_datetimemodule.c.h	2.89 KB	-rw-r--r--	2024-03-19 22:46
_dbmmodule.c.h	5.25 KB	-rw-r--r--	2024-03-19 22:46
_elementtree.c.h	27.74 KB	-rw-r--r--	2024-03-19 22:46
_gdbmmodule.c.h	9.65 KB	-rw-r--r--	2024-03-19 22:46
_hashopenssl.c.h	41.2 KB	-rw-r--r--	2024-03-19 22:46
_heapqmodule.c.h	7.02 KB	-rw-r--r--	2024-03-19 22:46
_localemodule.c.h	16.33 KB	-rw-r--r--	2024-03-19 22:46
_lsprof.c.h	1.69 KB	-rw-r--r--	2024-03-19 22:46
_lzmamodule.c.h	9.36 KB	-rw-r--r--	2024-03-19 22:46
_opcode.c.h	1.77 KB	-rw-r--r--	2024-03-19 22:46
_operator.c.h	34.41 KB	-rw-r--r--	2024-03-19 22:46
_pickle.c.h	28.16 KB	-rw-r--r--	2024-03-19 22:46
_queuemodule.c.h	7.86 KB	-rw-r--r--	2024-03-19 22:46
_randommodule.c.h	2.9 KB	-rw-r--r--	2024-03-19 22:46
_sre.c.h	32.85 KB	-rw-r--r--	2024-03-19 22:46
_ssl.c.h	40.66 KB	-rw-r--r--	2024-03-19 22:46
_statisticsmodule.c.h	1.82 KB	-rw-r--r--	2024-03-19 22:46
_struct.c.h	10.43 KB	-rw-r--r--	2024-03-19 22:46
_testclinic.c.h	54.67 KB	-rw-r--r--	2024-03-19 22:46
_testmultiphase.c.h	5.24 KB	-rw-r--r--	2024-03-19 22:46
_tkinter.c.h	23.74 KB	-rw-r--r--	2024-03-19 22:46
_tracemalloc.c.h	6.39 KB	-rw-r--r--	2024-03-19 22:46
_weakref.c.h	1.95 KB	-rw-r--r--	2024-03-19 22:46
_winapi.c.h	38.41 KB	-rw-r--r--	2024-03-19 22:46
arraymodule.c.h	15.93 KB	-rw-r--r--	2024-03-19 22:46
audioop.c.h	35.59 KB	-rw-r--r--	2024-03-19 22:46
binascii.c.h	20.38 KB	-rw-r--r--	2024-03-19 22:46
cmathmodule.c.h	21.97 KB	-rw-r--r--	2024-03-19 22:46
fcntlmodule.c.h	7.68 KB	-rw-r--r--	2024-03-19 22:46
gcmodule.c.h	9.87 KB	-rw-r--r--	2024-03-19 22:46
grpmodule.c.h	2.79 KB	-rw-r--r--	2024-03-19 22:46
itertoolsmodule.c.h	18.66 KB	-rw-r--r--	2024-03-19 22:46
mathmodule.c.h	20.65 KB	-rw-r--r--	2024-03-19 22:46
md5module.c.h	3.28 KB	-rw-r--r--	2024-03-19 22:46
overlapped.c.h	28.07 KB	-rw-r--r--	2024-03-19 22:46
posixmodule.c.h	254.99 KB	-rw-r--r--	2024-03-19 22:46
pwdmodule.c.h	1.9 KB	-rw-r--r--	2024-03-19 22:46
pyexpat.c.h	15.4 KB	-rw-r--r--	2024-03-19 22:46
readline.c.h	19.77 KB	-rw-r--r--	2024-03-19 22:46
resource.c.h	4.16 KB	-rw-r--r--	2024-03-19 22:46
selectmodule.c.h	33.42 KB	-rw-r--r--	2024-03-19 22:46
sha1module.c.h	3.33 KB	-rw-r--r--	2024-03-19 22:46
sha256module.c.h	4.9 KB	-rw-r--r--	2024-03-19 22:46
sha512module.c.h	4.9 KB	-rw-r--r--	2024-03-19 22:46
signalmodule.c.h	18.72 KB	-rw-r--r--	2024-03-19 22:46
spwdmodule.c.h	1.81 KB	-rw-r--r--	2024-03-19 22:46
symtablemodule.c.h	1.51 KB	-rw-r--r--	2024-03-19 22:46
termios.c.h	6.2 KB	-rw-r--r--	2024-03-19 22:46
unicodedata.c.h	16.11 KB	-rw-r--r--	2024-03-19 22:46
zlibmodule.c.h	25.07 KB	-rw-r--r--	2024-03-19 22:46

Rename

/*[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, a.insert(i, x) will\n"
"insert just after 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, a.insert(i, x) will\n"
"insert just 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=aeb97db6db79bf96 input=a9049054013a1b77]*/