module heapq

Source: stdlib/heapq.codon

---

heappush(heap: List[T], item: T, T: type)

---

heappop(heap: List[T], T: type)

---

heapreplace(heap: List[T], item: T, T: type)

---

heappushpop(heap: List[T], item: T, T: type)

---

heapify(x: List[T], T: type)

---

nsmallest(n: int, iterable: Generator[T], key = Optional[int](), T: type)

---

nlargest(n: int, iterable: Generator[T], key = Optional[int](), T: type)

---

merge(*iterables, key = Optional[int](), reverse: bool = False)