{"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-Tie-LLHash-1.004p0","path":"devel/p5-Tie-LLHash","url":"/packages/current/devel/p5-Tie-LLHash/","comment":"ordered hashes","homepage":"https://metacpan.org/release/Tie-LLHash","maintainer":"The OpenBSD ports mailing-list <ports@openbsd.org>","description":"This class implements an ordered hash-like object. It's a cross\nbetween a Perl hash and a linked list. Use it whenever you want the\nspeed and structure of a Perl hash, but the orderedness of a list.\n\nDon't use it if you want to be able to address your hash entries\nby number, like you can in a real list ($list[5]).\n\nSee also Tie::IxHash by Gurusamy Sarathy. It's similar (it also\ndoes ordered hashes), but it has a different internal data structure\nand a different flavor of usage. IxHash stores its data internally\nas both a hash and an array in parallel. LLHash stores its data as\na bidirectional linked list, making both inserts and deletes very\nfast. IxHash therefore makes your hash behave more like a list than\nLLHash does. This module keeps more of the hash flavor.\n","package_architecture":"*","stem":"p5-Tie-LLHash","readme":null,"dependencies":[],"reverse_dependencies":{"count":1,"url":"/packages/data/22/22ba3b14a2a30b7916789ccf238b477f8339c2a0fb6676c2444d9a55ae88c365.json"},"categories":["devel","perl5"],"flavors":[],"only_for_architectures":[],"not_for_architectures":[]}}