DEV Community: Gabor Szabo

Perl 🐪 Weekly #779 - LinkedIn and the Perl Weekly

Gabor Szabo — Mon, 29 Jun 2026 07:39:29 +0000

Originally published at Perl Weekly 779

Hi there!

In the 15 years since the Perl Weekly was first published we included posts from more than 800 authors. For 114 of them we have their LinkedIn profile, for 264 we have their PAUSE id, and for 200 we have a picture. I would love to get your help finding more. You can see the full list of authors. The source is in the src/authors.json file in our repository. Please help us locate more information about our authors. Send a PR or send me an email with links to the profiles of the authors. (If you send PR send a separate one for each author. That will make it easier to accept them.)

To make the LinkedIn information more useful I've also update the templates of the Perl Weekly and in each issue we'll include the link to the LinkedIn profile of each author. If we have it on file.

Discussing posts on Reddit: Many of the Perl Weekly posts have appeared on Reddit and some have active discussion. I used to embed links to these discussions in the text of the entry, but now Reddit got a separate field in our data files. From now we can include a little Reddit logo next to each entry linking to the respective Reddit post. I hope this will allow you to get involved in the discussion.

We had two excellent presentations at the Perl Maven online event last week. You can find the videos below. Make sure you 'like' them. You can register to the next event.

Finally, if you'd like to join our WhatsApp or Telegram chat group about Perl, contact me via the respective platform and I'll add you to the channel.

Enjoy your week!

--
Your editor: Gabor Szabo.

Announcements

PAGI Distribution split on CPAN by John Napiorkowski

The news: PAGI is now three CPAN distributions instead of one. PAGI-Server — the reference server; PAGI-Tools — the application toolkit; PAGI — the specification;

ANNOUNCE: Perl.Wiki V 1.49, etcby Ron Savage

Articles

Perl PAGI Middlewareby John Napiorkowski

A port of the sample app from What Is Middleware? - which builds the same three-layer stack in Plack/PSGI (Perl) and Starlette/ASGI (Python) - to PAGI, an async, ASGI-style application interface for Perl.

What Was Matt Thinking? The high schooler who developed everyone’s forums and guestbooks in 1996 didn’t really think about security when he was building all that software. But Matt’s Script Archive was more than exploits.

GTC 2.20 Pro designerby Herbert Breunung

GTC 2.20 brings a huge amount of new features again (described in this post) and is starting an additional, more trimmed down, high level API, geared more toward what designers expect. But it also comes with new documentation and error handling, the two most important things that were missing for a professional distribution.

Choosing the Right Database Abstraction by Dave Cross

Dave writes: 'A question came up recently in the Perl community asking whether, in a Mojolicious application, it’s better to use DBIx::Class or a Mojolicious-specific module like Mojo::Pg. It's an interesting question, but I think it's asking the wrong thing.'

DBIx::QuickORM - Alternative to DBIx::Class/DBIO by Chad Granum

Chad writes: 'This weekend at the perl and raku conference I did a presentation on how to move forward from the current state of DBIx::Class and its lack of new development. We discussed several options including an alternative I have been writing. I have never liked DBIx::Class, so I tried to write something that felt more intuitive to how my brain works. It was suggested that I post it here.'

Introducing constant::string and constant::string::ucby James Wright

James writes: 'If you're like me, you use a constant a lot (I may overuse it). I often use it to turn typos in words and fields into compile-time errors, and for that I usually create constants that either are the named the same as the word, or the word uppercased.'

Discussion

Introducing HTML::Composer and general musings about Perl HTML templating by Rawley Fowler

Rawley writes: 'Perl has some great templating libraries for HTML. Most of them are pretty fast, and do what you want. However, they all share a common "problem", they make me write HTML. I'm a Perl developer, I like writing Perl, I want to write Perl, so when I have to switch contexts to HTML it annoys me.' HTML::Composer is the answer.

DBIO - A DBIx::Class replacement by brian d foy

DBIO - Native relational mapping for Perl, built on DBI

Videos

Perl development using Ollama and local models Claude and VS Codeby Dmytro Lyakh

The recordings from the recent online Perl Maven session

Improving ptkdb, the graphical debugger of Perl using ChatGPTby Matthew Persico

The recordings from the recent online Perl Maven session

Perl

This week in PSC (230) | 2026-06-22

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.

The Weekly Challenge - 380by Mohammad Sajid Anwar

Welcome to a new week with a couple of fun tasks "Sum of Frequencies" and "Reverse Degree". 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.

RECAP - The Weekly Challenge - 379by Mohammad Sajid Anwar

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Reverse String" and "Armstrong Number" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

TWC379by Ali Moradi

The Blog Post by Ali provides a highly efficient and minimalist way of coding in Perl by offering solutions to the problem set of The Weekly Challenge #379. Ali uses a brilliant chop loop to reverse a string and a concisely written higher-order grep block to determine Armstrong numbers in the given base. This shows that Perl can be written very compactly but also in an extremely expressive manner.

Armstring or Strongby Arne Sommer

Arne has given us a great example of Raku's toolkit through the Weekly Challenge 379. He uses many of the Raku methods (comb, pop, base, etc.) to write very concise and effective code for both reversing a string and finding base-specific Armstrong numbers. If you want your Raku skillset to grow in terms of both abilities and syntax style, you should definitely read this.

Perl Weekly Challenge: Week 379by Jaldhar H. Vyas

This post does an excellent job of illustrating how the relationship between Perl and Raku has changed over time, and uses that to illustrate how these two languages handle identical logic with different syntaxes. It uses examples of how Perl uses the classic, reliable Perl syntax and how Raku provides its own modern, built-in methods of extracting a digit from a number with the modern feature of converting between bases instead.

There Is More Than One Way To Powerby Jorg Sommrey

This article contains a clear, consistent format outlining all parts of the challenge as well showing ingenuity in using both the Perl and J languages. The examples of different ways to reverse a string with both in-place reversal and use of PDL slicing techniques, along with the compact implementation of variable-base Armstrong numbers using a functional programming paradigm, highlight the insights and education obtained by polyglot developers from this article.

The Weekly Challenge 379by Lubos Kolouch

Lubos writing style contains excellent quality, idiomatic code and brief, easily-understood explanations of the different ways to break down difficult logical or enough to solve complicated mathematical problems, so they are accessible to all (even to those with no programming experience).

Perl Weekly Challenge 379by W Luis Mochan

W. Luis Mochan has demonstrated his expertise by providing concise code that uses very little coding space. He created very efficient single and double lines of code (Perl) for each of the weekly challenge entry solutions. The way he approached Armstrong Numbers with a dynamic array that uses rolling bases, rather than normal division to calculate base conversion points, is astoundingly creative, instructional and well documented.

Just Do It Yourself!by Matthias Muth

The professional quality of Matthias's solution to the Perl Weekly Challenge is evidenced by the exceptional level of detail. Clearly, the README describes both the underlying logic as well as the algorithms used. The actual code is very idiomatic, clean and well-structured. This represents an excellent example of good software engineering practices and is a great resource for the community to learn from.

I see strings reversed… sum numbers, too…by Packy Anderson

Packy provides some ways to think about how to tackle the Perl Weekly Challenge. His approach is well-organised and very interesting. What stands out most is how much time he spends comparing Perl, Raku, Python and Elixir implementations to help the reader understand their differences. The way he explains each solution with examples is very effective, and it provides an excellent way for programmers looking to improve their skills with strings and scripts.

Reversing and curious numbersby Peter Campbell Smith

Peter puts a high value on creating code that uses clear, easy-to-read, well-maintained, and easy-to-write code rather than using complicated, convoluted, and multifaceted configurations. This makes the blog post very accessible to all levels of developers. It contains additional detail, educational material, and information in the public domain that should be of use to the developer community. There are also multiple edge cases addressed in this blog, and a comprehensive analysis of the data will make it very easy for the reader to follow through the examples provided.

Reverse Armstrongby Roger Bell West

This blog covers Perl Weekly Challenge 379's solutions for string manipulation and narcissistic numbers in several different languages. Here, Roger, compares implementations of the same problem in Perl, Lua, PostScript, and Rust, illustrating how they each offer different approaches to performance optimisation and memory allocation. Overall, this approach allows him to provide great practical insight to readers on how the languages differ in these two areas.

Work itby Simon Green

This post presents an extremely entertaining and informative dual-language analysis of Weekly Challenge #379, as well as an entertainingly framed musical presentation. In addition, the juxtaposition of the neatness of the Python loop construct with the traditional method of manipulating strings in Perl helps provide clear, easy-to-follow solutions to challenging technical questions, particularly when dealing with the conversion of multiple digit bases for Armstrong Numbers.

Weekly collections

NICEPERL's listsby Miguel Prz

Great CPAN modules released last week.

Events

Perl development using AI (online)July 8, 2026

Paris.pm monthly meetingJuly 8, 2026

Purdue Perl Mongers (HackLafayette) - TBAJuly 8, 2026

Boston Perl Mongers virtual monthlyJuly 14, 2026

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #777 - Check your CPAN profile!

Gabor Szabo — Mon, 15 Jun 2026 06:26:09 +0000

Originally published at Perl Weekly 777

Hi there!

In the recent weeks I looked at a lot of MetaCPAN profiles (aka. author pages) such as that of MANWAR. If I could also find their LinkedIn profile I invited them to connect via LinkedIn. (If I have not sent you an invitation yet, then I guess I missed your profile. I'd be glad to get a connect request via LinkedIn.)

I noticed that a large percentage of the people still have their @cpan.org email address listed. Despite the fact that cpan.org email forwarding has been shut down 6 weeks ago. That means people will get annoyed if hey try to contact you using that address.

You could replace that address or hide it and offer other ways for people to contact you. Either of them is better than having a bad address.

In addition, I noticed that some of the links people have there are not working. (e.g. incorrect link to their LinkedIn profile, or to their home page etc.)

In order to fix these you probably first need to check and update your PAUSE account. After logging in look for the Edit Account Info menu option. There you can list your email address and you can even decide if you'd like to have a visible address or not.

Then you could take a look at your MetaCPAN profile. For this visit MetaCPAN. Login in the top-right corner. If you don't remember whether you used GitHub or Google, don't worry. Inside you can connect them in the Identities menu point. Then go to the Profile menu point and update the fields there.

Finally, if you have updated your profile after reading this, I'd be glad if you sent me an email so I'll know this messaged had some positive impact.

Oh, and if you don't have a CPAN account and you have not uploaded anything yet, then what are you waiting for?

Enjoy your week!

--
Your editor: Gabor Szabo.

Articles

Time::Str - Time Zones and Leap Seconds

Time::Str parses and formats date/time strings across 20+ standard formats, with an optional C/XS backend and nanosecond precision. The previous post, Introducing Time::Str, covered parsing and formatting. This one covers two additions, time zones and leap seconds, and ends with a note on the new C parsers. (Reddit)

Discussion

Confused about a few parts of the new Core OOP

Memory sharing between scripts

First record in implicit -n loop behaves differently than the rest. Hoping to find an explanation.

Grants

PEVANS Core Perl 5: Grant Report for May 2026

Perl

This week in PSC (228) | 2026-06-08

The Weekly Challenge

The Weekly Challenge - 378

Welcome to a new week with a couple of fun tasks "Second Largest Digit" and "Sum of Words". 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.

RECAP - The Weekly Challenge - 377

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Reverse Existence" and "Prefix Suffix" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Prefixed Existence

This article offers a great introduction to the Raku language through its implementation of the The Weekly Challenge #377, specifically the use of native Raku functions, such as .flip and .combinations. The code is well-written, typical of Raku, and fully supported with an extensive breakdown of each line of code, detailed run-time logs, and references to helpful documentation.

Perl Weekly Challenge: Week 377

The article compares Perl and Raku solutions for Week 376 of the Challenge and illustrates how the two languages are different in terms of their evolution. Specifically, it illustrates how Raku provides a more modern set of high-level features (e.g., built-in support for substrings and pairs) compared to the equivalent structural features in Perl, which require additional code to implement.

From Start to End and Back

Jorg takes a multi-paradigm approach to solving The Weekly Challenge #377 in both Perl and J (the array-processing language). This article showcases Jorg's technical knowledge because he generalises the first task from its minimum definition and well-organises the second task's input by length to optimise the process. Additionally, Jorg's complete walkthrough of the functional, tacit programming techniques found in language J is well presented, allowing for the easy comprehension of complex manipulations of Arrays and RegEx optimisations.

Perl Weekly Challenge 377

W. Luis Mochan employs the expressive capabilities of the Perl language in order to create solutions that exhibit exceptional brevity with no extra syntax or words. This will definitely capture the interest of developers looking for clean and functional solutions.

They run and hide their heads / They might as well be dead…

This post provides a great, multi-lingual breakdown of the challenge with clean idiomatic solutions in Perl, Raku, Python and Elixir. By demonstrating how each of the programming paradigms handle the same logic, Packy provides educational value beyond measure while maintaining interest with a clever Beatles-style music theme.

Strings within strings

Peter offers a refreshingly simple and useful way to accomplish this task using only Perl. He places an emphasis on keeping the code readable, ensuring UTF-8 characters can safely contain more than one byte, and maintaining a high level of performance in real-world applications. There is no ambiguity or sacrifice made in developing an easy-to-interpret solution to a hard problem and accommodating corner cases.

The Weekly Challenge - 377: Reverse Existence

In this article, Reinier discusses how to efficiently leverage Perl's string manipulation and logical checks to confirm if input strings share overlapping character sequences with the least amount of code. This article is an excellent resource for learning to write perl code that efficiently performs substring matching in a clear, idiomatic manner with minimal additional complexity.

The Weekly Challenge - 377: Prefix Suffix

Reinier made use of Perl's built-in string matching capabilities to efficiently find all pairs where one of the strings serves as both the beginning and end of one of the other strings. This showcases a great example of writing efficient, clear code to solve a complex logic problem of substring containment in as little code as possible.

A Suffix to Existence

Roger's article provides an excellent comparison between different programming languages by demonstrating how language paradigms solve the same algorithms for sliding windows and substring matches, thereby providing significant educational value to the reader by making comparisons between high-level built-in functions with manual implementations for the same problem.

Existence

In this post, Simon analysed the issue into smaller pieces/steps made it easier for implementation to remain very readable and maintainable. A strong resource for developers wishing to observe how simple, idiomatic methods can more elegantly achieve string manipulating constraints.

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Events

Perl development using AI (online)

June 17, 2026

Berlin.pm - Naumanns Biergarten

June 24, 2026

Toronto.pm - June Social Evening

June 25, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

Paris.pm monthly meeting

July 8, 2026

Purdue Perl Mongers (HackLafayette) - TBA

July 08, 2026

Boston Perl Mongers virtual monthly

July 14, 2026

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #776 - Learning Perl

Gabor Szabo — Mon, 08 Jun 2026 06:13:39 +0000

Originally published at Perl Weekly 776

Hi there,

Recently, I came across an article, The Day I Decided Never to Learn Python by Randal L. Schwartz. Well, Randal doesn't need an introduction. He took us back to 2001, the same era when I first started learning Perl in 1999. He was a major guiding force during my early programming days.

Last week, I joined a live session by Gabor focussed on FalkorDB. It was fun watching him code and talk while I sat back as a silent spectator. You can learn a lot just by watching how he approaches coding. It reminded me of many years ago when I did pair programming with him and submitted a pull request to the Dancer2 project. Those were the golden days, when I had so much energy and time. That being said, I am still actively learning Perl and discovering how to do new things with it. These concepts may not be new to everyone, but they are new to me. For example, I recently played with GraphQL for the first time, and I've also been experimenting with RAG and JSON-RPC. I have shared my recent experiments down below.

The process of learning never stops. A few days ago, I noticed an update for HTTP::Message v7.02. Since it was released by Olaf Alders, I was curious to see what had changed. It turned to be something, I hadn't realised for all these years. While I am well-acquainted with HTTP methods like GET, POST, and PUT, I didn't know "0" could actually be a valid HTTP method name if you wanted it to be. This release added support for exactly that, thanks to contributor, Karen Etheridge. Amidst all of this, I am still trying to find time for my upcoming book on DBIx::Class. I recently shared a blog post demonstrating the power of DBIC components, and I am trying my best not to lose focus.

You might find that this edition is full of my own personal posts, as there was unfortunately very little community news to report this week. Regardless, I hope you enjoy the rest of the newsletter.

--
Your editor: Mohammad Sajid Anwar.

Announcements

This week in PSC (227) | 2026-06-01

This week we were back to full strength. We have now dealt with all of the belated issues and all of the blockers. Paul will be shipping 5.43.11 very shortly. With the amount of changes we have had to merge, we will not be able to rush the .11 cycle, but we intend to start the work on the 5.44 RC early, to ensure that we can release with as little additional delay as possible.

Articles

Result Class - Components

Continue with the series post on DBIx::Class, in this post I am showing the power of DBIC components dealing with date/timestamp column.

RAG with Perl

In this post, I try to decode what RAG is and how we can implement RAG engine in Perl talking to LLM and Vector database in a docker container.

CPAN Debian Package

First time managed to build a debian package for DBIx::Class::Async with step by step instructions.

JSON-RPC with Perl

After dealing with gRPC, next in line was JSON-RPC. The motivation was to explore MCP after getting to know JSON-RPC. It turned out to be too easy demonstrate.

Mojo meets GraphQL

The post is meant for beginners as I am exploring GraphQL for the first time as well. The best part is the use of GraphiQL for building and testing the API.

DBIx::Class and GraphQL

In this post, I shared how to integrate DBIx::Class with GraphQL. Having played with GraphQL, I can say it is not for weak heart. If you are coming from REST API background then it will take some time to get your head around it. I am telling this from my personal exprience.

CPAN and GraphQL

After DBIx::Class integration with GraphQL, my immediate task was to make the process easy as it doesn't have to this complicated. In the process, I released brand new CPAN distribution: DBIx::Class::Schema::GraphQL.

CPAN

FalkorDB

Perl client module for FalkorDB. This code was mostly generated using AI tools and has not been checked manually yet.

DBIx::Class::Schema::GraphQL

It was created while working on the DBIx::Class integration with GraphQL. Using this module, it is so easy to build GraphQL API.

Grants

Maintaining Perl (Tony Cook) May 2026

Maintaining Perl 5 Core (Dave Mitchell): May 2026

The Weekly Challenge

The Weekly Challenge - 377

Welcome to a new week with a couple of fun tasks "Reverse Existence" and "Prefix Suffix". 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.

RECAP - The Weekly Challenge - 376

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Chessboard Squares" and "Doubled Words" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Doubled Chessboard

The post offers an orderly, aesthetically pleasing way of solving the Weekly Challenge problems using the modern-day features of Raku syntax. With the use of well-defined subset custom types to strongly validate input and a simple, tokenising object-oriented class structure for text processing, Arne creates a solution that is easy to read and maintain and takes care of the complex edge cases such as applying a look behind that crosses over multiple lines.

Doubled Words

Bob presents a creative solution to a challenging text processing issue by using a well known yet little used built-in feature of the Perl. The result is an elegant mechanism for bypassing tokens through a clearly documented and separated mechanism of backtracking while retaining context about the structure through the use of captured groups in the split regex.

Chess Solo

Jorg provides a very concise and mathematically elegant solution for the colorisation of a chessboard. By recognising that under mod 2 operations the coordinate bases are completely annihilated, implementations can be created in both Perl and J using only one line of code and they are both efficient and structurally minimalist.

The Weekly Challenge 376

An unusually clear yet detailed solution is provided in this blog post, as it combines clean, idiomatic code examples with short technical explanations about how to use regex to parse doubled words and how to compare two mathematical coordinates. Complex logic is presented so anyone can read easily and learn from.

Perl Weekly Challenge 376

The excellent demonstration of the capabilities of Perl as a function-based programming language is shown through this post with extremely short and idiomatic solutions. Luis Mochán has used expressive, single-line statements to convert complicated constraints into small, clean, logical data flows in an extraordinary manner with Perl.

A 1-Bit Chessboard and Fancy Separators

Matthias presents an analytical and well-defined solution to the difficulties presented by Challenge 376 through the use of well-separated parsing and formatting, clear comments on the use of regular expressions, and the submission of a clear and clean solution suitable for production.

You might think I’m crazy, but I don’t even care

A well-structured and very interesting review of Perl Weekly Challenge 376 is presented with a reference to principles from a popular culture item. Packy clearly illustrates the elegant way to process text in the real world while exhibiting outstanding technical expertise by explaining the complexity of lookahead logic and the constraints of the boundary in a way that allows for simple, idiomatic, and highly maintainable solutions.

Squares and pairs

This solution offers a very neat, simple, and mathematically pleasing method for solving the chessboard parity problem. Peter has effectively utilised the ASCII values (ord) of the column letters as well as the numeric row values to reduce a spatial coordinate problem to a quick and efficient calculation of a bitwise parity (& 1). The source code is formatted well, clearly commented, and takes advantage of the mathematics behind the solution so as to avoid unnecessary conditional barriers.

The Weekly Challenge - 376: Chessboard Squares

This post gives a very clear, well-organized, and visually intuitive representation of how to solve the programming challenge "Chessboard Squares". Explicitly laying out the grid coordinates with their appropriate color will provide an excellent foundation for developing an accurate and efficient lookup algorithm.

The Weekly Challenge #376

By using an elegant mathematical approach to the parity of squares on a chessboard, along with an incredibly efficient, single-pass regular expression, this code shows immense technical skill. The code also uses multi-line lookaheads, HTML tags, and back references, all handled by a simple subroutine (double_double_toil_and_trouble), that is suitable for use at production level.

Half a Chessboard

A general description of a previously completed task, this post shows a real-life application of code reuse. Roger created a nice, modular solution to decode coordinate mathematics (on the basis of (x+y) mod 2) by cleanly wrapping the existing helper function from the previous task. Therefore, through this implementation, he provides a concise representation of the solution and eliminates any duplicate logic.

Double chessboard

In this blog post, Simon's clever use of the bitwise XOR operator (^) as a parity check for a chess board is very creative. Additionally, he shows a well-organised and simple method of utilising re.split and list comprehensions to find the position of words while also overcoming some challenging lookahead and HTML boundary situations.

Rakudo

2026.22 Some AST Fruit

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

The corner of Gabor

A couple of entries sneaked in by Gabor.

FalkorDB client in Perl using CLI AI Agents

This is the first hour of the live coding session using AI to write Perl we had last week. (Free, registration required)

FalkorDB using Perl

This is the second hour of the live coding session using AI to write Perl we had last week. (Free, registration required)

Next: Perl development using AI

The next session in which each participant will have the opportunity to show how s/he is using AI to write Perl code. I am sure we will learn a lot from each other!

Growing Pains: Scaling AI Coding across Team and Repo Boundaries with Graham Knapp

Video recordings from the session yesterday. It is not Perl specific, but helps you understand things. For more such event, sign up to the Code Mavens Meetup group

Events

Boston Perl Mongers virtual monthly

June 9, 2026

Paris.pm monthly meeting

June 10, 2026

Purdue Perl Mongers (HackLafayette) - TBA

June 11, 2026

Perl development using AI (online)

June 17, 2026

Berlin.pm - Naumanns Biergarten

June 24, 2026

Toronto.pm - June Social Evening

June 25, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #775 - Events and using AI to write Perl

Gabor Szabo — Mon, 01 Jun 2026 06:43:21 +0000

Originally published at Perl Weekly 775

Hi there!

I try to keep track of the Perl-related events. You can find them listed at the bottom of each edition of the newsletter and on the events page on the Perl Weekly web site. There you can also find a link to embed the calendar in your calendar program. There are a number of events scheduled for this month. Most of them online, so if your time-zone permits, you can join those events. The big in-person event is at the end of the month The Perl and Raku Conference in Greenville, South Carolina, USA.

In the last couple of weeks I have been using various AI tools extensively. It still needs some hand-holding, but it already writes code that seems to be way better than the average code I've seen. So I wonder, would it be possible to ask one of the AI tools to convert Python libraries to Perl? You know, we have been complaining for many years that companies provide implementation for their SDK/API/client in several language, but not in Perl. We also saw that CPAN could not keep up with the growth of PyPI, npm and the other 3rd party library registries. So maybe some of you would like to explore the idea of converting some of these libraries to Perl using AI.

Finally a personal note, I am planning a trip to Korea and Japan in September-October. If you live there and would have any travel recommendations, I'd love to get that.

Enjoy your week!

--
Your editor: Gabor Szabo.

Articles

Introducing ZuzuScript

Toby Inkster created a programming language which blends a fairly JavaScript-like syntax with fairly Perl-like semantics, and a few other features that he hasn't really seen in many programming languages.

ANNOUNCE: Perl.Wiki V 1.47, JSTree copy V 1.21

Teaching AI About the British Monarchy with MCP

The site already exposes information through a traditional web interface and a JSON API. But those interfaces were designed for humans and developers respectively. MCP gives AI systems a much cleaner integration point.

ANNOUNCE: Perl.Wiki V 1.46 & other news

TPRC Schedule Posted - Time to Submit Lightning Talks

Discussion

Dist::Zilla::PluginBundle::Starter: Use Readme::Brief instead of Pod2Readme?

Perl eval question

Oh, the evil eval.

Perl

This week in PSC (226) | 2026-05-25

The Weekly Challenge

The Weekly Challenge - 376

Welcome to a new week with a couple of fun tasks "Chessboard Squares" and "Doubled Words". 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.

RECAP - The Weekly Challenge - 375

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Single Common Word" and "Find K-Beauty" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Common Beauty

This is an excellent example of how to use Raku's idiomatic style to perform frequency analysis with a very elegant way of using Bag data type and to make use of the %% operator for nice clean checks of divisibility by using Raku's built in primitives instead of having to write complex manual logic.

Perl Weekly Challenge: Week 375

It provides an excellent, straightforward exhibition on how to solve the problems associated with Weekly Challenge 375 in Raku and Perl. In addition to showing off some of the more sophisticated, expressive data types that Raku supports (i.e., Bag) Jaldhar shows how they were able to implement clever, easy-to-read workarounds in Perl to accomplish essentially the same thing.

Common Beauty

This blog post does a great job of examining and comparing the practical solutions using Perl and an advanced version of programming with the J language. The way Jorg has generalised the different types of problems he presented creates a sophisticated solution for someone that will accept any number of bases and/or arrays as inputs, and produces results that would be considered to be of a high standard.

Perl Weekly Challenge 375

This post shows a clear-cut way to address a problem and demonstrate a solid grasp of Perl's function-based capabilities. It uses expressive one-line Perl statements to demonstrate how small, readable, and consistent code can be written to transform data.

A Single Beauty

This is an exemplary work featuring high-quality code that has a high degree of maintainability, uses excellent error check techniques and provides high levels of readability. In addition to using excellent reading technique, his solutions include well-documented logic and complete test suites.

You’ve got to get up every morning…

Packy has created an outstanding multi-language deep dive post comparing different implementations of Raku, Perl, Python, and Elixir. In addition to providing many details about each language's implementation, his approach is to focus on making it easy to read and easy to follow the logic behind each one in spite of their technical complexities. He shows us how we can take the same data structure using different paradigms to create different implementation solutions for the same problem.

Single and beautiful

This solution exemplifies how effective algorithms can be designed, using math formulas as a way of running multiple sets of frequencies over a single array. It’s an example of a very concise method of solving complex state-tracking issues, using the least amount of code as possible while maintaining a high degree of readability.

The Weekly Challenge - 375: Single Common Word

A clear and systematically organised method for resolving this issue is provided within this post, as well as a very easy to read content style, making it simple to see the reasoning behind the solution. Among other things, this post displays a good presentation of example test cases and has a good way of providing technical explanations to both new to experienced software programmers alike.

The Weekly Challenge - 375: Find K-Beauty

This blog post exemplifies well-designed code that solves the "Find K-Beauty" problem in a strong manner. Reinier does an excellent job of providing clear, modular logic and using the least amount of code to implement those solutions. This allows the reader to see how the sliding window method works to find divisors in the number's format.

The Weekly Challenge #375

This post presents an incredibly complete and conversational analysis of the obstacles, illustrated with sophisticated technical knowledge through a thoroughly well-organised, educational format. Robbie's skill at blending solid, production-level Perl code with detailed explanation of the rationale behind it provides readers with an excellent foundation for either becoming familiarized with this form of problem solving or gaining greater depth of understanding regarding the "how" and "why" of idiomatic Perl.

Uncommon Beauty

Roger produced a very thorough, well-organised explanation of the problem, using techniques such as hash frequencies and sliding windows to create solutions that are both clean and accurate. By comparing the two different languages Perl and Scala, Roger shows that they clearly understand how to approach solving problems using multiple programming languages.

The Common Beauty

This is an excellent example of a bilingual coding approach. It contrasts high-level data structures in Python with Perl's more flexible but lower-level data manipulation. Simon offers a clear explanation of the two different languages used to explain how one would move algorithmic logic from one programming paradigm to another by providing step-by-step instructions and side-by-side examples.

Videos

JSON Schema at the Toronto Perl Mongers

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Events

Exploring Perl Modules + using AI (online)

June 3, 2026

Boston Perl Mongers virtual monthly

June 9, 2026

Paris.pm monthly meeting

June 10, 2026

Purdue Perl Mongers (HackLafayette) - TBA

June 11, 2026

Berlin.pm - Naumanns Biergarten

June 24, 2026

Toronto.pm - June Social Evening

June 25, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #774 - Perl is too HOT

Gabor Szabo — Mon, 25 May 2026 08:22:36 +0000

Originally published at Perl Weekly 774

Hi there,

I know you all are patiently waiting for the release of Perl v5.44. Recently I joined the mailing list of perl5-porters. You get all the latest update straight in your inbox. This is where I found out, the v5.44 would be out end of next month if everything goes as per the plan. I get excited during this time of the year to see what is new added to the core class feature. I am still waiting for the support of creating roles. I am also aware there are other high priority features in the list. No pressure to Paul Evans and his team, we are happy to see the progress in the language under your guidance.

Well you don't have to wait for the big release to get your hand dirty. For me, I am busy exploring things like Big O Notation, JSON Web Token (JWT), OAuth2, gRPC. There are plenty in the pipelines too.

If you are looking for something new then you should check this out, Aspire in Perl. While going through the post, I came across another gem, OpenTelemetry SDK for Perl, thanks to JJ Atria. It's going in my TODO list. One day, I will take a closer look.

Web development in Perl has seen it all since the CGI Era (1990s). First came PSGI/Plack, the middleware revolution, followed by the rise of frameworks like Catalyst, Dancer2 and Mojolicious. Dave Cross has written a very detailed post about The Long Road From CGI To Containers.

Plenty of posts this week to keep you busy all day, enjoy.

--
Your editor: Mohammad Sajid Anwar.

Announcements

TPRC is about 30 days from now!

Nearly a month from today, TPRC is happening. A quick reminder to everyone about early bird discount. If you are planning to attend TPRC then you must avail the discounts.

Articles

This week in PSC (225) | 2026-05-18

Announcement of 5.43.11 dev release is the hightlight of this week update.

The Camel Cometh

Find out the story behind the support of Perl in Aspire. It is very inspiring and honest story. I wouldn't say, I understood everything but it created an interest inside me. You must checkout yourself.

The Long Road from CGI to Containers

What a journey CGI had. The post reminds me some of my past encounters with CGI, like printing html tags inside the script. Although, it is not recommeded these days in raw form for web development, I am still one of the maintainers of CGI::Simple.

Big O Notation

This story is for all non-computer science background techie who have yet to crack the mystery of time/space complexity. I really enjoyed the journey and I am sure you will love it too.

JWT with Dancer2

JSON Web Token (JWT) is something that came up in discussion many times in the past but I never had chance to look at it in details. Last week finally I found time to get to the bottom of it. This post details how and what is it actually.

OAuth2 with Dancer2

Now OAuth2 is nothing new to many techie but I stayed away from it for so long. I found it too complex topic and kept delaying to explore. Now that I have seen it inside out, it seems like a walk in a park.

Strategy Design Pattern

Every time I talk about design patterns, I get excited like a little boy who found his favourite toy. Whenever I feel down, I pick up my book, Design Patterns in Modern Perl and read a design pattern. My all time favourite is Singleton design pattern. How about yours?

REST vs gRPC

gRPC was something I wanted to explore for a long time. In this post, I shared my investigation so far. I know, I have only scratched the surface and there are still plenty to explore.

CPAN

App::Test::Generator v0.39

Plenty of bug fixes and enhancements in this release as shared by Nigel. The Changes file list the details.

Grants

Maintaining Perl 5 Core (Dave Mitchell): April 2026

PEVANS Core Perl 5: Grant Report for April 2026

I noticed the mention of optional chaining PPC in the report. If it is what I think it is then I am super happy that it is in safe hand now. I can't wait to see the end result. Thank you Paul.

Maintaining Perl (Tony Cook) April 2026

The Weekly Challenge

The Weekly Challenge - 375

Welcome to a new week with a couple of fun tasks "Single Common Word" and "Find K-Beauty". 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.

RECAP - The Weekly Challenge - 374

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Count Vowel" and "Largest Same-digits Number" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Largest Vowel

This is an excellent post describing a different way of using Raku. It demonstrates the effectiveness of Raku by utilising such features as 'gather/take' and powerful sequence grouping to make complex string processing simpler than ever before. In addition to being a great way to learn about Raku, this post is also an opportunity for developers to see how the author has reused existing code to produce a clean, modular program.

All Vowels Are Equal

The post demonstrates an extremely sophisticated work to the challenge. It uses advanced Perl's regex features, look-ahead assertions and the (?{...}) code block.

The Weekly Challenge 374

The code provided is a highly legible and clear way of handling the challenge resolution process, making use of commonly used data structures to simplify complex string processing tasks. It is very pleasing to see this clean, parallelised logic presented in both Perl and Python, which helps improve the maintainability of the two codes and provides a great deal of educational value as well.

Perl Weekly Challenge 374

This fantastic example on how to reduce large scale problems into highly efficient solutions using half-lines of codes, showcases Perl’s ability to allow us to write complex, yet very succinct, solutions of difficult problems. It also serves as a great example of how to use regex backreference in a creative way, using regular expressions to locate and manage repeating patterns while minimising the amount of code required.

Hey, won’t you play…

This post showcases some great, multi-lingual solutions to this week's challenge by providing clean and idiomatic code examples in Perl, Raku, Python, and Elixir. Packy explains the thought process and the differences between lookaheads in regular expressions. This makes the article a great teaching tool for discovering how various languages solve equivalent algorithm problems.

Lots of repetition

Peter provides a well-reasoned and pragmatic assessment of the problem at hand and presents readable, non-complex code. He broke up all vowel characters in the string into separate chunks prior to applying a sub-substring check which provides an excellent example of performance optimisation by successfully processing very long strings with a relatively low number of vowels in that string to produce an acceptable processing time.

The Weekly Challenge - 374: Count Vowel

This post takes an insightful and interesting view of the vowel-counting challenge by making an interesting analogy of programming logic and music theory from the 18th century. The "Prefix/Cell/Suffix" model is a unique and clear technical explanation of the 'use of bitmasks for tracking vowel completion', making the bitmask solution to this challenge feel elegant and well thought out.

The Weekly Challenge - 374: Largest Same-digits Number

In this post, you'll find a brief yet highly efficient method of solving the "Largest Same-digits Number" challenge. The method relies on a single-pass regular expression as an elegant means to perform pattern matching with maximum effectiveness, and exemplifies good understanding of the high performance features of Perl.

The Largest Count

The post show how to solve problems using both Rust and Perl languages. It also demonstrates how one can take advantage of the strengths of each language (type-safe collections in Rust vs concise string searches in Perl) to carry out the tasks, but do so efficiently.

Vowels and numbers

The post explains the need to clearly specify the task requirements for the "Largest Same-digit Number" challenge. It shows that an ambiguous requirement has caused different solutions to develop and serves to remind us that "coding to the examples" can be just as important as "coding to the original problem description."

Rakudo

2026.20 Slangification

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Events

Toronto.pm - online - JSON Schema: language-agnostic typing / May TPM meeting

May 29, 2026

Exploring Perl Modules + using AI

June 3, 2026

Boston Perl Mongers virtual monthly

June 9, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #773 - The perl-tester Docker image

Gabor Szabo — Mon, 18 May 2026 07:25:58 +0000

Originally published at Perl Weekly 773

Hi there!

Recently there were a number of days that the perl-tester Docker image did not build properly. It is always a bit of an issue with it, because there quite a few moving parts. Parts where the dependency isn't fixed. e.g. in most of the cases it installs the most recent version of the modules from CPAN. Which mean any release of any module might break the whole build process. This time, however, the source of the problem was the new release of App::cpm, the tool used to install the CPAN modules. As often the case the new release was intended to improve things: cpm v1: making installs stable, but it broke the build on some of the older versions of Perl just by increasing the minimum version of Perl required.

One solution would be to fix all the dependencies, both tooling and the modules we install, but then someone would need to keep track of changes (the way dependabot does) which is probably way too much work for the few people who contribute to this project. The other solution might be to create an easy way to see what changed between the last successful build and the current failing build. We have started to work on a tool that will help with that. It will also allow us to show exactly what is in every image. BTW If you have spare stars in your pocket, it would be nice if you gave one to the docker-perl-tester project.

A couple of days ago I started to play with FalkorDB, an Open Source Graph Database. I already gave a presentation in Hebrew on how to use in general and specifically in Python. In a couple of hours I am going to give another one - this time in English - an intro to GraphDB. I'll use Rust for the programatic examples. It seems there is no client for it in Perl so it might be an interesting project to build one. The one in Python uses the Redis module for connectivity so I looked at the options to use Redis in Perl. MetaCPAN showed the Redis module as the first hit. Unfortunately that module did not have a commit for 3 years and there are many outstanding Issues and even PRs. So I posted about it both in the Perl Maven WhatsApp group and in the Telegram channel. Within seconds I was pointed towards Mojo::Redis and Redis::XS as alternatives.

Online Events: If you are in an American time-zone then both the Boston Perl Mongers and the Toronto Perl Mongers have semi-regular online meetings in your evening hours with various interesting speakers. If you are in the European time-zones or you don't mind having a meeting in your morning hours in the Americas, then there is the Perl Maven group where it is mostly me giving a presentation or working on some code. For details check out the Perl Weekly events page.

Enjoy your week!

--
Your editor: Gabor Szabo.

Announcements

cpan.org email forwarding has been shut down

The Perl NOC team has shut down the forwarding of email to the cpan addresses. If you are a CPAN author, please make sure MetaCPAN displays ways to contact you. (link to the source git repository of your projects, a LinkedIn account, an email address, etc.)

Articles

cpm v1: making installs stable

I rarely include articles from Medium as most of them are spam, but this one is real. So here you are!

Is your account on blogs.perl.org registered with an @cpan.org email address?

Installing Bit::Vector on Debian 13 (Trixie)

It is good that this information can be found on a public blog post, but IMHO it would be event better if this was part of the README or the documentation of the project.

My Journey with Devel::ptkdb - Origins

Enabling AddressSanitizer (ASan) in Makefile.PL for Linux Environments

Introducing Time::Str

At first I was wondering why this new module when DateTime provides all the features, but then I read on and there are a few reasons. Interesting.

Discussion

Optional stricter normalization of raw ISBN input

An issue that gives an opportunity for you to share your thoughts.

Why does a call to `ref` on a reference to 'substr' produce 'LVALUE'?

Perl

This week in PSC (224) | 2026-05-11

The Weekly Challenge

The Weekly Challenge - 374

Welcome to a new week with a couple of fun tasks "Count Vowel" and "Largest Same-digits Number". 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.

RECAP - The Weekly Challenge - 373

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Equal List" and "List Division" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Perl Weekly Challenge 373: Equal List

The clean, logical structure of Abigail's detailed technical analysis provides a very clear and rational basis for how best to apply mathematical theory to practical use. With a focus on optimising the algorithmic complexity rather than executing a brute force approach, Abigail delivers an incredibly efficient solution to this problem that will be valuable to all developers who wish to create highly efficient solutions to their problems.

Perl Weekly Challenge 373: List Division

Abigail's solution to the list partitioning problem is a beautifully crafted and idiomatic implementation that completely avoids the cumbersome index-tracking that traditional loop-based implementations require. The implementation is easy to read and is highly efficient because it leans heavily on the mechanics of the underlying language. This illustrates how an effective structural data transformation paradigm can result in simpler implementations.

List the List

Through a demonstration using gather and take in conjunction with native array splicing Arne demonstrates Raku's capabilities and gives a simple way to distribute remaining list offsets without having to rely on complex nested loops or overhead due to atypical index calculations. The result is a functional representation showing how Raku can eliminate complications associated with the partitioning of structural data, creating an intuitive self-documenting pattern.

Let's Dance to List Division

Bob has produced a superbly developer-oriented analysis addressing the pragmatic aspects of designing APIs using Perl's 'flat' argument list mechanism. Bob's approach to using array references in conjunction with a dual-while-loop, which uses 'destructive splice' calls to divide the input data into well-balanced partitions, enables this entire operation to occur without requiring any complex index-tracking cognitive load.

Divide and Concat

Jorg has provided a mathematically accurate and highly precise solution that demonstrates command of Perl's multidimensional array manipulation and list processing capabilities. The solution has been designed with a heavy emphasis on reducing iteration overhead, and uses a clean and logical approach to conditional checking. Overall, the implementation is an efficient way to manage data structures for all of the tasks required to complete this project.

Perl Weekly Challenge 373

W. Luis Mochan gives an interesting, very mathematical view of the difficulties and has elevated the difficulty of the tasks by discussing the different ways each of these tasks can be solved through their mathematical representations. The way the solution uses Perl Data Language is unique in its creativity and clearly shows how matrix operations and vector operations can be applied in a different manner to solve an algorithmic process much more efficiently and faster than typical procedural methods. This is a remarkable, challenging read, demonstrating the way that thinking in terms of vectors alone can change the way standard procedure of manipulating data can be made into a high level, abstract manner.

Because your list, your list I can’t resist

Packy offers a unique perspective on the challenge by framing the approach through an interesting musical context, followed by a really clean, multilingual show-off with a few different language options. As a polyglot expert, Packy's write-up shows a number of idiomatic and clean ways to solve problems in both Perl and Elixir. The solutions have been complimented for their clear structure, readable transformations of data, and the highly contrasting ways in which they use the procedural power of Perl with the functional, pipeline-based elegance of Elixir.

The week of lists

This paragraph describes the outstanding quality of Peter's work in executing his weekly assignments and projects using clear and detailed methods. He concentrates on providing clear and easy to understand explanations of all aspects of the problem using very pragmatic solutions with less complex algorithms than would be required to complete this task, and thus have produced solutions with low run times and high readability. Another benefit of using this strategy is that it will have produced many examples of good clean and maintainable code, as well as simple Perl code showing how to accomplish structural validation without additional runtime cost.

The Weekly Challenge - 373: Equal List

The analysis that Reinier provided on this challenge is truly impressive due to the systematic approach used to cover edges and validate input. The solution makes a great balance between how computer efficient it is to run while at the same time being easy to scan through for code due to well-named variables and clearly defined logical conditions. This is a great resource for developers looking to implement defensive programming and build highly maintainable systems.

The Weekly Challenge - 373: List Division

Reinier has presented a very clear and logical way to solve the list partitioning problem through clarity in procedural programming and appropriately managing data through effective use of algorithms. The implemented solution is easy to follow, with simple looping structures and clearly defined conditions used to divide the collection according to specification without introducing complexity into the underlying architecture. This solution is a perfect example of pragmatic programming, where simplicity, maintainability, and consistency take precedence over unnecessary abstraction.

The Weekly Challenge #373

The analysis provided by Robbie consists of an analysis of the weekly problems and an an idea of what you'd have to do. The breakdown of the problems will be thoroughly examined and will include thorough analysis of all the constraints on the solution as well as a commitment to validate input sufficiently to account for any and all edge cases and to deal with them accordingly. The combination of cleanly structured idiomatic programming style (including the use of loops) with clear and explicit comments that explain the logic behind the programming additions and modifications, make this a great reference source for new and experienced programmers to use.

There Is No Equality Without Division

Roger performs a beautiful and tidy example of modern solutions to solving problems through example in different programming languages and paradigms. The two different types of tasks, structural validation and partitioning, have been broken down into separate clear logical blocks that allow for high readability of solutions and the use of commonly used data structures without the use of complex loops. The write-up contains an excellent comparison of the different language features that reduce index-tracking overhead while still providing optimal run-time efficiency and successfully illustrates how functional programming techniques can be used successfully with non-functional programming techniques.

Joining and splitting lists

Simon has presented an impressively logical and practical polyglot demonstration that compares the elegant way of handling the first task in Python to how it is done through direct translations into Perl. The first task's solution is particularly notable for its concise efficiency and consists of a great, simply written one-liner using native methods to join strings and performing a direct comparison to form the structure of the list being checked. In the second task, Simon has shown a brilliant method for diving an array into equal components by taking advantage of the mathematical operation called divmod or remainder and relying on destructive splice operations to divide the arrays evenly without creating any overhead from having to manage cumbersome index numbers.

Videos

Parsing Perl Without Perl - A Rust LSP for Perl 5

A presentation by Steven Zimmerman, CPA, at the online event of the Toronto Perl Monger

Acting Out With Claude: MCPs in Perl

A presentation by Steven Lembark, at the online event of the Toronto Perl Monger

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Events

Exploring Perl Modules

May 20, 2026

Toronto.pm - online - JSON Schema: language-agnostic typing / May TPM meeting

May 29, 2026

Boston Perl Mongers virtual monthly

June 9, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #772 - PTS 2025

Gabor Szabo — Mon, 11 May 2026 08:04:22 +0000

Originally published at Perl Weekly 772

Hi there,

The Perl Toolchain Summit 2026 held in Vienna from 23rd - 26th April. I almost forgotton about it, until I read the blog post by Philippe Bruhat. It was refreshing to see the group met and continued the great work. First post event report was shared by Thomas Klausner. The event report gave a detailed insights what happend during the 4-days event. I was hoping to see more such event report from other attendees. Luckily, we had few more to keep you busy by Timothy Legge, Leo Lapworth, Thibault Duponchelle, Shawn Sorichetti, and Paul Johnson. There was even a group photo shared by Paul. I am looking for an update on my personal favourite project MetaCPAN led by Olaf Alders.

Happy to see, Stats::LikeR, which provides R statistical functions. I wish it was available few years ago. I was approached by a research student of an Australian university few years ago asking for help with his Perl script doing R's equivalent function in Perl. Fortunately we did it and paper was accepted in the end. I was surprised by his choice of language for his research paper. He could have easily used R rather than creating equivalent function in Perl. He was well versed with R as well, still he choose Perl, whilst learning the language.

Please watch the recent page on MetaCPAN for such cool modules. Enjoy rest of the newsletter.

--
Your editor: Mohammad Sajid Anwar.

Articles

DBIx::Class::Async - Oracle Database

This post I shared about the proof of support for Oracle in DBIx::Class::Async. It is always assuring the async operations with Oracle database.

Signing CPAN Releases with SigStore

Timothy Legge describes a contemporary way of achieving security in the Perl ecosystem with the implementation of Sigstore to sign CPAN Releases. This post describes how we will transition from using traditional GPG signatures to shorter and easier to obtain certificates, while providing a clear roadmap to assist maintainers (and others) in adopting "keyless" signing and enhancing supply chain security.

DBIx::Class - Schema Class (Part 2)

This is part 2 of the series post about DBIx Schema Class. In this post, I shared how we can configure session on the fly and trap exception globally.

DBIx::Class - Schema Class (Part 3)

In the third part of the series, I discussed the use of DBIx::Class::Schema::Config and how we can securely manage database credentials.

Beautiful Perl feature: low-precedence boolean operators 'and', 'or'

The elegant usefulness of Perl's low-precedence boolean operators (and, or, not) compared to the more common high-precedence operators (&&, ||, !) is further explored by Laurent. The post shows how the low-precedence boolean operator can be used as a "control flow tool" creating readable, idiomatic code using the example of the classic "do or die" convention.

Explain act

In this post, I introduced the workflow automation tool, act. It gives hands-on tutorial on the subject.

Ideas for the CPAN Meta v3 Specification

Improvements to how developers will be able to manage their dependencies and the tools that they use for building them is the goal of several forward-thinking updates proposed by Robert Rothenberg to the CPAN Meta Spec v3. His blog post includes recommendations for enhancements to provide developers with standardised, enhanced requirements for their "develop" phase, as well as improved ways to specify what hardware or operating system a developer's distribution requires to successfully run.

Discussion

This week in PSC (223) | 2026-05-04

A brief report from the Perl Steering Council has provided us with an update about their most recent triage session. Among several small changes and the completion of various CPAN dual-life module updates, one of the major highlights of this update is that there are currently no release blockers.

CPAN

GTC 2.1 go pro

The GTC (Graphics::Toolkit::Color) project has been going well according to Herbert Breunung's progress report on it, including the Go-Pro initiative for professional grade stability. The update on the 2.1 release completed a more efficient API, reducing the amount of work involved in creating colors or generating palettes, and successfully built on a solid foundation for future integration into GUI's and plotting applications.

The Weekly Challenge

The Weekly Challenge - 373

Welcome to a new week with a couple of fun tasks "Equal List" and "List Division". 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.

RECAP - The Weekly Challenge - 372

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Rearrange Spaces" and "Largest Substring" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Spaces at Large

Arne Sommer takes a close look at the nuances of whitespace in Raku, especially in relation to how the context of either string or array can affect whitespace. This post provides a practical investigation into how to handle whitespace effectively. Examples of how Raku's syntactical flexibility will allow for clean, expressive code to be written around more complex data structures have been provided.

Perl Weekly Challenge: Week 372

Jaldhar demonstrates the unique strengths of each language, contrasting Perl’s efficient hash-based counting with Raku’s expressive built-ins to solve these algorithmic puzzles.

Regular Sub-Gaps

In this post, Jorg Sommrey provides an in-depth overview of his approaches to each of the two tasks for this week's challenge. He demonstrates that it is possible to write relatively short and very readable code by using List::Util and idiomatic hash slicing. He also shows how these techniques easily handle edge cases such as the case insensitivity of the frequency count of words.

Perl Weekly Challenge 372

Mochan takes a higher-level look at Rearrange Spaces by breaking down an input string into an array and then using the tr/// operator to determine how many elements are in the array before performing some arithmetic to calculate how many spaces need to be added. The x operator and join are both used to construct the output from the individual elements. For the solution to Largest Substring, Mochan uses a hash data structure to remember the first time each character appears in the input string so that he can keep track of the longest substring while going through the input string using an index. He also updates his maximum substring variable each time he sees a character he's previously encountered.

Very Stringish

Matthias Muth offers straightforward, modernly written Perl code using the new v5.40 features of Perl’s builtin::indexed to track the position of all characters in Finding Largest Substring so as to find the maximum length substring in the most efficient manner possible.

Empty Substrings and Empty Spaces

In his blog post, Packy Anderson focuses on the edge cases for each of the challenges and provides solid solutions in Perl, Raku, Python and Elixir. He also explains the logic of his "Rearrange Spaces" solution with exact math for distributing spaces between words, as well as a clever method for handling the -1 requirement for unique characters in his "Largest Substring" solution.

Strings of strings

Peter has given two stylish implementations of the weekly challenge using Perl's native string functions to produce very compact code. For Rearrange Spaces he worked out precisely what gaps were needed to recreate the string using join, and for the Largest Substring solution he had one loop with a hash to keep track of where each character was seen first so that the answer was determined with one cycle through the original string.

The Weekly Challenge - 372: Rearrange Spaces

Reinier presents a straightforward solution with his algorithmic method to achieve a successful outcome on this week's "Rearranging Spaces". This is done in Perl primarily because of its preciseness regarding how many spaces to be distributed across the gaps between the words and determining how many of the combined gaps will result in an even distribution. This post emphasizes on a well-structured plan, such as separating the words from one another using split, and then joining them back together with join and the x operator.

The Weekly Challenge - 372: Largest Substring

Reinier had a methodical solution written in Perl for Weekly Challenge task of finding the largest substring. He used a hash to track the first instance of each character encountered when traversing the string. When he finds two identical characters, he determines their distance by subtracting the first instance's index from the second instance's index, and keeping track of the maximum value found up to that point; if he doesn't find duplicates then he will return -1.

The Weekly Challenge #372

Robbie gives in-depth solutions to the problem, providing excellent input handling as well as clarity in logic. When working with Rearranging Spaces, he uses a regex to identify the count of spaces & words, ensuring the math for gap size calculations & remainders are correct. For example, with regards to one word, he handles it just like the rest (edge cases). In terms of solving the problems of Largest Substring, he uses an array to save the first and last seen indexes of each character as he iterates through the character set of the input string making a distance calculation between these saved locations to determine the largest distance. The solutions are both mathematically correct and easily understood.

Space is the Largest Place

For Rearrange Spaces, Roger considers how to find the gap sizes through integer division and then uses the modulus operator for trailing spaces. He ensures that his logic from each of his implementations remains consistent. In the case of Largest Substring, he uses a "first-seen" hash to improve performance by only traversing through the string one time. He shows us, in his post, an engineering-oriented coding style while also documenting that these algorithmic patterns are transferable to working with dynamic languages.

Distant spaces

In Finding the Largest Substring, Simon created a dictionary in Python and hash in Perl to store the first occurrence of each of the letters in the string. Once this was done, he proceeded through the entire string to compare the current index to the index where the letter was first stored; this enabled him to efficiently track the maximum distance between the first occurrence and the current occurrence. It clearly illustrate that string manipulation and data structures are accomplished using virtually the same logical steps in each of these two programming languages.

Rakudo

2026.18 Star Wars Day

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Event reports

Perl Toolchain Summit 2026 - Vienna

According to Timothy Legge, there was an effective meeting; the purpose of this summit was to develop the CPAN Security Group (CPANSec) into a CVE Numbering Authority and improve the security disclosure process for maintainers of CPAN modules. An example of a technical outcome resulting from the summit was the inclusion of signature function support in the distribution of Crypt::OpenSSL::RSA as well as the decision to deprecate Module::Signature in favour of more modern integrity checks.

PTS 2026

Leo Lapworth highlights the 2026 Perl Toolchain Summit by describing some of the major sponsorships that made it possible. He also discusses his own efforts to modernize the MetaCPAN infrastructure and the value of in-person collaboration for solving problems with other core developers.

The Perl Toolchain Summit 2026

In this blog post, Paul Johnson provides his impressions of an intense and productive Perl Toolchain Summit 2026 held in Vienna, and highlights progress made in both Devel::Cover version 2.00 and on integrating with MetaCPAN.

My Perl Toolchain Summit 2026

Thibault’s PTS 2026 report features a heavy lift on Test::Smoke releases and CPAN security hardening. His post offers a deep dive into the technical vetting of YAML payloads and the successful launch of cpm v1.0.

PTS 2026: What Actually Happened

Shawn recaps the PTS 2026 focus on infrastructure, detailing the migration of MetaCPAN services to Kubernetes and enhanced secret management. It’s a grounded look at the high-stakes maintenance work that powers the Perl ecosystem.

Events

Boston Perl Mongers virtual monthly

May 12, 2026

Exploring Perl Modules

May 20, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #771 - Exploring Perl Modules

Gabor Szabo — Mon, 04 May 2026 12:39:07 +0000

Originally published at Perl Weekly 771

Hi there,

I put the 'Testing in Perl' course on hold for now. Instead of that we are going to explore the use of some of the mocking libraries we saw during the course. In the next session we'll pick one of the Perl modules used for mocking and we'll look for modules that use it. We'll try to understand how it is being used and we'll try to contribute something to at least one of the modules.

For background you can check the OSDC Perl page where we have a listing of modules for 'Code reading'.

You can also watch the recording of the Testing in Perl course. (Registration required but these videos are currently free of charge.)

Enjoy your week!

--
Your editor: Gabor Szabo.

Articles

ANNOUNCE: Perl.Wiki V 1.45 etc

TPRC Announces Post Conference Class

Steven Lembark is presenting: Teaching AI New Tricks: Perly MCP's for Claude.

Who tests the tester? Me !!!

I was just showing the participants of the 'Testing in Perl' course how to write and test a Test::* module. It is nice to see that about the same time Lichtkind wrote an article about the same topic.

Reading CPAN Testers Reports Using AI Agents

A very interesting and useful use of AI.

Discussion

sending matrix messages

Module naming vs CPAN conventions

Perl in Ubuntu 26-04 LTS (vs 24-04 LTS)

Some Perl modules need a dev package to be installed using 'apt'.

The Weekly Challenge

The Weekly Challenge - 372

Welcome to a new week with a couple of fun tasks "Rearrange Spaces" and "Largest Substring". 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.

RECAP - The Weekly Challenge - 371

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Missing Letter" and "Subset Equilibrium" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Perl Weekly Challenge 371: Missing Letter

Abigail gives us an efficient solution, O(n), to the missing letter problem by determining the difference between the sum of all letters in a full range of letters and the sum of the letters in the given array. This eliminates unnecessary loops, which is a big advantage over an iterative search.

Perl Weekly Challenge 371: Subset Equilibrium

This solution is a well-organised that defines the NP-complete status of this problem and also implements an efficient bitmasking solution in numerous programming languages (e.g., Perl, Python, AWK, C, etc.) and serves as an excellent reference for other programmers to learn about and use for comparison purposes.

Missing Equilibrium

The Raku Solution implements this approach using combinations to easily create subsets in an idiomatic and very readable way. It also provides an elegant way of compensating for zero-based indices when calculating the sum of the positions in each subset by the calculated subsets.

Subset Equilibrium (Just nod if you can hear me)

Bob addressed the exponential number of complex solutions from the outset and provided a practical implementation based on Algorithm::Combinatorics. The use of a positional-based iterator with zero-index compensation allowed him to effectively handle the off-by-one requirement. In addition to that, Bob supplied practical testing strategies using the Test2::Tools::Compare package.

Perl Weekly Challenge: Week 371

This solution gives a clean, efficient implementation that fulfills both the requirement of a proper subset and utilising 1-based indexing by adding + @combo.elems to the index sum. By making use of combinations from Algorithm::Combinatorics in Perl (and using built-in combinations in Raku), only the necessary subset sizes are generated; the output formatting handles both the non-empty and empty result cases in a very clean manner via a clear ternary expression.

Missing Equilibria

This new solution offers an evaluation of the subset equilibrium problem that is a new and interesting technical perspective and acknowledges the shared views of the two demonstrated examples, while not overlooking those cases where the two may have disagreement along the edges of each set of criteria. The Perl code produced using Math::Prime::Util::forcomb and List::Gather is exceptionally simple but has an artistic style as well.

Perl Weekly Challenge 371

The post describes a simple yet effective way to generate all proper subsets of a set. It uses the subset function of the Algorithm::Combinatorics module to create all proper subsets, and then filters them based on a very concise expression written as a single line. The script contains both a command-line version for easy use and a complete version that includes error handling and has been thoroughly tested.

The Missing Equilibrium

By mathematically restructuring the main condition in the problem, i.e. equality of the total values for elements and their corresponding indices. Additionally, utilising the combination iterators from Algorithm::Combinatorics with subset sizes of 2 through n-1 provides a memory efficient approach to solving this exponential complexity problem while utilizing an optimally prepared array of pre-computed offsets, or at least the offsets for an individual index, gives evidence of thoughtful programming.

My subset is-a missing a letter…

The solution has a nice, clean, multi-language implementation (Raku, Perl, Python, Elixir) and uses indexed pairs of values to keep track of the relationship between the two elements and the index position of the two elements, thus having no off-by-one errors. The solution meets the "proper subset" constraints by filtering out empty sets, singletons, and the full set as well as providing lots of detail in verbose output to help educate the user by giving exact values and sums of values for each match.

Solve the question and balance the subset

By using established neighboring letter pairs, the algorithm determines the steps $a and $b in an efficient manner by deducing which are the next alternately patterned letter combinations in relation to each of the five positions for question marks. The entire algorithm utilises a single conditional expression to account for all five possible question mark positions. Additionally, the use of the modulus operator and the mapping of the patterning logic from the analysis to the assignment of steps makes this implementation both very efficient and very easy to read.

The Weekly Challenge - 371: Missing Value

This solution requires formalization of the detection of repeating patterns through a comprehensive and well-documented approach by treating them as a repeating two-stage model (i.e., d1 = d3 and d2 = d4). Special consideration is given to both constant and alternating sequences. The use of defined-or (i.e., //=) to unify step values, along with the straightforward relationship between each possible question mark position and its simple arithmetic reconstruction, contributes to creating a code that is highly reliable and easy to follow. Additionally, the thorough input validation provided demonstrates significant consideration for actually implementing in a real world scenario.

The Weekly Challenge - 371: Subset Equilibrium

This document includes an excellent comparison of two CPAN modules (Algorithm::Combinatorics and Data::PowerSet) that correctly identifies the combinatorically generated subsets by size (2 to n) are more efficient than generating the power set and filtering out the subsets to produce the same result for this specific task. The code base is very clean and well-structured; it also does a great job of utilising list slicing (@nums[@$subset]) and map to convert from 0-based to 1-based position, while making use of the helper function print_result to ensure that all output for all test cases is consistent and easy to read.

The Weekly Challenge #371

This document offers an innovative and realistic perspective on the subset equilibrium issue by acknowledging there is no "smart" optimisation to the subset equilibrium solution and then using a simple combination-based search on the two to n-1 sizes. The solution was implemented correctly with a summation on 1-indexed values for each of those combinations.

Missing Equilibrium

Roger demonstrates a very clever way of optimizing the solution through the precomputation of one list of differences so that only the check for the sum of the selected differences equals zero must occur, which substantially reduces the amount of computing needed within the combinatorial loops. Roger does a great job of providing a perspective of how to write this in many programming languages (Raku, Kotlin, Crystal, etc.) and provides many practical examples (like sorting the list to create a consistent order for output), thereby making this solution efficient and easily transferable across many different programming languages.

Question the bits

Using bit manipulation, this solution works well to create all combinations of subsets by iterating through all integers from 1 to 2^n-2, thus avoiding the empty and full subsets. The inner loop adds pos+1 because the indices in a array have a base index of 1, while the implementation does not require any third-party modules, making it portable and easy to use for individuals who are already comfortable using bit mask manipulation.

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Event reports

Welcome to the Perl Toolchain Summit 2026!

That's how it started

Perl Toolchain Summit in Vienna

A little review by the local orga.

Events

Exploring Perl Modules

May 7, 2026

Boston Perl Mongers virtual monthly

May 12, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #770 - Yet Another Test Harness

Gabor Szabo — Mon, 27 Apr 2026 07:05:43 +0000

Originally published at Perl Weekly 770

Hi there,

I like to believe that I belong to the old school of testing i.e. Test::More. That being said, every now and then I come across a magical test workflow. One of them is App::Yath. The biggest and pleasant surprise is that both were presented by none other than Chad Granum. Although I love the idea, I find it hard to adapt to it. I have to force myself otherwise it won't happen. I wrote a short blog post as a reminder to myself while working on this editorial. I can refer to it next time I am changing existing code or adding new code.

Speaking of testing, Herbert Breunung shared a blog post explaining how Test::Builder helped him create his own test suite. This reminded me how I did exactly that in 2010 to create Test::Map::Tube for my routing framework, Map::Tube. It makes me feel quite old now!

Enjoy rest of the newsletter.

--
Your editor: Mohammad Sajid Anwar.

Announcements

The London Perl and Raku Workshop 2026

Just a heads up: The next LPW is planned to be in November 2026.

PPC Summer 2026 - Call for Participation!

Brett Estrade, who is a member of the Perl Community Conference (PPC) organising committee, has released a call for participants for the Summer 2026 PPC. He notes the group's success in the areas of scientific research and community building through the use of independent Perl conferences and asks for speakers to submit proposals to present their work via the Papercall system to help keep the momentum going.

Articles

Who tests the tester? Me !!!

In the article, Lichtkind shows how to apply the Test::Builder::Tester module to check your own test functions for correctness. He shares real-life example of using the is_tuple() function that he has developed to aid in creating a test for the GTC project.

This week in PSC (222) | 2026-04-25

Ihe Perl Steering Council got together at the 2026 Perl Toolchain Summit (Vienna). During this meeting, the group discussed the current status of Perl 5.44. Most blockers have been resolved and EOL workflow has been put in place. Finalisation of details for the next stable release is currently taking place.

Importance of Repositories in Public

In this blog post, Mikko argues that keeping project repositories publicly accessible is an important practice even when no new contributions are anticipated. Having a project public on GitHub preserves historical context, serves as an example of quality work for others, and provides a source of useful data for the open-source community.

AI as a Chance - Opinion

In this article PetaMem discussed how through AI we will have access to new ways to enhance our creative processes (as opposed to replacing them), through developing a partnership with AI; allowing developers and creators alike use the technology of AI to automate repetitive processes and create opportunities for problems to be solved and new ideas developed through creative innovation.

Discussion

AI Contributions to CPAN: The Copyright Question

In his article, Todd explores some of the legal issues surrounding code that is generated by AI and available through CPAN, and whether or not these AI-generated contributions are eligible for copyright protection and/or a legal license. He also cautions maintainers about the use of black box LLMs, which do not make public their training data, and encourages the Perl community to develop guidelines for the proper protection of the Perl software ecosystem from future disputes arising from improper use of code generated by LLMs.

Web

Use Your Powers Only for Good, Clark

Dave dissects a really good looking SPAM email made by an AI LLM to show us all how the world will look in future with AI created outreach. Even though the spam had accurately scraped Dave's background and book titles, Dave believes that this creates the illusion of understanding but does not demonstrate the LLM has any real knowledge of either Dave's values or business model. Dave further states that this type of outreach is now cheaper and easier than ever though the deployment of AI to create large amounts of unsolicited SPAM.

The Weekly Challenge

The Weekly Challenge - 371

Welcome to a new week with a couple of fun tasks "Missing Letter" and "Subset Equilibrium". 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.

RECAP - The Weekly Challenge - 370

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Popular Word" and "Scramble String" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Perl Weekly Challenge 370: Popular Word

Abigail offers a superb example of processing text for the "Popular Word" task using the ability of Perl's regex engine to process words without considering case and complex punctuation marks. This solution is unique because it demonstrates a high-performance solution for filtering out banned words while maintaining concise and easily readable code.

Perl Weekly Challenge 370: Scramble String

Abigail used a clever recursive method to take on the challenge of the "Scramble String" problem. The use of clear base cases and logic to explore possible points to split and swap all contribute to the final solution being an excellent example of how to solve complex problems with string transformations, using a valid solution and providing a framework that can be used to solve other complex problems involving string transformations.

Popular Scramble

Arne's experience in comparing Raku's expressive power vs. Perl with respect to the solutions of these two challenges are at the heart of this review. He also demonstrates how to use Raku's built-in Bag and Any types to simplify complex logic with clean, idiomatic code. This article is a great reference for developers who want to learn how to use modern functional programming patterns effectively.

PWC 370 Scramble On, Scramblin' Man

Bob has created a detailed breakdown of the Scramble String problem, looking at the need to use memoisation to avoid redundantly calculating recursive algorithms. Bob has developed a very clearly constructed solution to the Scramble String problem using test-first development which is a perfect demonstration of how to keep performance and readability on complex branching logic.

Perl Weekly Challenge: Week 370

In this article, there is a thorough comparison made between two languages: Perl and Raku. The many modern capabilities of Raku, such as having a Bag data structure and being natively supportive of methods for manipulating strings, resulted in solving the stated problem while producing significantly less code than what is generated by using Perl to do the same thing.

Scrambled Bans

Jörg has concentrated his efforts solely on providing a high quality Perl solution to this challenge. The way he solves "Scramble String" is especially impressive because he uses a recursive solution that processes challenging partitioning and swapping of strings, using clean and idiomatic Perl programming.

Perl Weekly Challenge 370

W. Luis Mochán offers a mathematically rigorous and elegant take on Challenge 370 using Perl. For Task 1, he utilises a compact approach by normalising the input with lc and regex, then applying a frequency count. His review is particularly positive about the clarity and efficiency of using a single hash to filter out banned words while identifying the maximum frequency in one pass. For Task 2, he implements a recursive solution and highlights the technical necessity of caching results to avoid the exponential growth of possibilities in longer strings.

Scrambling Back and Forth

Matthias's submission for Task 1, he has used a concise and efficient one-liner with List::UtilsBy::max_by to count how many times words appear and in doing so stores a reference to the 'most popular' result while processing all results in a single pass. With respect to Task 2, Matthias did not limit himself to performing a simple recursive search as in previous weeks; however, he developed a Reverse Scramble algorithm, which is performing this task as a sequence of sorting in which strings become indexes of streaks representing their sorted order to allow for efficient verification of scrambling operations performed.

The scramble can not stop you / from becoming popu-ler… lar

Packy's polyglot Challenge 370 features solid code samples in Perl, Raku, Python, and Elixir that showcase how to solve the problem multiple ways using different programming languages. He shows how using Elixir's pipe operator or Raku's Bag can help efficiently transform and filter the paragraph from "Most Popular Word". He also demonstrates a consistent, recursive approach to solving the problem using the same recursive logic, with code examples in each of the four languages, while adapting to the specific syntax and idioms of each language, in his example "Scramble String".

Words and more words

Peter implements a clean regular expression approach to normalising the text and eliminating any banned words in Popular Word, while also provides a completely recursive solution in Scramble String that clearly demonstrates splitting and swapping parts of the string in order to illustrate the property of being scrambled.

The Weekly Challenge - 370: Popular Word

Reinier solution includes a simple regular expression to remove punctuation characters and a hash to count the number of occurrences of each valid word. This makes it easy to identify the most frequently used word that is not on a banned list, and provides an easily readable model from which to analyze text.

The Weekly Challenge - 370: Scramble String

Reinier's demonstrates pruning as an optimisation technique. If the characters sorted for both strings do not match (meaning they are not anagrams), the function returns false without going through all remaining recursive levels.

The Weekly Challenge #370

Robbie's high-performance Perl solutions employ algorithmic efficiency and strong input validation. In Task 1, he uses a fast normalisation method along with a hash-based frequency counting scheme to isolate the most popular word. In Task 2, Robbie's "Scramble String" implementation is notable for being a recursive Divide-and-Conquer strategy, providing an additional speedup by implementing a pre-check anagram filter to eliminate expensive recursive calls to incompatible strings.

Popular Scramble

Roger shown how to use a specialised programming tool like Counter in Rust to find popular words with only a few lines of code. In addition, the example in PostScript is an interesting concept as it shows how to create a counted hash from scratch using the examples provided in the Rust program as a reference.

Popular Scrambling

Simon demonstrates Task 1 by methodically normalising strings and counting strings using hashes in order find the word with the highest occurrence. His solution for Task 2 highlights the use of recursion when solving the problem, and optimises by checking if two strings are anagrams with a "fail-fast" method; this way, all non-anagrams can be filtered out before going through the more complex process of recursion.

Perl Tutorial

A section for newbies and for people who need some refreshing of their Perl knowledge. If you have questions or suggestions about the articles, let me know and I'll try to make the necessary changes. The included articles are from the Perl Maven Tutorial and are part of the Perl Maven eBook.

Testing in Perl

The 'slides' with all the examples that are used in the online course.

Rakudo

2026.16 Selkie TUI Framework

Training

Testing in Perl

While we are still recording the live sessions of the Testing in Perl you can also watch the previous episodes on the Code Maven Academy web site. Usually it is for paying subscribers only, but for the next couple of day you can still access it free of charge. You only need to register on the web site.

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Events

Perl Maven online: Testing in Perl - part 5

April 30, 2026

Boston Perl Mongers virtual monthly

May 12, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #769 - What is dead this week?

Gabor Szabo — Mon, 20 Apr 2026 13:51:34 +0000

Originally published at Perl Weekly 769

Hi there,

Every week I see a post declaring about something being dead. Agile is dead! Testing is dead!, Algol-68 is dead! I am so fed-up with this. So I am not going to link to the article that was discussing 5 dead programming languages.

Last week finally I got home and because of the flight I had to postpone the Testing in Perl event so it will be held this Thursday. You are invited to watch the previous sessions (for now free of charge) and join the next one.

The Perl Maven WhatsApp group already has more than 70 members. Unfortunately recently we got a few spammers so I had to turn on registration-approval. This means that when you try to join I'll send you a private message asking who you are. This is the little extra step we have to do to avoid spam. Anyway, you are invited to join us!

Enjoy your week!

--
Your editor: Gabor Szabo.

Announcements

TPRC Talk Submission Deadline in 2 days!

Articles

Faster UTF-8 Validation

Way more information about UTF-8 than I can fit in my head.

Enums for Perl: Adopting Devel::CallParser and Building Enum::Declare

Compiling Google::ProtocolBuffers::Dynamic on Debian Trixie

For a long time I have been trying to encourage Perl Module authors to include installation instruction when external libraries are needed. Even if only for one or two Linux distributions. This information should be in the README of the project.

Happy sharing

How to share memory between processes? A survey of a bunch od Data::* modules.

Making an Asynchronous Clocking Drum Machine App in Perl

PDL in Rust -- Part Two

"The current PDL implementation in pperl covers roughly 3,000 assertions end-to-end: about 1,400 on the Perl-facing connector side and about 1,600 on the engine side. As of this writing roughly 98% of the connector assertions match upstream PDL 2.103 exactly, and most of the remaining couple of dozen we already know why they fail. By the time you read this the numbers will have drifted a little in our favour - give or take - but the shape is the point, not the decimal."

Discussion

parsing a csv with boms in every line

What kind of strange things people have to deal with?

A curious case of an autovivified env var

Should the documentation of autovivification be comprehensive?

Grants

Maintaining Perl 5 Core (Dave Mitchell): March 2026

PEVANS Core Perl 5: Grant Report for March 2026

Maintaining Perl (Tony Cook) March 2026

Perl

This week in PSC (221) | 2026-04-13

The Weekly Challenge

The Weekly Challenge - 370

Welcome to a new week with a couple of fun tasks "Popular Word" and "Scramble String". 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.

RECAP - The Weekly Challenge - 369

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Valid Tag" and "Group Division" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Perl Weekly Challenge 369: Valid Tag

This post provides multiple amazing examples of technical versatility by providing a clean and direct solution written clearly in many different programming languages with tremendous flair, it shows great elegance in presenting the elegant and simple solution to the valid tag problem using the idiomatic language of each respective programming language. Abigail shows off expert level code writing skills by using the advanced character class arithmetic features present within Perl; these advanced ways of manipulating strings show the efficiency of his coding style, while simultaneously creating visually appealing code.

Perl Weekly Challenge 369: Group Division

This post offers an extremely polished and versatile engineering design for the island program project. Abigail has shown advanced expertise by using a 'chunk-and-fill' method over many different programming languages (Perl, C, and less common languages such as sed, including details on how string slices and fill-up strings can be done with the least amount of impact. Furthermore, it highlights a creative use of string replication operators as well as very efficient use of loops that guarantee that the final incomplete group will still have the correct amount of padding added based on the requirements given in the challenge.

Tag Division

In an idiomatic Raku implementation of the Group Division problem, as shown pretty clearly here by Arne Sommer, the gather/take construct is utilised nicely to collect the data clearly, and with the use of substr-rw for in-place string manipulation and the replication operator (x) to add padding, the solution is both easily readable and aesthetically pleasing.

Perl Weekly Challenge: Week 369

By taking advantage of mathematical precision and the crispness of concise syntax through the use of "one liners", Jaldhar has developed an efficient method for solving this problem, no matter if you're using Raku or Perl. Calculating the required amount of padding to add to a split string before actually splitting it, allows for quick and accurate results. Furthermore, the clever application of native string manipulation functions adds an additional level of efficiency and clarity to handling the grouping logic.

Divided Tags

This article offers a detailed examination of the many aspects of the "Valid Tag" challenge and provides a well-defined "word" in order to enhance the accuracy of processing. The body of this technical paper describes Jorg's unique application of the Perl programming language's ability to utilise global regular expressions (regex) to solve Task 2; and also the excellent "Shape" verb from the J programming language that has provided an efficient and generalised way to reshape and pad multi-dimensional arrays.

The Weekly Challenge 369

In this post, we look at the approach both challenges in a disciplined and structured manner. The focus is on having code that is easy to maintain and easy to read. We have examples showing clean, modular Perl and Python code, and show examples of how the "Group Division" challenge is solved using efficient use of list slicing and using generator expressions to partition and pad strings in a method that's worthy of professional quality.

string indexes

Luca Ferrari exhibits an incredible degree of technical ability through his creation of five unique environments in which to accomplish the Week 369 challenges. Those five programming environments are: Raku, Python, PostgreSQL (PL/Perl, PL/PgSQL, and PL/Java). Luca's elegant use of Raku's rotor method combined with the ability of Python's list slicing to achieve the same complex logic for string padding and partitioning, as demonstrated in his application of The Group Division challenge, show how many different programming languages can utilise very diverse methods to accomplish the same technically precise logic.

Perl Weekly Challenge 369

The post demonstrates exceptional compact Perl programming by distilling complex string processing procedures into "1.5-liners" that are quite efficient. For Task 1, he builds camelCase tags from a string of input values using the split, map, and join functions in order to achieve the desired result in one pass. In addition, Luis's approach to Task 2 makes use of a brilliant "alternation" regex (.{$size}|.+) as a means of capturing both full and partial segments of an input string in an optimal manner. The use of this regex allows him to create direct array-index padding, resulting in code that is not only concise, but also very technically accurate and well-balanced between the two principles.

Good Tags and Good Chunks

Matthias Muth has written an impressive article on internationalisation (I18N) relating to pragmatic problem solving while still maintaining a strong long-term support model through thoughtful design choices such as those found within both the "Valid Tag" and "Group Division" solutions provided by Matthias's book. The use of the Text::Unidecode module was one way to create technically superior solutions that would accommodate for the presence of non-ASCII character sets and would also adhere to the rules specified in the challenge itself (e.g., valid tag). Additionally, his solution for "Group Division" is equally amazing because he accomplished this via a mathematical pad for the purpose of executing a clean single regex global match - or a single line of functional code - that could otherwise be accomplished via several iterations of code.

Strings Will Tear Us Apart

In this post, Packy gives a thorough, contemporary example of string handling in Raku, Perl, Python, and Elixir. He creates a unique solution to the "Group Division" challenge by using the Raku function .comb with integer arguments to automatically divide into chunks and by using the Perl 'unpack' function with a per-function constructed template, demonstrating how you can creatively employ language idioms to efficiently and effectively resolve a common programming issue and provide a solution for data partitioning that uses little or minimal resources.

Fun with strings

In his article, Peter presents a practical and polished approach to developing an order of operations for the sanitisation of strings. By organising the procedure so that lower case, regular expression character removal, and space & character combination are completed before the creation of camelCase, the end product meets the requirements for both camel case formatting as well as length requirements while still producing clean, effective code.

The Weekly Challenge - 369: Valid Tag

In Reinier's method, a model for defensive programming has been developed that features validation of input for real alphabetic values before processing. Also, he has taken a somewhat technical approach (transforming input to remove non-letter characters by converting them to spaces in order to apply camelCase correctly while keeping word boundaries intact) through his use of multiple accurately readable regular expressions.

The Weekly Challenge - 369: Group Division

Reinier has created a very good tutorial solution which showcases how to use the "Perl 4-argument substr function" to extract and remove data from a string using a while loop to do so iteratively and then using string replication for the final padding makes the code extremely readable and a great technical example of using efficient in-place usage of strings.

The Weekly Challenge #369

The work done by Robbie within the "Valid Tag" review indicates a very well thought out way to approach hyphenated compound words as a single entity for case adjustment, in addition to providing an innovative solution for "Group Division", by utilising the four-argument form of Perl's substr in order to easily "chop and fill" strings, while also demonstrating his superior knowledge of high-performance string manipulation.

Divided Validity

Roger's technical review offers an interesting side-by-side comparison of various string handling paradigms from multiple programming languages. The "Valid Tag" part of the review shows how Crystal's highly performant state machine implementation allows for case conversion to be accomplished in a single pass. The "Group Division" analysis of in_groups_of() in Crystal is very interesting as well, as it illustrates just how compact that library function is compared to typical iterative slicing found in Typst, demonstrating that using built-in library functions can greatly simplify the implementation of algorithmic logic through less code complexity.

Group Tag

A wonderful illustration of Test-driven development is Simon's critique of Challenge 369. He found through tests that the sanitisation step of "Valid Tag", had to be completed before performing case formatting so that example 5 is handled properly. He also provides useful technical comparisons between both languages' ecosystem strengths, such as Python using more_itertools.grouper vs Perl doing it manually by iteration.

Weekly collections

NICEPERL's lists

Great CPAN modules released last week.

Events

Perl Maven online: Testing in Perl - part 4

April 23, 2026

Perl Toolchain Summit 2026

April 23-26, 2026

Boston Perl Mongers virtual monthly

May 12, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #767 - Rust and Perl

Gabor Szabo — Mon, 06 Apr 2026 05:55:32 +0000

Originally published at Perl Weekly 767

Hi there!

It was interesting to see how Rust started to eat Python from the inside out. Several Python modules and stand-alone tools were rewritten in Rust. Now as I can see there started to be a movement in Perl as well to rewrite some parts in Rust (e.g. PDL). Very interesting.

People quite often ask me how could they find a job? Given that I have been self-employed providing training and contract development work, I don't have a lot of experience in job-hunting, but it seems if you can show your programming, creative, and learning capabilities then you will have a better chance landing a new job. So I recommend that people build some interesting open source project or contribute to some projects. I am mentioning this as I just saw an article about Chandra: Cross-Platform Desktop GUIs in Perl by Robert Acock and at the end of the article he mentions that he is looking for new opportunities. IMHO building new stuff and talking (or writing) about it creates a lot more opportunities in getting a job than only complaining about the lack of jobs. Good luck!

If talking about contribution, probably one of the easiest thing to contribute is a test. It is also way more valuable than many people might think. If you'd like to contribute to an open source Perl project: 1. clone its source code; 2. Generate test coverage report; 3. Find the holes in the tests and write a test. Then repeat. If you are unsure how to do this, luckily the "Testing in Perl" course I am teaching these days will help you. Last time we saw how to generate and interpret test coverage reports. Next time we'll also see how to do mutation testing. You can watch the recordings from the previous sessions (free of charge for 10 more days) and you can join our next live session.

Enjoy Passover, Easter and the rest of your week!

--
Your editor: Gabor Szabo.

Articles

PDL in Rust -- A Native Reimplementation of the Perl Data Language

Very interesting that more of Perl gets a Rust reimplementation.

Chandra: Cross-Platform Desktop GUIs in Perl

"Chandra is a Perl module that lets you build cross-platform desktop applications using the web technologies you already know - HTML, CSS, and JavaScript - while keeping your application logic in Perl.". Sounds interesting to see where it goes.

Introducing Object::Proto — A Prototype Object System for Perl

Manage the health of your CLI tools at scale

"Your services have dashboards, tracing, and alerting. Your CLI tools print to STDOUT and exit. When something breaks, debugging starts at the API gateway -- everything upstream is a black box. This makes no sense."

Discussion

Activity streams library/module for Perl

Perl

This week in PSC (219) | 2026-03-30

The Weekly Challenge

The Weekly Challenge - 368

Welcome to a new week with a couple of fun tasks "Make it Bigger" and "Big and Little Omega". 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.

RECAP - The Weekly Challenge - 367

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Max Odd Binary" and "Conflict Events" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Max Conflict

Arne demonstrates how Raku can help with the "Max Conflict" problem using Raku's built-in support for intervals and sets. By using Raku's expressive syntax (like ranges and Bags), Raku has created an easy-to-read and mathematically intuitive way to solve problems that involve overlapping data.

Overlapping Oddities

The post contains an excellent technical breakdown of both terms using Perl programming language, along with the associated edge cases, such as how to handle timings that cross over midnight using modular arithmetic to resolve them. Additionally, his benchmark testing for different ways to manipulate binary strings provides measurable, statistical data on the efficiency of these algorithms.

Odd Events

The post explores time-interval logic and complexities of "wrap-around" (i.e., time zone?) events in a mathematically rigorous and fascinating way. Specifically, by introducing the idea of "complementary" events and making use of an ingenious duration-sum inequality, he presents an elegant, universal formula for simplifying conflict detection across the Perl and J programming languages.

The Weekly Challenge 367

The post provides a very pragmatic and functional dual language reference to assist in solving PWC 367. He uses string replication to solve the binary operation task and provides a simple mathematical overlap condition $max(start1, start2) < min(end1, end2)$ for the scheduling task. Therefore his post shows readers how to write readable, fast and efficient code in Perl and Python.

overlapping intervals

The article provides a flexible technical overview of PWC 367: Solutions to the two tasks implemented in both Raku and PL/Perl for PostgreSQL (PostgreSQL's Procedural Language/Perl). He presents Raku as a convenient and efficient way of working with high-level string and array operations to concisely solve the binary and interval task while at the same time illustrating how database-level functions can be written using the same logical patterns as the ones he used for both the Raku and PL/Perl implementations of the two tasks.

Perl Weekly Challenge 367

This is a perspective piece reviewing the problems faced in physics, providing elegant one-liners using Perl and/or robust scripts. In particular, solution to events happening at "Conflicting Events" is unique in that he treats time as a circular interval and takes offsets of + or -1440 minutes so that he can accurately determine whether two events overlap even if one of the events crosses the boundary of midnight by using the degree of circularity. This demonstrates an extensive application of mathematics to derive the proper ways to schedule events over time.

Odd Conflicts

The post demonstrates his focus on maintaining clean code and code maintainability. The use of meaningful variable names and decomposing the time conversion into logical sub-steps allowed him to take a potentially complicated problem of overlapping time zones and present it in a clear and concise manner via a mathematically sound Perl implementation.

Conflicting Every Odd

The post offers a great demonstration of multi-language support for PWC 367, using Raku, Perl, Python, and Elixir to provide solutions. The technical review is particularly good at comparing different programming language techniques and how each can be uniquely applied to provide elegant and precise solutions for string manipulation and scheduling conflicts using Elixir's pattern matching and Raku's dynamic coercion as examples of differences between the languages.

Bits of conflicts

The post features a very well thought out, extensive solution in Perl that uses string multiplication to create the largest odd binary number. He gives us a lin2dec utility that helps validate his solutions. He also provides an excellent explanation of the underlying mathematical principles behind the task he has undertaken.

The Weekly Challenge - 367: Max Odd Binary

The post gives a very complete and well supported solution to the "Max Odd Binary" challenge using Perl, using the principles of defensive programming, through good input validation. The way he technically describes his solution is very helpful since he is able to explain perl specific idioms such as tr///, and also provide good alternatives to count bits when using safe and/or optimised methods so that your code will not fail.

The Weekly Challenge - 367: Conflict Events

The second task solution provides a consistent, well-understood and detailed Perl implementation for identifying conflicting events by accentuating how to process time-based intervals that cross midnight boundaries. The use of a simple mathematical representation (normalisation of times to minutes), and an efficient "shift" loop to address the next day results in an exceptional algorithm that greatly simplifies complex overlapping logic.

The Weekly Challenge #367

The thoughtful way Robbie highlights some of the ambiguity surrounding date-less times in the "Conflict Events" task. By specifically stating what the assumption of "next-day" means for events that occur before a reference time, he offered a reasonable basis upon which to solve for overlaps between intervals of time that is both mathematically accurate and practically viable.

Binary Conflict

The includes solutions in both the Raku and Crystal languages. The way he solves Task#2 is particularly interesting because of how he looks at quantising time; by looking at events as ranges of minutes and splitting events that span midnight into two spans, he has developed a very mathematically sound and clean way to check for non-emptiness of intersecting intervals.

Maximum conflict

Simon Green used the Perl and Python programming language to produce solutions for Task 1 and Task 2. One of Simon's solutions was for the "Conflict Events" problem and it is very good because he used the range objects provided in Python, and generated individual minutes using sets, to determine where there are overlaps by tracking through time; his method provides a good way of handling events that cross over to another day.

Weekly collections

NICEPERL's lists

Great CPAN modules released last week;
MetaCPAN weekly report.

Event reports

Koha Hackfest 2026 in Marseille

Events

Perl Maven online: Testing in Perl - part 3

April 9, 2026

Perl Maven online: Testing in Perl - part 4

April 16, 2026

Perl Toolchain Summit 2026

April 23-26, 2026

The Perl and Raku Conference 2026

June 26-29, 2026, Greenville, SC, USA

You joined the Perl Weekly to get weekly e-mails about the Perl programming language and related topics.

Want to see more? See the archives of all the issues.

Not yet subscribed to the newsletter? Join us free of charge!

Perl 🐪 Weekly #766 - Perl: Past, Present and Future

Gabor Szabo — Mon, 30 Mar 2026 10:07:08 +0000

Originally published at Perl Weekly 766

Hi there,

This week's Perl landscape firmly establishes that while the history of Perl is rich and exciting, it is also a place for experimentation and innovation in the future. There have been handful of releases of Perl v5.43.9 which came up with plenty of changes and major one for me was the enhanced /xx pattern modifier. In between there was another very important patch was released, Perl v5.42.2-RC1, and Perl v5.40.4 addressing the vulnerability in Compress::Raw::Zlib. Don't dare call Perl is dead.

Ever worked with XS modules? Well we have three related XS modules that made it looks so simple and easy. The benefit of XS helps creating efficient and high speed unique identifier creation using Horus, Apophis, and Sekhmet. Bonus, you get to see how they can be used together. Robert seems to be on the roll with his another gem, Eshu, a code formatter written entirely in C and exposed to Perl through XS.

Not everything have to be, XS. Dave showed how you can work with TOON (Token-Oriented Object Notation), textual format for representing structured data, same data model as JSON. Using his new creation TOON, one can easily work with TOON data model. If you are XS fan, feel free to create XS version of TOON.

Do you use Java? If yes then you now have the choice of using Perl power inside Java. The project, PerlOnJava, gives us handy tool to get the job done: jperl, jcpan, and jprove.

The week was fun, too much to handle in such a short time but I am not complaining. I am finding it hard to keep up, how about you?

Enjoy rest of the newsletter.

--
Your editor: Mohammad Sajid Anwar.

Announcements

TPRF Board Announces the 2025 Annual Report

The Board is pleased to share the 2025 Annual Report from the The Perl and Raku Foundation.

Articles

Beautiful Perl feature: "heredocs", multi-line strings embedded in source code

This article on the Beautiful Perl Feature - Heredocs and MultiLine Strings provides a nice introductory overview of how to use Perl's heredoc syntax to create readable, maintainable multiline text. It provides practical examples combined with a simple explanation which allows experienced programmers and novices alike to have a fresh look at an item that has been around for many years.

Perl, the Strange Language That Built the Early Web

The unusual language that made the early web; a glimpse at the history of Perl less than truly alien to the average user; The original dynamic/interactive media for the internet; with its contribution to automation processes (primarily text); through CGI scripting - both technically and culturally; In terms of practicality or versatility; play a significant role in creating and supporting how the first wave of web interactivity was created and how it became an integral part of the early days of the world wide web.

Horus, Apophis, and Sekhmet: An C/XS Identifier Stack for Perl

This post focuses on three related XS modules for efficient and high speed unique identifier creation (UUID, ULID and deterministic) and content-addressable storage in Perl. It provides a comprehensive overview of how to use these tools in conjunction with each other to create an efficient and scalable unique ID workflow. It also demonstrates how they can be used together.

Eshu: Indentation Fixer for Eight Languages, Written in C

This article discusses a portable C-based program that formats code and will uniformly line up the indentation across eight different programming languages. It describes examples to show you how Eshu can help you make the indentation to your programming code consistent with very little effort and no extra heavy duty tools required. For Developers who choose to use other than traditional language-specific formattors, this document presents an overview of how Eshu creates a lightweight formatting solution that developers may find useful.

Writing a TOON Module for Perl

The article presents TOON (Token-Oriented Object Notation) which aims to be simple for both people and LMs to construct and understand while using as few punctuation marks as possible and maintaining an easily accessible structure of data. It also discusses the reasons why TOON will be beneficial and provides a Perl implementation module for TOON with a familiar interface to those that have used JSON.pm.

CPAN

Graphics::Toolkit::Color 2.0 feature overview

The Graphics::Toolkit::Color 2.0 feature overview post provides an impressive look at all of the most significant improvements that have been made in developing GTC 2.0. The description outlines how GTC has grown beyond only doing basic coloring routines to include now a much richer, more complex, multi-space colored library complete with the ability to create beautiful gradients, accurately measure colors for perceptual purposes, and a variety of tools for use by both designers and developers. Overall, this is a succinct overview that does an excellent job of showcasing the reasons why GTC 2.0 is a unique addition to CPAN.

PerlOnJava Gets a CPAN Client

This is a great update regarding the addition of native CPAN support to Perl-on-JVM tooling. The example uses the ability to use an already developed CPAN client for installing modules and accessing the overall CPAN ecosystem in a more natural way than would be done with the non-JVM versions of the clients. It gives many real-world examples and is an excellent source of information for those who want to connect Perl and Java.

Lingua::* - From 17 to 61 Languages: Resurrecting and Modernizing PetaMem's Number Conversion Suite

The blog entry, "Lingua Revival", is an interesting way to reintroduce Lingua by combining elements of memories with new features that apply to modern day Perl. The story is easy to follow and focuses on being usable in today's world, which will be beneficial to both long-time users and new users of the project.

The Weekly Challenge

The Weekly Challenge - 367

Welcome to a new week with a couple of fun tasks "Max Odd Binary" and "Conflict Events". 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.

RECAP - The Weekly Challenge - 366

Enjoy a quick recap of last week's contributions by Team PWC dealing with the "Count Prefixes" and "Valid Times" tasks in Perl and Raku. You will find plenty of solutions to keep you busy.

Count the Times

Raku Musings has a clearly written "Count the Times" post that gives a well-organised overview. It shows how idiomatic features work together effectively in Raku, resulting in a clear and elegant solution. There is an excellent balance between compact code and an informative explanation. The post demonstrates the use of expressive constructs that lend themselves to solving this type of problem using Raku.

Could We Start Again, Please

Bob Lied writes an engaging post about a problem in a clear manner, interspersing logic with humor; making it a pleasure to read! The author reviews alternative methods and their advantages/disadvantages and demonstrates a practical approach as well as demonstrating good Perl coding skill.

Valid Times

Bob Lied's "Valid Times" post systematically breaks down the issue into distinct steps while also providing significant attention to detail in regards to possible edge cases and practical limitations of validation of times. It presents a succinct but complete Perl code and corresponds with sound logic behind the choice of this Perl implementation, which allows readers to follow along easily and use as a reference when addressing the same type of parsing problems.

Perl Weekly Challenge: Week 366

The Jaldhar's blog has written an extensive, interesting post detailing how to perform Week 366 tasks. It does so by separating them into two sections: Problem 1 and Problem 2. This helps readers easily understand the problems themselves, as well as providing a clear path to solution using Perl. The blog also clearly states the logic behind each step, allowing readers to learn from the blogs experience while still being able to easily move on to solving this week's challenges independently.

Pre-Timed Counters

The blog post written for the week of 366 by Jörg, presents an elegant solution that exemplifies the use of clear and concise Perl programming techniques with a command of idiomatic constructs. The reader will appreciate Sommrey's clean, logical approach in solving the problem space and his appreciation for the use of expressive and efficient code, which reflects both familiarity and appreciation for the inherent beauty of programming.

what time is it?

Luca Ferrari's post is a further example of his continuing theme of approaching Perl Weekly Challenge in an analytical as well as exploratory way; frequently developing solutions in several languages and platforms to help him better understand the challenges. Luca's posts provide very useful instruction/examples; help you learn through experimentation/experience; and help you to truly think about and re-examine/consider the real-world nature of the solution.

Perl Weekly Challenge 366

The write-up gives a very reasoned overview of the problem with easy-to-follow methods of solving it using logical thinking. There is a good amount of coding as well as thorough explanations that create a valid and helpful source for those searching for an understanding of this issue and its methods of resolution using Perl.

Counting Times Without Questions

The article from Matthias Muth, entitled Matthias Muth's Week 366, is a clear and precise description of his thought processes relating to solutions presented in a concise manner while also being well-organised so as to make it easy to understand the underlying concept. It has an elegant and idiomatic style similar to that of Matthias' other contributions to the Perl Weekly Challenge, and it has a very clean decomposition of the problem that allows more experienced readers to develop an appreciation for it.

The Times They Are A-Countin'

The entertaining narrative of Packy Anderson's post combines humor and solid technical approaches to a problem to keep readers interested and provide them with an enjoyable and intuitive experience involved in the solution. His creative approach to framing the challenge and providing clear examples of how to solve it makes for a positive experience for all.

Prefixes and times?

Peter Campbell Smith's Week 366 Write-up provides an unambiguous, pragmatic solution style representing a strong real-world Perl mindset. The emphasis is placed on solving the problem in an accurate and efficient manner through simple implementation methods. The provided solution is straightforward and effective; he understands the relevant tasks thoroughly and prefers to solve issues clearly and without complexity (typical of all Weekly Challenges).

The Weekly Challenge - 366: Count Prefixes

The writing style used by Reinier Maliepaard in his submission demonstrates a logical and coherent framework and logical correctness; Making it easy for the reader to follow. Reinier’s structure of writing reflects discipline and analytic thought, along with succinctness, resulting in a Combination of Clear and Robust Perl Source Code, which matches the strategy of problem-solving as well.

The Weekly Challenge - 366: Valid Token Counter

The Week 366 second post by Reinier Maliepaard provides another example of his methodical and rational approach to problem-solving with a detailed logical breakdown along with concise Perl code to solve the problem. The article focuses on providing a clear, correct, and easily read explanation of how to work through validation problems, offering users of all skill levels an accessible, educational account.

The Weekly Challenge #366

Robbie Hatley's Week 366 Answers includes usable Perl solutions, as well as easy to follow logical documentation for each step of reasoning. What is accomplished is a practical, understandable solution. While the solutions provide a clear method to convey both the "how-to" and "why" of developing the final product, they also teach the reader to think through each implementation logically.

The Time of the Count is Over

Week 366 of Roger's post is an impressive example of multi-language exploration with Ruby, Lua, PostScript and Raku; it illustrates how to solve problems in Perl and develop cross-language thinking by presenting examples of various programming paradigms solving the same problem as well as having clear and entertaining explanatory text.

Happy 7th birthday TWC!

Simon Green's 7th Anniversary Post for The Weekly Challenge is an amazing, heartfelt reflection of how far we've come as a community over the past seven years, combining his personal experience with his deep appreciation for all the amazing contributors & readers to our community. It's an uplifting and well-written post that captures the essence of what The Weekly Challenge is about and how it's positively affected our lives.