Promise in Perl

Recreating the Future using Promise::ES6.
Please checkout this post for more information.

Recreating the Future using Promise::ES6.
Please checkout this post for more information.
All three of us attended.
psc/ppc0025 branch. We have an initial proof of concept that is almost good enough to test against CPAN in order to assess whether the plan is actually feasible and proceed from there. We discussed the timeline for this.I was one of the organisers of the London Perl and Raku Workshop 2024, which happened last weekend. I've written about my own personal experience of this conference over on my personal blog.
A longer blog post will follow, likely on my personal site (I'll try to avoid it sitting in my drafts folder for too long). In the meantime, thanks to all who attended, spoke, volunteered, helped, advertised, promoted, linked to, encouraged, and so on, this year's London Perl & Raku Workshop. I think it worked out.
Scarves. This year's surprise swag, a 20th anniversary scarf rather than the usual t-shirt. We sill have a few of these left and I'm happy to send you one if you cover the cost of postage and packaging (roughly 15.- CHF). Please email the organisers if you would like one. It wil be first come (emailed) first served. Any that remain I will probably take to GPW next year to give away.
Videos. I will be processing these over the next couple of weeks. Expect them to be available on YouTube sometime mid November.
Feedback. If you attended the workshop it will really help us if you fill in the feedback form. All questions are optional and it is anonymous. Approximately 120 people attended the workshop - if half of you can complete the form that would be smashing.
Next Year? We have no plans. Yet.
Thanks to this year's sponsors, without whom LPW would not have happened:

Have you heard of CPAN module Scientist?
Please find below a gentle introduction.
https://theweeklychallenge.org/blog/scientist-in-perl
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.
These are some answers to the Week 292, 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 27, 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.
You are given an array of integers, @ints, where the largest integer is unique.
Write a script to find whether the largest element in the array is at least twice as big as every element in the given array. If it is return the index of the largest element or return -1 otherwise.
Example 1
After hundreds of hours of work and support from lots of people, the long promised Journal is here. That link will take you to some more information, on there a link to purchase is available. All proceeds go to supporting future Issues and events of the SPC and Perl Community Organization. At this time, an electronic version is not available due to end-of-year time constraints.
It may seem silly, but we spent extra time making sure the book spine looks good on a bookshelf and will look even better as the Issues accrue. Get it while it's hot. ISBN-13: 9798218984748, 152 pages.
Some of us are currently preparing for a block of Science Perl Talks at the London Perl & Raku Workshop 2024. We appreciate the organizers of this event for the opportunity.
More will be posted after the LPW, but the SPC is hosting the Perl Community Conference, Winter 2024 on December 18th (Perl's 37th birthday! :-)). If you are interested in getting published in the next Issue of the SPJ (Winter 2024), we are still accepting extended abstracts, which is up to 1 full page in the Journal and a 5 minute lightning talk slot at the Winter Conference.

Ever wanted to extract text from an image in Perl?
Here is my story to do the same.
Enjoy !!!
This week, we talked about some recent (and less recent) p5p threads:
These are some answers to the Week 291, 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 20, 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.
A draw poker hand consists of 5 cards, drawn from a pack of 52: no jokers, no wild cards. An ace can rank either high or low.
Write a script to determine the following three things:
1. How many different 5-card hands can be dealt?
2. How many different hands of each of the 10 ranks can be dealt? See here for descriptions of the 10 ranks of Poker hands: https://en.wikipedia.org/wiki/List_of_poker_hands#Hand-ranking_categories
3. Check then the numbers you get in step 2 by adding them together and showing that they're equal to the number you get in step 1.
To the old Perl programmers out there looking for a new language to learn, I suggest giving Julia a serious look. I haven't had a language bring me this much joy since when I first discovered Perl a long time ago. If Perl is the grandpa, Julia is the granddaughter, and she's a really smart girl. She hangs out with scientists all day helping them make sense of their data, and she does it with a unique style.
To be continued...
(There's so much I want to say, but I don't want to commit the time to write it all down right now.)

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.
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
The Personal Security wiki is at:
https://symboliciq.au/misc/Personal.Security.Wiki.html
(Not updated actually...) The Symbolic Language wiki is at:
https://symboliciq.au/misc/Symbolic.Language.Wiki.html
In my previous articles (#1 and #2), I covered the key activities of The Perl and Raku Foundation (TPRF), such as organizing conferences, providing grants, and other smaller initiatives. In this final article, I will explore TPRF's financials using publicly available data. As a U.S. 501(c)(3) nonprofit organization, TPRF is required to disclose their financial information to the IRS. As always, my opinions are my own and do not represent the views of the TPRF Board.
Revenue and Expenses: Year-to-Year Overview
Let's start by reviewing TPRF's revenue and expenses over the years.

Until 2019, both revenue and expenses fluctuated. However, in 2020, the financial landscape changed significantly, with both revenue and expenses dropping sharply. This trend continued into 2021, largely because TPRF held its conferences virtually, reducing costs but also potentially limiting revenue opportunities.
In 2023, TPRF experienced another sharp decline in revenue while expenses surged, leading to a large deficit of $140,213.
Here's a comparison of key financial figures over three years:
Revenue
These are some answers to the Week 291, 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 20, 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.
You are given an array of integers, @ints.
Write a script to find the leftmost middle index (MI) i.e. the smallest amongst all the possible ones.
A middle index is an index where
ints[0] + ints[1] + … + ints[MI-1] == ints[MI+1] + ints[MI+2] + … + ints[ints.length-1].
If MI == 0, the left side sum is considered to be 0. Similarly, if MI == ints.length - 1, the right side sum is considered to be 0.
Return the leftmost MI that satisfies the condition, or -1 if there is no such index.
Example 1

Have you used CPAN module MCE for parallel processing?
If not then you should checkout this post for introduction.
All three of us attended.
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.
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
blogs.perl.org is a common blogging platform for the Perl community. Written in Perl with a graphic design donated by Six Apart, Ltd.