This year's London Perl and Raku Workshop will take place on 26th Oct 2024. Without our sponsors this event would not happen and we would like to thank them.
Perl developers are hard to get. As the leading language of the dotcom boom, Perl is one of the best-paid languages worldwide, yet Perl training seldom features on university curricula. But that doesn't have to cause a headache for employers trying to expand their Perl team.
Geekuni can give software developers with no previous Perl experience the training they need, as they need it. So, whether you’re looking to provide new recruits with online Perl training from day one of the onboarding process or upskill existing talent, Geekuni has the training package to empower your staff with Perl.
Spoiler Alert: This weekly challenge deadline is due in a few days from now (on October 13, 2024, at 23:59). This blog post provides some solutions to this challenge. Please don’t read on if you intend to complete the challenge on your own.
Task 2: Luhn’s Algorithm
You are given a string $str containing digits (and possibly other characters which can be ignored). The last digit is the payload; consider it separately. Counting from the right, double the value of the first, third, etc. of the remaining digits.
For each value now greater than 9, sum its digits.
The correct check digit is that which, added to the sum of all values, would bring the total mod 10 to zero.
Return true if and only if the payload is equal to the correct check digit.
We were joined by Leon Timmermans and Tim Legge to discuss plans for TLS support in core.
We talked about our inadequate handling of point releases and especially security releases. In the past this was handled on individual initiative. We need to institutionalize at least some of this as actual process to keep things on the rails.
We discussed with Leon and Tim what we want to do to have TLS support in core. Future support for underlying APIs other than OpenSSL is desirable. Net::SSLeay also has cruft that we would prefer to avoid in core.
This article on the Python Software Foundation inspired me to write this. Serving on the board of a foundation isn't all about glamorous meetings and fancy titles. Still, I'd like to share how I ended up here and what I've learned along the way. Opinions are my own.
What Exactly is TPF?
TPF stands for The Perl Foundation, a U.S.-based non-profit organization dedicated to advancing the Perl language through open discussion, collaboration, and, of course, code.
TPF got its start around 2001 when Perl was super popular. The organization was originally needed to run a conference; because apparently, you need an official entity to book conference venues. The foundation was also actively raising funds and spending money on Perl development grants at that time, and they've been doing it ever since.
This year's London Perl and Raku Workshop will take place on 26th Oct 2024. Without our sponsors this event would not happen and we would like to thank them, starting with our diamond sponsor:
Deriv, a leading online broker with 25 years in the industry, is proud to sponsor the London Perl & Raku Workshop 2024.
As a company with strong ties to the Open Source community, our connection to Perl is more than just practical—it's a passion. Over the years, we have actively used Modern Perl and contributed to shaping its future, including beta testing key developments like Object::Pad, which are crucial for advancing the language's capabilities.
Perl is the backbone of our back-end operations, proving to be a robust, reliable, and versatile language that meets our needs. Its community-driven growth, notably through CPAN, continually boosts its capabilities and reflects our values of collaboration and innovation.
Spoiler Alert: This weekly challenge deadline is due in a few days from now (on October 6, 2024, at 23:59). This blog post provides some solutions to this challenge. Please don’t read on if you intend to complete the challenge on your own.
Task 1: Third Maximum
You are given an array of integers, @ints.
Write a script to find the third distinct maximum in the given array. If third maximum doesn’t exist then return the maximum number.
Example 1
Input: @ints = (5, 6, 4, 1)
Output: 4
The first distinct maximum is 6.
The second distinct maximum is 5.
The third distinct maximum is 4.
You are given a string, $str.
Write a program to return the minimum number of steps required to make the given string very strong password. If it is already strong then return 0.
Criteria:
It must have at least 6 characters.
It must contains at least one lowercase letter, at least one upper case letter and at least one digit.
It shouldn’t contain 3 repeating characters in a row.
Following can be considered as one step:
Insert one character;
Delete one character;
Replace one character with another.
A Simplification
To make the algorithm simpler, let’s ignore deletion. Instead of deleting a character, we can always replace it with a character different to the original one and its neighbours (you can easily verify that it can’t break any of the three criteria: it doesn’t shorten the password, it doesn’t remove more characters than the deletion would have deleted, and it never creates repeating characters).
The Algorithm
Let’s keep a set of strings we need to check, we’ll call them the agenda. At the start of the program, the agenda contains the input string.
This virtual Conference on December 18th, 2024 is being called in conjunction with the creation of the Science Perl Journal, Winter 2024 Issue.
We have 6 author committments from some very exciting topics, but we want more! The Summer Issue has 8 authors and is nearly 150 pages. We are looking to double the number of authors, doubling the number of pages is going to be a stretch :-).
DESCRIPTION
Christos Argyropoulos, MD, PhD. is our moderator for this virtual event, which is December 18th, 2024 - Perl's 37th birthday! At this event we will be announcing our Summer 2025 plans, which will include a 3rd Issue of the SPJ.
The following lengths will be accepted for publication and presentation:
This year's London Perl and Raku Workshop is just 4 weeks away. We now have a pretty full schedule, so the call for presentations is now closed, however we might have room for one or two more talks depending circumstances on the day. If you really think you have talk you want to give then get in touch.
As part of the workshop we would like to ask attendees if any are willing to volunteer for helping out on the day. This will likely include:
Room monitoring and video equipment operation
Registration of attendees
General assistance of organisers and attendees
We are probably looking for three people to help out on the day. Please contact the organisers if you would like to help out.
The London Perl and Raku Workshop will take place on 26th Oct 2024. Thanks to this year's sponsors, without whom LPW would not happen:
This week’s meeting was delayed by scheduling conflicts because we chose consistency and availability over partition tolerance. We spent the entire meeting working on the document we wanted to put together a month ago with our thoughts on the Perl version number, which we intend to publish very soon.
Spoiler Alert: This weekly challenge deadline is due in a few days from now (on September 22, 2024, at 23:59). This blog post provides some solutions to this challenge. Please don’t read on if you intend to complete the challenge on your own.
Task 2: Valid Number
You are given a string, $str.
Write a script to find if it is a valid number.
Conditions for a valid number:
- An integer number followed by an optional exponent.
- A decimal number followed by an optional exponent.
- An integer number is defined with an optional sign '-' or '+' followed by digits.
Decimal Number:
A decimal number is defined with an optional sign '-' or '+' followed by one of the following definitions:
- Digits followed by a dot '.'.
- Digits followed by a dot '.' followed by digits.
- A dot '.' followed by digits.
The schedule for this year's London Perl & Raku Workshop is now visible: https://act.yapc.eu/lpw2024/schedule. Please please please (please please) make a point to mark those talks that you plan to attend as this will allow us to tweak the schedule a bit if some talks are more heavily favourited than others.
The venue opens for attendees at 9am and we plan to start talks at 9:30am. Drinks will be available throughout the day, hence no need to have dedicated breaks there. Lunch will be at midday for an hour, there are plenty of options close to the venue to grab something to eat. If we receive a couple more sponsors we can have lunch at the venue, but currently that won't be possible.
There are a couple of spots left for talks, otherwise the schedule is full. Please don't let this put you off submitting a talk as it's possible some speakers may have to change their plan.
Spoiler Alert: This weekly challenge deadline is due in a few days from now (on September 8, 2024, at 23:59). This blog post provides some solutions to this challenge. Please don’t read on if you intend to complete the challenge on your own.
Task 1: No Connection
You are given a list of routes, @routes.
Write a script to find the destination with no further outgoing connection.
Example 1
Input: @routes = (["B","C"], ["D","B"], ["C","A"])
Output: "A"
"D" -> "B" -> "C" -> "A".
"B" -> "C" -> "A".
"C" -> "A".
"A".
The following script leaks memory in perl v5.40, and it did not in v5.38:
use Scalar::Util 'weaken';
my $z;
{
my $x;
my $y;
my sub my_sub {
$x = shift;
return sub { $y };
};
my $subscriber = {};
$subscriber->{foo} = my_sub($subscriber);
weaken($z = $subscriber);
}
say 'leak = ', int defined $z;
Yep, that's right - the second half dozen talks have been accepted for this year's London Perl and Raku Workshop. This puts our schedule at approximately 80% full, so if you are thinking about talking at the workshop then submit your proposal now!
The CFP will be closed at the end of September to give speakers sufficient time to finish their presentations and to allow the schedule to be created. We encourage all attendees to mark talks they are interested in as that will inform some of the schedule choices.
If you aren't thinking about talking then have a think about what you've been doing in the Perl and/or Raku space the last five years, or even just the general IT and development space. Perhaps there's something interesting you can talk about? If you don't feel it's a full fat talk then submit a lightning talk instead.
The London Perl and Raku Workshop will take place on 26th Oct 2024. Thanks to this year's sponsors, without whom LPW would not happen:
We exchanged Perl (re)branding ideas with Olaf. We will be keeping in touch on that front.
We discussed the feedback on feature-guarding and unbundling apostrophe. We came up with a strategy to propose that we think should work, which will be posted on the relevant thread.
We discussed the fact that keeping the current smartmatch operator (as a feature) means we can’t have a meaningful air gap to prevent subtle bugs when moving to a future “good” smartmatch. This probably implies that we would be giving up on any future smart match operator, but there are usually better replacements.
Spoiler Alert: This weekly challenge deadline is due in a few days from now (on August 25, 2024, at 23:59). This blog post provides some solutions to this challenge. Please don’t read on if you intend to complete the challenge on your own.
Task 1: Unique Number
You are given an array of integers, @ints, where every element appears more than once except one element.
`
Write a script to find the one element that appears exactly one time.
It prompted me to take a serious look at the modules I have uploaded to CPAN and acknowledge that some of them are no longer valuable. Indeed as I reviewed one of them I was none too kind in my judgements against the author.
That made it quite easy for me to see how I can easily participate in CPAN day. I'm removing a couple of modules:
Business::Worldpay::Junior - I don't think this integration option even exists any more and I certainly haven't actively maintained this for years.
Net::UKDomain::Nominet::Automaton - Nominet withdrew the Automaton in 2015
Those are now scheduled for deletion on Monday next week.
I'll need to review some of the others and consider whether to open them up for anyone who is interested to take over as maintainer.
