Array(3)

πŸ“¦
version 0.006 Β· 2 versions
, in fedora 43

πŸ’– Array(3) β€” POE::XS::Queue::Array πŸ’–

okay so bestie, welcome to the manual page for POE::XS::Queue::Array β€” it's from the User Contributed Perl Documentation, and it's basically the glow-up era of a queue. let's get into it πŸŽ€


✨ NAME ✨

POE::XS::Queue::Array β€” it's an XS implementation of POE::Queue::Array. that's the whole vibe. πŸ’…


πŸ¦‹ SYNOPSIS πŸ¦‹

see POE::Queue. like. that's it. go look at the parent, she's serving the details.

See POE::Queue.

🌸 DESCRIPTION 🌸

so this class is one specific implementation of the abstract POE::Queue interface. it does a priority queue written in C, with an XS interface bolted on so Perl can talk to it. very demure, very mindful, very compiled. ✨

ngl, the current implementation could use some optimization, especially for large queues. like she's gorgeous but she's not running a marathon yet, yk?

please go read the POE::Queue documentation, because that's where the functions, features, and behavior of this one are actually explained. this page is not the main character for that part.

here's the tea tho β€” the following extra methods are added on top of everything POE::Queue::Array already gives you:

  • dump β€” dumps the internal structure of the queue to stderr. just vibes, just spilling her guts. πŸ’€
  • verify β€” does a limited verification of the structure of the queue. and bestie, if the verification fails then a message gets sent to stderr, and the queue gets dumped exactly like the dump() method does, and your program will exit. so yeah, it's giving final boss. no survivors. πŸ™ˆ

🌈 SEE ALSO 🌈

go read these, they're the besties:

  • POE
  • POE::Queue
  • POE::Queue::Array

πŸ’€ BUGS πŸ’€

None known. periodt. she's clean. ✨

some possible improvements include:

  • use a B-Tree for the queue β€” and yes, not a binary tree, a B-Tree, the distinction matters, iykyk β€” though this would require a module rename.
  • use a custom hash instead of a HV for the id-to-priority mapping β€” either glib's hash, or convert to C++ and use the STL map.
  • some of the XS code could be optimized to do less work in scalar context β€” pq_remove_items and pq_peek_items could avoid building all those array refs.

πŸ‘‘ LICENSE πŸ‘‘

POE::XS::Queue::Array is licensed under the same terms as Perl itself. so, iconic behavior, no notes. πŸ’…


🫢 AUTHOR 🫢

Tony Cook <tonyc@cpan.org> β€” thank you king, we love you, we're obsessed. πŸŽ€


okay that's the whole page!! this came from perl v5.42.0 dated 2025-07-25 and it lives in section Array(3) β€” mwah, take care of her, byeee πŸ’–βœ¨

πŸ“¦ where this page comes from