@@ -141,7 +141,7 @@ heappush(PyObject *self, PyObject *args)
141
141
}
142
142
143
143
PyDoc_STRVAR (heappush_doc ,
144
- "Push item onto heap, maintaining the heap invariant." );
144
+ "heappush(heap, item) -> None. Push item onto heap, maintaining the heap invariant." );
145
145
146
146
static PyObject *
147
147
heappop (PyObject * self , PyObject * heap )
@@ -209,7 +209,7 @@ heapreplace(PyObject *self, PyObject *args)
209
209
}
210
210
211
211
PyDoc_STRVAR (heapreplace_doc ,
212
- "Pop and return the current smallest value, and add the new item.\n\
212
+ "heapreplace(heap, item) -> value. Pop and return the current smallest value, and add the new item.\n\
213
213
\n\
214
214
This is more efficient than heappop() followed by heappush(), and can be\n\
215
215
more appropriate when using a fixed-size heap. Note that the value\n\
@@ -256,7 +256,7 @@ heappushpop(PyObject *self, PyObject *args)
256
256
}
257
257
258
258
PyDoc_STRVAR (heappushpop_doc ,
259
- "Push item on the heap, then pop and return the smallest item\n\
259
+ "heappushpop(heap, item) -> value. Push item on the heap, then pop and return the smallest item\n\
260
260
from the heap. The combined action runs more efficiently than\n\
261
261
heappush() followed by a separate call to heappop()." );
262
262
0 commit comments