Lines Matching defs:value
67 * Note: new_allocated won't overflow because the largest possible value
621 /* Never fails; the return value can be ignored.
1367 The return value is the int k in 0..n such that
1454 finds the position immediately to the right of the rightmost equal value.
1456 The return value is the int k in 0..n such that
2048 /* Compute a good value for the minimum run length; natural runs shorter
2588 value: object
2593 Return first index of value.
2595 Raises ValueError if the value is not present.
2599 list_index_impl(PyListObject *self, PyObject *value, Py_ssize_t start,
2618 int cmp = PyObject_RichCompareBool(obj, value, Py_EQ);
2625 PyErr_Format(PyExc_ValueError, "%R is not in list", value);
2632 value: object
2635 Return number of occurrences of value.
2639 list_count(PyListObject *self, PyObject *value)
2647 if (obj == value) {
2652 int cmp = PyObject_RichCompareBool(obj, value, Py_EQ);
2665 value: object
2668 Remove first occurrence of value.
2670 Raises ValueError if the value is not present.
2674 list_remove(PyListObject *self, PyObject *value)
2682 int cmp = PyObject_RichCompareBool(obj, value, Py_EQ);
2931 list_ass_subscript(PyListObject* self, PyObject* item, PyObject* value)
2939 return list_ass_item(self, i, value);
2951 return list_ass_slice(self, start, stop, value);
2959 if (value == NULL) {
3029 if (self == (PyListObject*)value) {
3030 seq = list_slice((PyListObject*)value, 0,
3031 PyList_GET_SIZE(value));
3034 seq = PySequence_Fast(value,