[Python-checkins] python/dist/src/Modules _bisectmodule.c,1.2,1.3

rhettinger@users.sourceforge.net rhettinger at users.sourceforge.net
Wed Oct 5 13:39:16 CEST 2005


Update of /cvsroot/python/python/dist/src/Modules
In directory sc8-pr-cvs1.sourceforge.net:/tmp/cvs-serv3838/Modules

Modified Files:
	_bisectmodule.c 
Log Message:
SF #1313496:  bisect C replacement doesn't accept named args



Index: _bisectmodule.c
===================================================================
RCS file: /cvsroot/python/python/dist/src/Modules/_bisectmodule.c,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -d -r1.2 -r1.3
--- _bisectmodule.c	2 Aug 2004 13:24:54 -0000	1.2
+++ _bisectmodule.c	5 Oct 2005 11:39:12 -0000	1.3
@@ -34,15 +34,16 @@
 }
 
 static PyObject *
-bisect_right(PyObject *self, PyObject *args)
+bisect_right(PyObject *self, PyObject *args, PyObject *kw)
 {
 	PyObject *list, *item;
 	int lo = 0;
 	int hi = -1;
 	int index;
+	static char *keywords[] = {"a", "x", "lo", "hi", NULL};
 
-	if (!PyArg_ParseTuple(args, "OO|ii:bisect_right",
-		&list, &item, &lo, &hi))
+	if (!PyArg_ParseTupleAndKeywords(args, kw, "OO|ii:bisect_right",
+		keywords, &list, &item, &lo, &hi))
 		return NULL;
 	index = internal_bisect_right(list, item, lo, hi);
 	if (index < 0)
@@ -51,7 +52,7 @@
 }
 
 PyDoc_STRVAR(bisect_right_doc,
-"bisect_right(list, item[, lo[, hi]]) -> index\n\
+"bisect_right(a, x[, lo[, hi]]) -> index\n\
 \n\
 Return the index where to insert item x in list a, assuming a is sorted.\n\
 \n\
@@ -63,15 +64,16 @@
 slice of a to be searched.\n");
 
 static PyObject *
-insort_right(PyObject *self, PyObject *args)
+insort_right(PyObject *self, PyObject *args, PyObject *kw)
 {
 	PyObject *list, *item, *result;
 	int lo = 0;
 	int hi = -1;
 	int index;
+	static char *keywords[] = {"a", "x", "lo", "hi", NULL};
 
-	if (!PyArg_ParseTuple(args, "OO|ii:insort_right",
-		&list, &item, &lo, &hi))
+	if (!PyArg_ParseTupleAndKeywords(args, kw, "OO|ii:insort_right",
+		keywords, &list, &item, &lo, &hi))
 		return NULL;
 	index = internal_bisect_right(list, item, lo, hi);
 	if (index < 0)
@@ -91,7 +93,7 @@
 }
 
 PyDoc_STRVAR(insort_right_doc,
-"insort_right(list, item[, lo[, hi]])\n\
+"insort_right(a, x[, lo[, hi]])\n\
 \n\
 Insert item x in list a, and keep it sorted assuming a is sorted.\n\
 \n\
@@ -129,15 +131,16 @@
 }
 
 static PyObject *
-bisect_left(PyObject *self, PyObject *args)
+bisect_left(PyObject *self, PyObject *args, PyObject *kw)
 {
 	PyObject *list, *item;
 	int lo = 0;
 	int hi = -1;
 	int index;
+	static char *keywords[] = {"a", "x", "lo", "hi", NULL};
 
-	if (!PyArg_ParseTuple(args, "OO|ii:bisect_left",
-		&list, &item, &lo, &hi))
+	if (!PyArg_ParseTupleAndKeywords(args, kw, "OO|ii:bisect_left",
+		keywords, &list, &item, &lo, &hi))
 		return NULL;
 	index = internal_bisect_left(list, item, lo, hi);
 	if (index < 0)
@@ -146,7 +149,7 @@
 }
 
 PyDoc_STRVAR(bisect_left_doc,
-"bisect_left(list, item[, lo[, hi]]) -> index\n\
+"bisect_left(a, x[, lo[, hi]]) -> index\n\
 \n\
 Return the index where to insert item x in list a, assuming a is sorted.\n\
 \n\
@@ -158,15 +161,16 @@
 slice of a to be searched.\n");
 
 static PyObject *
-insort_left(PyObject *self, PyObject *args)
+insort_left(PyObject *self, PyObject *args, PyObject *kw)
 {
 	PyObject *list, *item, *result;
 	int lo = 0;
 	int hi = -1;
 	int index;
+	static char *keywords[] = {"a", "x", "lo", "hi", NULL};
 
-	if (!PyArg_ParseTuple(args, "OO|ii:insort_left",
-		&list, &item, &lo, &hi))
+	if (!PyArg_ParseTupleAndKeywords(args, kw, "OO|ii:insort_left",
+		keywords, &list, &item, &lo, &hi))
 		return NULL;
 	index = internal_bisect_left(list, item, lo, hi);
 	if (index < 0)
@@ -186,7 +190,7 @@
 }
 
 PyDoc_STRVAR(insort_left_doc,
-"insort_left(list, item[, lo[, hi]])\n\
+"insort_left(a, x[, lo[, hi]])\n\
 \n\
 Insert item x in list a, and keep it sorted assuming a is sorted.\n\
 \n\
@@ -200,17 +204,17 @@
 
 static PyMethodDef bisect_methods[] = {
 	{"bisect_right", (PyCFunction)bisect_right,
-		METH_VARARGS, bisect_right_doc},
+		METH_VARARGS|METH_KEYWORDS, bisect_right_doc},
 	{"bisect", (PyCFunction)bisect_right,
-		METH_VARARGS, bisect_doc},
+		METH_VARARGS|METH_KEYWORDS, bisect_doc},
 	{"insort_right", (PyCFunction)insort_right,
-		METH_VARARGS, insort_right_doc},
+		METH_VARARGS|METH_KEYWORDS, insort_right_doc},
 	{"insort", (PyCFunction)insort_right,
-		METH_VARARGS, insort_doc},
+		METH_VARARGS|METH_KEYWORDS, insort_doc},
 	{"bisect_left", (PyCFunction)bisect_left,
-		METH_VARARGS, bisect_left_doc},
+		METH_VARARGS|METH_KEYWORDS, bisect_left_doc},
 	{"insort_left", (PyCFunction)insort_left,
-		METH_VARARGS, insort_left_doc},
+		METH_VARARGS|METH_KEYWORDS, insort_left_doc},
 	{NULL, NULL} /* sentinel */
 };
 



More information about the Python-checkins mailing list