{"schema_version":1,"metadata":{"branch":"current","release":"7.9","architecture":"amd64","generated_at":"2026-09-09T04:04:41.004595+00:00","source_url":"https://cdn.openbsd.org/pub/OpenBSD/snapshots/packages/amd64/sqlports-7.55.tgz","source_sha256":"fcdbba1b9df747882aa9bab4af20ebec8dac10655069c90f1cd4145c06e1235e","package_count":12031,"source_kind":"sqlports"},"package":{"name":"p5-Heap-0.80p2","path":"devel/p5-Heap","url":"/packages/current/devel/p5-Heap/","comment":"heap data structure in perl","homepage":"https://metacpan.org/release/Heap","maintainer":"The OpenBSD ports mailing-list <ports@openbsd.org>","description":"This is a collection of routines for managing a heap data structure.\n\nThere are two major components: a heap component, and an element\ncomponent.\n\nA heap package basically keeps a collection of elements and is\nable to return the smallest one.\n\nThe heap component interface is defined in Heap(3) and must be\nsupported by all heap packages.  Currently there are three heap\ncomponents provided:\n\n    Heap::Fibonacci  (the preferred one)\n    Heap::Binomial\n    Heap::Binary\n\nSee the book \"Algorithms\" by Cormen, Leiserson, and Rivest for\ndetails of the three heap packages.\n","package_architecture":"*","stem":"p5-Heap","readme":null,"dependencies":[],"reverse_dependencies":{"count":4,"url":"/packages/data/2c/2c9d8962fa6cd11aa776c70fabcdaca948663f06909e17a4b0814bd35aaa9cbd.json"},"categories":["devel","perl5"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}