"""
|see_cpython_module| :mod:`python:heapq`.
This module implements the heap queue algorithm.
A heap queue is simply a list that has its elements stored in a certain way.
"""

def heappush(heap, item):
    """
    Push the ``item`` onto the ``heap``.
    """
    pass

def heappop(heap):
    """
    Pop the first item from the ``heap``, and return it.  Raises IndexError if
    heap is empty.
    """
    pass

def heapify(x):
    """
    Convert the list ``x`` into a heap.  This is an in-place operation.
    """
    pass


30630f35bca640e0353bfb626a1a7c5ac4dd2ea2
<mask token>

<mask token>


def heappush(heap, item):
    """
    Push the ``item`` onto the ``heap``.
    """
    pass


<mask token>

<mask token>


def heappush(heap, item):
    """
    Push the ``item`` onto the ``heap``.
    """
    pass


def heappop(heap):
    """
    Pop the first item from the ``heap``, and return it.  Raises IndexError if
    heap is empty.
    """
    pass


<mask token>

<mask token>


def heappush(heap, item):
    """
    Push the ``item`` onto the ``heap``.
    """
    pass


def heappop(heap):
    """
    Pop the first item from the ``heap``, and return it.  Raises IndexError if
    heap is empty.
    """
    pass


def heapify(x):
    """
    Convert the list ``x`` into a heap.  This is an in-place operation.
    """
    pass

"""
|see_cpython_module| :mod:`python:heapq`.
This module implements the heap queue algorithm.
A heap queue is simply a list that has its elements stored in a certain way.
"""

def heappush(heap, item):
    """
    Push the ``item`` onto the ``heap``.
    """
    pass

def heappop(heap):
    """
    Pop the first item from the ``heap``, and return it.  Raises IndexError if
    heap is empty.
    """
    pass

def heapify(x):
    """
    Convert the list ``x`` into a heap.  This is an in-place operation.
    """
    pass

