by \function{heappush()}, and can be more appropriate when using
a fixed-size heap. Note that the value returned may be larger
than \var{item}! That constrains reasonable uses of this routine
-unless written as part of a larger expression:
+unless written as part of a conditional replacement:
\begin{verbatim}
- result = item <= heap[0] and item or heapreplace(heap, item)
+ if item > heap[0]:
+ item = heapreplace(heap, item)
\end{verbatim}
\end{funcdesc}
This is more efficient than heappop() followed by heappush(), and can be
more appropriate when using a fixed-size heap. Note that the value
returned may be larger than item! That constrains reasonable uses of
- this routine unless written as part of a larger expression:
+ this routine unless written as part of a conditional replacement:
- result = item <= heap[0] and item or heapreplace(heap, item)
+ if item > heap[0]:
+ item = heapreplace(heap, item)
"""
returnitem = heap[0] # raises appropriate IndexError if heap is empty
heap[0] = item
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\
returned may be larger than item! That constrains reasonable uses of\n\
-this routine unless written as part of a larger expression:\n\n\
- result = item <= heap[0] and item or heapreplace(heap, item)\n");
+this routine unless written as part of a conditional replacement:\n\n\
+ if item > heap[0]:\n\
+ item = heapreplace(heap, item)\n");
static PyObject *
heapify(PyObject *self, PyObject *heap)