https://nalar.dev/tags/priority-queue/ Recent content in Priority Queue on Nalar Hugo en-us Tue, 08 Sep 2026 00:00:00 +0700 https://nalar.dev/use-native-max-heaps-with-python-heapq/ Tue, 08 Sep 2026 00:00:00 +0700 https://nalar.dev/use-native-max-heaps-with-python-heapq/ <p>Python&rsquo;s <code>heapq</code> module has historically been centered on min-heaps: the smallest element lives at index zero. Developers who needed a max-heap commonly negated numeric priorities before pushing them and negated them again after popping.</p> <p>Python 3.14 makes that workaround unnecessary for many programs. <code>heapq</code> now exposes a complete max-heap API: <code>heapify_max()</code>, <code>heappush_max()</code>, <code>heappop_max()</code>, <code>heappushpop_max()</code>, and <code>heapreplace_max()</code>.</p> <p>The new functions are simple, but using them well still requires understanding heap invariants, fixed-size selection, tie-breaking, and the important difference between push-pop and replace operations.</p>