blogs.perl.org

All three of us attended.

• We discussed the reactions to the Perl 42 proposal and how to reach consensus on it. We want to get a handle on the technical feasibility and also discuss more closely with the people who have doubts.
• We reviewed Paul’s clarifications to PPC0027 (any and all) and replied on the PR.
• We discussed the mismatch between the definition of the PPC process and how it has worked out in practice, and tried to come up with a refactoring. We want to request a review.
• We looked at the release process and the release manager role. We are considering the idea of making the shepherding of the perldelta a separate ongoing responsibility.
• We spent some time working on our own meeting structure in order to better perform our project management responsibilities.

[P5P posting of this summary]

Ever wanted to extract text from an image in Perl?
Here is my story to do the same.
Enjoy !!!

https://theweeklychallenge.org/blog/extraction-in-perl

It's a little over a week until this year's London Perl and Raku Workshop. Here's a couple of things to note about the day.

The schedule is relatively fixed at this point, however if you haven't already starred the talks you plan to attend then please do so as this will inform any tweaks. The venue has a large room (150 people) and a smaller room (35 people) therefore it is helpful to know which talks might be heavily attended in advance so we can make sure those talks have enough space.

The venue, The Trampery in Old Street, is located a two minute walk from the Northern Line's Old Street tube station in central London. The Northern Line has stops at most of the major train stations in London, or trivial links to others, so we recommend taking the tube to get to the venue.

These are some answers to the Week 290, Task 1, of the Perl Weekly Challenge organized by Mohammad S. Anwar.

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 1: Double Exist

You are given an array of integers, @ints.

Write a script to find if there exist two indices $i and $j such that:

1) $i != $j
2) 0 <= ($i, $j) < scalar @ints
3) $ints[$i] == 2 * $ints[$j]

Example 1

Only Aristotle and Philippe this time.

• We went through all the open PPC pull requests, with a goal of merging or closing as many of them as possible. The actual merging or closing will happen soon.
• We merged PPC0025: “Perl 5 is Perl”.
• We discussed some possible shortcomings of the PPC process and wrote down a few ideas for how we might address them. We intend to discuss these with the people originally involved with defining the PPC process.
• We want to write PSC blog posts to put intentions and ideas on record for the future. We discussed topics for blog posts we want to post soon.
• We discussed the structure of our meetings, to make sure we take care of our duties and avoid losing track of things.

[P5P posting of this summary]

I am in the process of adding OpenWeatherMap support to Xasteria Weather for iOS and the proxy I built is in Perl. Since there was only an old module on CPAN which did not support the current API and was not easily updatable, I released Weather::OWM. It's a very simple module, similar to two other Weather modules I've released in the past (Weather::WeatherKit and Weather::Astro7Timer).
The OpenWeather API has a Free tier with both current weather and forecast, which makes the module useful to anyone interested in fetching weather for any location. E.g.

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.

Oleeo is an award-winning provider of innovative talent acquisition technology. Built using intelligent automation and machine learning, Oleeo’s platform helps companies discover unlimited sourcing potential to attract, engage and hire amazing, diverse teams that change the world for the better. Our mission is to help recruiters do that faster and more efficiently than ever before.

Utilise our intelligent automation to help secure exceptional talent with rapid time-to-hire. Enjoy the massive rewards experienced by our customers, including Marks & Spencer, Morgan Stanley, Metropolitan Police, Civil Service Resourcing, John Lewis Partnership. Benefit from our bespoke, prescriptive intelligence and pinpoint perfect candidates who can steer your business forwards at every level. We offer one complete talent acquisition system end-to-end: Attract, engage, monitor, interview, hire & onboard without any compromise on candidate quality.

These are some answers to the Week 289, Task 2, of the Perl Weekly Challenge organized by Mohammad S. Anwar.

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 2: Jumbled Letters

An Internet legend dating back to at least 2001 goes something like this:

Aoccdrnig to a rscheearch at Cmabrigde Uinervtisy, it deosn't mttaer in waht oredr the ltteers in a wrod are, the olny iprmoetnt tihng is taht the frist and lsat ltteer be at the rghit pclae. The rset can be a toatl mses and you can sitll raed it wouthit porbelm. Tihs is bcuseae the huamn mnid deos not raed ervey lteter by istlef, but the wrod as a wlohe.

Another extended meeting, which everyone attended. Here’s a summary:

• We want to get actual implementation of TLS in core underway. Paul volunteered for some of it. We’ll email our plan to p5p, to get things started.
• We talked about undef-aware equality operators. While the flags idea is tempting, we don’t think that there are enough useful flags to go down this route (what’s the use of stacking flags, if you only have one). If equ and === are added to Perl, we think the negative versions (neu and !==) should be added as well.
• We had a quick version discussion. The document is almost ready.
• We want to poke the PPC implementors again, to make sure we can have some of them available in the next version of Perl.

[P5P posting of this summary]

Read volume 1 here.

In my last post, I talked about some of the big things TPF (The Perl Foundation) does. This time, I'll discuss some of the smaller stuff I've handled at TPF, often with help from others, and my misses along the way. My opinions are my own.

White Camel Awards

The White Camel Awards, started by brian d foy in 1999, were created to honor Perl community contributors, who, like ninjas, do all the hard work but never seem to get noticed. brian personally picked the winners each year until he stepped down in 2018. While many people contribute to the Perl community, their efforts often fly under the radar. I mean, organize a Perl event every year and your name still wouldn't make it outside the venue. Tough, right?

In 2022, I took over the award with TPF, with brian's blessing, to keep this tradition alive.

I gave the talk Maximizing Performance and Cost Efficiency in the Cloud at the Perl and Raku conference this year. Among others, it used data from a benchmarking comparison I did among dozens of VMs on various cloud providers, and I had promised I'd post the full report.

It took me quite a bit longer than expected due to both technical complications and some new releases I wanted to include that enlarged the scope, but here it is now. Should be useful if you want to get the best bang for buck on the cloud.

These are some answers to the Week 288, Task 1, of the Perl Weekly Challenge organized by Mohammad S. Anwar.

Spoiler Alert: This weekly challenge deadline is due in a few days from now (on September 29, 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: Closest Palindrome

You are given a string, $str, which is an integer.

Write a script to find out the closest palindrome, not including itself. If there are more than one then return the smallest.

The closest is defined as the absolute difference minimized between two integers.

Example 1

Input: $str = "123"
Output: "121"

Example 2

The three of us attended another long meeting:

• We continued refining our plan for TLS in core. We will collect feedback on its feasibility from the maintainers of the relevant modules.
• We reviewed the status of putting the apostrophe package separator behind a feature and approved the PR.
• We confirmed that we want to deprecate smartmatch with a feature. This effectively means that we don’t plan for a “better smartmatch” at this time (but it can still be pursued in future, by way of the air gap strategy, if there is appetite). We will file an issue for this.
• We agreed that “negative” features (rather than outright removal) is our preferred way to deprecate historical Perl quirks as the language continues to evolve.
• We discussed our ongoing inadequacy at dealing with maintenance releases. We wrote down next steps to get back on track, and also started looking into capturing a checklist to document the process.

[P5P posting of this summary]

The Weekly Challenge 287, Task 1

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.

NAME

Perl Community Conference / Science Perl Journal, Winter 2024

SYNOPSIS

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:

• Extended Abstract (1 page, 5 minute lightning talk slot)
• Short paper (2-9 pages, 20 minute speaker slot)
• Full length paper (10-36 pages, 50 minute speaker slot)

These are some answers to the Week 287, Task 2, of the Perl Weekly Challenge organized by Mohammad S. Anwar.

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.

Exponent:

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.

[P5P posting of this summary]

Have you worked with asynchronous task? If yes then this is one way of doing it in Perl.
Please checkout this post for more information.

https://theweeklychallenge.org/blog/future-in-perl

Hi All

Why aren't my links appearing....

Note: The first 3 links point to my personal page: http://savage.net.au

The Perl wiki has been renamed from Perl.html - which was too generic - to Perl.Wiki.html:
https://savage.net.au/misc/Perl.Wiki.html

The Mojolicious wiki is at:
https://savage.net.au/misc/Mojolicious.Wiki.html

The Debian wiki is at:
https://savage.net.au/misc/Debian.Wiki.html

Note: The next 2 links point to my new website: https://symboliciq.au

This will accompany my upcoming Youtube channel

The Symbolic Language wiki is at:
https://symboliciq.au/misc/Symbolic.Language.Wiki.html

The Personal Security wiki is at:
https://symboliciq.au/misc/Personal.Security.Wiki.html

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.