Heap::Binomial(3pm)

✨ Heap::Binomial ✨

okay bestie, gather round, because today we're talking about Heap::Binomial — it lives in the Heap::Binomial(3pm) manual page and it's literally a binomial heap that keeps your data partially sorted. 💅

---

🎀 NAME 🎀

Heap::Binomial — a binomial heap to keep data partially sorted. no cap, that's the whole vibe. 👑

---

🌸 SYNOPSIS 🌸

use Heap::Binomial;

$heap = Heap::Binomial->new;
# see Heap(3) for usage

like… that's it. that's the whole thing. and yes, the comment is doing a lot of heavy lifting there — go read Heap(3) for the actual usage glow-up. 🫶

---

🦋 DESCRIPTION 🦋

So here's the tea: this module keeps elements in heap order using a linked list of binomial trees. 🌳🌳🌳 it's giving tree energy but make it a list.

The way that it works is — the heap method of an element is used to store a reference to the node in the list that refers to the element. so the element literally knows where it lives in the list. main character self-awareness. 🪞✨

For all the deets on actually using this module, check out Heap. that's where the real manual lives, iykyk. 💖

---

💜 AUTHOR 💜

John Macdonald, john@perlwolf.com — king behavior honestly 👑

---

🍓 COPYRIGHT 🍓

Copyright 1998-2007, O'Reilly & Associates.

This code is distributed under the same copyright terms as perl itself. so like, same rules as perl, periodt. 📜

---

🌈 SEE ALSO 🌈

• Heap(3) — go here first bestie, fr fr
• Heap::Elem(3) — the element side of the story 🧚

---

and that's a wrap on this page!! it came to you from perl v5.36.0, dated 2022-10-22, in the Heap::Binomial(3pm) manual. slay, go build some binomial trees, and don't forget to read Heap(3) 💖✨🎀