From bca22096a111bd2a4f4fb8ab3a271a4d5a245dfa Mon Sep 17 00:00:00 2001 From: Raymond Hettinger Date: Fri, 18 Jan 2013 17:35:25 -0800 Subject: [PATCH] Show the function signature in the docstring --- Modules/_heapqmodule.c | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Modules/_heapqmodule.c b/Modules/_heapqmodule.c index 495114b9a19..fc24471c32b 100644 --- a/Modules/_heapqmodule.c +++ b/Modules/_heapqmodule.c @@ -141,7 +141,7 @@ heappush(PyObject *self, PyObject *args) } PyDoc_STRVAR(heappush_doc, -"Push item onto heap, maintaining the heap invariant."); +"heappush(heap, item) -> None. Push item onto heap, maintaining the heap invariant."); static PyObject * heappop(PyObject *self, PyObject *heap) @@ -209,7 +209,7 @@ heapreplace(PyObject *self, PyObject *args) } PyDoc_STRVAR(heapreplace_doc, -"Pop and return the current smallest value, and add the new item.\n\ +"heapreplace(heap, item) -> value. Pop and return the current smallest value, and add the new item.\n\ \n\ This is more efficient than heappop() followed by heappush(), and can be\n\ more appropriate when using a fixed-size heap. Note that the value\n\ @@ -256,7 +256,7 @@ heappushpop(PyObject *self, PyObject *args) } PyDoc_STRVAR(heappushpop_doc, -"Push item on the heap, then pop and return the smallest item\n\ +"heappushpop(heap, item) -> value. Push item on the heap, then pop and return the smallest item\n\ from the heap. The combined action runs more efficiently than\n\ heappush() followed by a separate call to heappop().");