Perl 🐪 Weekly #791 - The Dark Side is here!
Perl 🐪 Weekly #791 - The Dark Side is here!
Perl 🐪 Weekly #791 - 黑暗模式来啦！
Originally published at Perl Weekly 791. Hi there! MetaCPAN has a night mode. Underbar has a new episode. The Lacuana Expanse is back. Enjoy your week! — Your editor: Gabor Szabo. 原文发布于 Perl Weekly 791。大家好！MetaCPAN 现在有了夜间模式。《Underbar》播客发布了新一期节目。《The Lacuna Expanse》回归了。祝大家度过愉快的一周！—— 您的编辑：Gabor Szabo。
Announcements
公告
The Lacuna Expanse: Updates Since We Last Saw Each Other by Natalie Rose. A new community-run reboot of The Lacuna Expanse. TLE Community. 《The Lacuna Expanse：自上次见面以来的更新》，作者：Natalie Rose。这是一个由社区运营的《The Lacuna Expanse》重启项目。TLE 社区。
Dancer2 2.2.1 released (security) by Jason A. Crome. Dancer2 2.2.0 released; security updates PLEASE READ by Jason A. Crome. Dancer2 2.2.1 发布（安全更新），作者：Jason A. Crome。Dancer2 2.2.0 发布；包含安全更新，请务必阅读，作者：Jason A. Crome。
Podcast
播客
Olaf Kolkman (part 2) by Philippe Bruhat. The Underbar, episode 10. Olaf Kolkman has had a long career in networking and Open Source that led him to be working on Internet Technology, Policy and Advocacy at the Internet Society. In September 2025, we had a long conversation with him. In this second part of our discussion, we discussed the Internet Society (ISOC) and managing volunteer organisations. Olaf Kolkman（第二部分），作者：Philippe Bruhat。《The Underbar》第 10 期。Olaf Kolkman 在网络和开源领域拥有悠久的职业生涯，这使他后来在互联网协会（Internet Society）从事互联网技术、政策和倡导工作。2025 年 9 月，我们与他进行了深入交谈。在讨论的第二部分中，我们探讨了互联网协会（ISOC）以及如何管理志愿者组织。
Articles
文章
DARK MOOOOOOOOOOOOOOOODE by Olaf Alders. MetaCPAN Dark mode. DARK MOOOOOOOOOOOOOOOODE（黑暗模式），作者：Olaf Alders。MetaCPAN 黑暗模式。
NWC2MusicXML by Nigel Horne. That is NoteWorthy Composer 2 to MusicXML converter. Music::NWC2MusicXML. NWC2MusicXML，作者：Nigel Horne。这是一个将 NoteWorthy Composer 2 转换为 MusicXML 的转换器。Music::NWC2MusicXML。
Reflecting on Mirrors — Part II by Rob Lauer. How to compile WWW::Curl on AIX 7.2 and 7.3 with IBM xlC. 反思镜像（第二部分），作者：Rob Lauer。如何在 AIX 7.2 和 7.3 上使用 IBM xlC 编译 WWW::Curl。
WFC in Perl: A Server-Driven UI Approach for Perl. But when I visit WebForms on MetaCPAN it say ‘Error rendering POD for WebForms.pm - Requested resource is a binary file’. What does this mean? Perl 中的 WFC：一种 Perl 的服务器驱动 UI 方法。但是当我访问 MetaCPAN 上的 WebForms 时，它显示“渲染 WebForms.pm 的 POD 时出错 - 请求的资源是二进制文件”。这是什么意思？
Reflecting on Mirrors — Part I by Rob Lauer. 反思镜像（第一部分），作者：Rob Lauer。
Amazon::S3 v2.1.0 - On Being an S3 Client by Rob Lauer. Amazon::S3 v2.1.0 - 关于成为 S3 客户端，作者：Rob Lauer。
ANNOUNCE: Perl.Wiki V 1.54, etc by Ron Savage. Zero is a measurement: reading JSON latency events in Perl. 公告：Perl.Wiki V 1.54 等，作者：Ron Savage。零也是一种度量：在 Perl 中读取 JSON 延迟事件。
Discussion
讨论
How to report bugs on cpan.org? Perl This week in PSC (235) | 2026-09-14. 如何在 cpan.org 上报告 Bug？Perl 本周 PSC (235) | 2026-09-14。
The Weekly Challenge
每周挑战
The Weekly Challenge by Mohammad Sajid Anwar will help you step out of your comfort-zone. You can even win prize money of $50 by participating in the weekly challenge. We pick one champion at the end of the month from among all of the contributors during the month, thanks to the sponsor Marc Perry. 由 Mohammad Sajid Anwar 发起的“每周挑战”将帮助你走出舒适区。参与每周挑战甚至有机会赢取 50 美元的奖金。感谢赞助商 Marc Perry，我们会在月底从所有贡献者中选出一名冠军。
The Weekly Challenge - 392 by Mohammad Sajid Anwar. Welcome to a new week with a couple of fun tasks “Convert Palindrome” and “Words Length Product”. If you are new to the weekly challenge then why not join us and have fun every week. For more information, please read the FAQ. 每周挑战 - 392，作者：Mohammad Sajid Anwar。欢迎来到新的一周，本周有两个有趣的挑战任务：“转换回文”和“单词长度乘积”。如果你是每周挑战的新手，何不加入我们，每周享受乐趣呢？更多信息，请阅读常见问题解答（FAQ）。
RECAP - The Weekly Challenge - 391 by Mohammad Sajid Anwar. Enjoy a quick recap of last week’s contributions by Team PWC dealing with the “Array Median” and “Arrange Box” tasks in Perl and Raku. You will find plenty of solutions to keep you busy. 回顾 - 每周挑战 - 391，作者：Mohammad Sajid Anwar。快速回顾上周 PWC 团队在 Perl 和 Raku 中处理“数组中位数”和“排列盒子”任务的贡献。你会发现大量的解决方案供你参考。
TWC391 by Ali Moradi. Ali has mentioned in post the perfectly clean, practical, and well-structured solutions implemented in Perl coding for both tasks worth noting. The post rates excellently when it comes to its ability to handle edge cases related to the median of an array. The 2D box-stacking task is efficiently solved by the implementation of the dynamic programming approach to Longest Increasing Subsequence problem in this post. TWC391，作者：Ali Moradi。Ali 在文章中提到了用 Perl 编写的两个任务的解决方案，这些方案非常简洁、实用且结构良好，值得关注。该文章在处理与数组中位数相关的边界情况方面表现出色。文中的二维盒子堆叠任务通过实现最长递增子序列问题的动态规划方法得到了高效解决。
Median Boxes by Bob Lied. The blog post by Bob, is a great and user-friendly demonstration of solving problems using modern Perl programming language. It combines the intuitive comparisons of algorithms supported with some presented empirical data for median problems and modern object-oriented practices such as utilisation of class syntax of Perl 5.44 and object overloading. Median Boxes，作者：Bob Lied。Bob 的博客文章是一个使用现代 Perl 编程语言解决问题的绝佳且用户友好的演示。它结合了直观的算法比较，并辅以针对中位数问题的一些实证数据，以及现代面向对象实践，例如利用 Perl 5.44 的类语法和对象重载。
Two Optimisation Tasks in the Weekly Challenge 391 by E. Choroba. E. Choroba has offered a detailed analysis of Perl Weekly Challenge 391, focusing on various algorithms used in this challenge. This analysis is not limited to basic algorithms. With the help of extensive benchmarking, he has shown the effectiveness of using list slices for calculating median values and has provided detailed analysis of using trim operation in path state processing, which makes it possible to change a complex algorithm into an efficient and scalable one. 每周挑战 391 中的两个优化任务，作者：E. Choroba。E. Choroba 对 Perl 每周挑战 391 进行了详细分析，重点介绍了挑战中使用的各种算法。这种分析不仅限于基础算法。通过大量的基准测试，他展示了使用列表切片计算中位数的有效性，并详细分析了在路径状态处理中使用修剪（trim）操作，这使得将复杂算法转变为高效且可扩展的算法成为可能。
The Weekly Challenge 391 by Luboš Kolouch. This post by Lubos provides clean, easily readable multi-lingual solutions for both problems described in the challenge. The solutions in this post are characterised by the simple logic of the implementation, efficiently implementing the array median calculation along with boxes stacking through structured iterative checks, which makes the post a valuable one for both Perl and Python developers. 每周挑战 391，作者：Luboš Kolouch。Lubos 的这篇文章为挑战中描述的两个问题提供了简洁、易读的多语言解决方案。文章中的解决方案以简单的实现逻辑为特征，通过结构化的迭代检查高效地实现了数组中位数计算和盒子堆叠，这使得该文章对 Perl 和 Python 开发人员都很有价值。
Perl Weekly Challenge 391 by W Luis Mochan. W. Luis Mochán contributes a smart, very concise Perl example to Weekly Challenge 391 indicating that complicated algorithmic problems can be simplified down to expressive and concise solutions. He shows a good understanding of Perl’s functional abilities through one-liners and takes them further in building an understandable production-type script ready for calculating arrays medians and working out box-nesting relationships. Perl 每周挑战 391，作者：W Luis Mochan。W. Luis Mochán 为每周挑战 391 贡献了一个聪明且非常简洁的 Perl 示例，表明复杂的算法问题可以简化为富有表现力且简洁的解决方案。他通过单行代码展示了对 Perl 函数式能力的深刻理解，并进一步构建了可理解的生产级脚本，用于计算数组中位数和处理盒子嵌套关系。
Arrays of Numbers, Arrays of Boxes by Matthias Muth. Matthias gives an exemplary explanation of the two components of Challenge 391. He provides a thorough explanation of the mathematical and algorithmic aspects through neat array merging in the median calculation and a smart way of solving the box-nesting challenge, which is a valuable resource for all Perl practitioners. 数字数组，盒子数组，作者：Matthias Muth。Matthias 对挑战 391 的两个部分给出了示范性的解释。他通过中位数计算中整洁的数组合并，以及解决盒子嵌套挑战的巧妙方法，对数学和算法方面进行了详尽的解释，这对所有 Perl 从业者来说都是宝贵的资源。
Old King Cole Was A Merry Old Soul by Packy Anderson. Packy’s blog post, provides an easy to understand, multilingual summary of both challenge tasks in Perl, Raku, Python, and Elixir. His methodology is different in that he is able to use pre-sorted inputs when merging arrays, which makes the explanation of algorithms entertaining and it even includes some musical aspects. Old King Cole Was A Merry Old Soul，作者：Packy Anderson。Packy 的博客文章提供了易于理解的多语言总结，涵盖了 Perl、Raku、Python 和 Elixir 中的两个挑战任务。他的方法与众不同之处在于，他在合并数组时能够使用预排序的输入，这使得算法的解释变得有趣，甚至还包含了一些音乐元素。
Medians and stacks by Peter Campbell Smith. In his post, Peter takes an impressively straightforward approach that prioritises the clarity of coding instead of extreme conciseness of the code. His approach uses simple array concatenation and arithmetic checking of the index for median computation as well as there is a thorough input/output reporting that facilitates understanding of the logic. 中位数与堆叠，作者：Peter Campbell Smith。在文章中，Peter 采取了一种令人印象深刻的直接方法，优先考虑代码的清晰度，而不是代码的极致简洁。他的方法使用简单的数组连接和索引的算术检查来进行中位数计算，并且有详尽的输入/输出报告，有助于理解逻辑。
The Weekly Challenge - 391 TASK #1: Array Median by Reinier Maliepaard. Reinier’s work on Perl Weekly Challenge 391 showcases a great, nicely for 每周挑战 - 391 任务 #1：数组中位数，作者：Reinier Maliepaard。Reinier 在 Perl 每周挑战 391 上的工作展示了一个出色且美观的……（注：原文此处截断）