February 08, 6pm CT ~ Houston Perl Mongers Zoom Meeting 🔗 Thu Jan 25 2024
Title: Using Perl Prototypes
When: Thur February 8th at 6:00-8:00 PM CT (+6 UTC)
Where: (virtual, see below):
https://us02web.zoom.us/j/920069702
Meeting ID: 920 069 702
Password can be found by running this statement.
perl -e 'print +(0b1000100).((3<<2)*10).(010)."\n"' # 681208
Original post:
https://houstonperlmongers.org/posts/3a99ac5b-f9f9-4409-a38c-e9ef91d972c8
Hey everyone,
Happy Holidays! Dancer2 1.1.0 has been released and is on its way to CPAN. It has one really awesome new feature: named routes.
With this update, you can name each route in your Dancer2 application, then refer to that route by name with a new keyword, uri_for_route. You have a lot of control over how this route is constructed, and can use it anywhere you were previously using uri_for. This helps you to avoid the need for lengthy URL references in your code, and makes it easier for you to build applications that are easier to grow, maintain, and later refactor.
You can read more about it in the Dancer2 manual, or check out the pull request that introduced the change. As a bonus, the Twelve Days of Dancer (our mini-advent calendar) launches this week, and Sawyer has written a great article that covers this new feature and keyword in-depth.
Happy Dancing!
Jason/CromeDome
These are some answers to the Week 262, 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 March 31, 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: Count Equal Divisible
You are given an array of integers, @ints and an integer $k.
Write a script to return the number of pairs (i, j) where
a) 0 <= i < j < size of @ints
b) ints[i] == ints[j]
c) i x j is divisible by k
Example 1
I am very pleased to announce that the 2024 Perl & Raku Conference Planning Committee (TPRC) is moving forward with the addition of a new track that targets academic, governmental, and industrial STEM applications. It will strive to be organized as a traditional science conference track; meaning the talks will be based on paper and poster submissions. (more on this in a future announcement!)
The decision by the TPRC Planning Committee is the result of an overwhelmingly positive response to the Science Track Survey that was held late in 2023. Everyone involved in organizing the survey deeply appreciates those who filled out the survey or shared it with others.
The track is being organized in tight cooperation with the TPRC, by the Science Perl Committee (SPC); a separately organized group of Perl and STEM enthusiasts that anyone of good will is welcome to join.
What to expect now: ...
I am sick and tired of hearing this, so let's put it this to the test. Assume you know little of Perl, or any programming language for that matter. Can you parse the code?
https://chrisarg.github.io/Killing-It-with-PERL/2023/12/06/Is-Perl-a-write-only-language.html
I hope the piece above is the first in a series to convince people to consider the reality before passing judgement. It was inspired by one of our research analysts discovering Perl and awk to simplify their lives when cleaning data.
These are some answers to the Week 262, 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 March 31, 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: Max Positive Negative
You are given an array of integers, @ints.
Write a script to return the maximum number of either positive or negative integers in the given array.
Example 1
Input: @ints = (-3, 1, 2, -1, 3, -2, 4)
Output: 4
Count of positive integers: 4
Count of negative integers: 3
Maximum of count of positive and negative integers: 4
Example 2
Three Perl releases have been published this past week, containing patches for security issues CVE-2023-47038 and CVE-2023-47039. This kept us busy for the past few weeks (explaining the somewhat thinner recent updates).
- Paul will publish a post-mortem on the recent releases, looking at what went wrong and some thoughts on how to improve it so those don’t happen again
- We discussed a plan to improve documentation of the security disclosure process
- We took note of what projects we have in flight (e.g. PPCs being implemented) and may find a way to keep that list published and updated
Season's Greetings, Perl!
I've spent almost all of my time since my [last post here](
https://blogs.perl.org/users/ingy_dot_net/2023/05/perl-toolchain-synergy.html)
working on a new programming language, YAMLScript.
It's working now and I've decided a do a [2023 Advent YAMLScript Blog](
https://yamlscript.org/posts/advent-2023/index/) for it.
The blog started last Friday and will continue (at least) until December 24th.
I encourage you to follow along. At some point this month YAMLScript modules
will become available for CPAN and Raku and many other languages.
I also encourage you to try writing an [Advent of Code 2023](
https://adventofcode.com/) solution in YAMLScript, if you are playing along
with AoC this year.
All the Best, Ingy döt Net
See Perl.html
It's an example of the fabulous TiddlyWiki (tiddlywiki.com), so it's about 230,000 bytes.
These are some answers to the Week 261, Task 2, of the Perl Weekly Challenge organized by Mohammad S. Anwar.
Spoiler Alert: This weekly challenge deadline is due in a couple of days from now (on March 24, 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: Multiply by Two
You are given an array of integers, @ints and an integer $start.
Write a script to do the following:
a) Look for $start in the array @ints, if found multiply the number by 2
b) If not found stop the process otherwise repeat
In the end return the final value.
Example 1
The PSC met today. In summary:
- Paul’s TPRF grant was accepted, he plans to spend some of that time to work on some PPCs first (
qt strings, overload)
- FOSDEM Perl Devroom CfP: none of us are planning to attend in person, but if someone else wanted to present on our behalf we could coördinate with them and work out a subject to talk about
- Discussed coming up with a Perl roadmap that we could present to the world (and entice sponsorship for TPRF’s Perl Development Fund and Grants program)
- We discussed opening up our meetings to the occasional guest, so they could see what we’re actually doing (boring!) and give us an outside perspective
I've struggled with the syntax highlighting here on this blog. I really want to use this site and I will continue to do so.
After trying in vain to get some "auto" syntax highlighting here via the editor, I reached for an old trick I've used in the past. Generating HTML using some external service. After a quick Google search, I found https://tohtml.com/perl/. Given a block of Perl code, it'll generate HTML based syntax highlighting that one may add to their post. For example,
Decent Syntax Highlighting (from tohtml.com/perl)
(English below)
Der nächste Deutsche Perl/Raku-Workshop wird vom 15. bis 17. April 2024 in Frankfurt stattfinden. Damit wir interessante drei Tage mit Perl und Raku verbringen können, brauchen wir Vorträge und Teilnehmer... Vortragsvorschläge könnt ihr bereits einreichen und auch anmelden könnt ihr euch schon hier...
https://act.yapc.eu/gpw2024
The German Perl/Raku workshop will take place
on the 15th to 17th April 2024 again in Frankfurt am Main.
We will spend three interesting days with Perl and Raku, so you are invited
to participate and also to give presentations.
You can submit your presentations here
These are some answers to the Week 261, Task 1, of the Perl Weekly Challenge organized by Mohammad S. Anwar.
Spoiler Alert: This weekly challenge deadline is due in a couple of days from now (on March 24, 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: Element Digit Sum
You are given an array of integers, @ints.
Write a script to evaluate the absolute difference between element and digit sum of the given array.
Example 1
Input: @ints = (1,2,3,45)
Output: 36
Element Sum: 1 + 2 + 3 + 45 = 51
Digit Sum: 1 + 2 + 3 + 4 + 5 = 15
Absolute Difference: | 51 - 15 | = 36
Example 2
I released Juliagraph an interactive fractal painter for Julia and Mandelbrot types of fractal.
We have had a good number of responses, but would like more. And time is running out! Please take this survey and share with your Perl contacts.
Survey URL: https://forms.gle/DDPWsNqEsZW8AyWX7
The track would target academic and industrial STEM applications, and emulate in some way traditional science conference tracks; meaning the talks would be based on paper and poster submissions. If this came to pass, the Science Perl Committee would also follow up with the publishing of the papers in an official proceedings of this track.
Survey officially closes on Thursday, November 23, 2023. But we would love your feedback!
Sincerely,
Brett Estrade
oodler@cpan.org
Chairman, Science Perl Committee
The Perl and Raku Foundation is thrilled to announce that the FOSDEM
organising team has accepted our proposal to set up a DevRoom on
Saturday, February 3rd 2024. It has been quite a few years since the
last Perl DevRoom at FOSDEM.
Historically, they have always been well attended and packed.
Time for an Update
Since last time, a lot has happened, and TPRF is excited to help create
this venue for sharing news with developers from Europe and across the
globe. Many FOSDEM visitors have a background using Perl, but may have
missed out on recent developments.
Larry Wall himself was a guest speaker at FOSDEM in 2015 to announce
Perl 6, which was later renamed to Raku. Much has happened since then,
and there is lots to share!
Participation
These are some answers to the Week 258, Task 2, of the Perl Weekly Challenge organized by Mohammad S. Anwar.
Spoiler Alert: This weekly challenge deadline is due in a couple of days from now (on March 3, 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: Sum of Values
You are given an array of integers, @int and an integer $k.
Write a script to find the sum of values whose index binary representation has exactly $k number of 1-bit set.
Example 1
Just Paul and Philippe this week:
- Paul volunteers to do the 5.39.9 release. We still need people for .10 and 5.40. The .10 release will be timed around PTS - so maybe we could do something “live” at the summit?
- Mailing list was otherwise quiet so there weren’t many issues to discuss.
In absence of many other pressing issues, we spent some time thinking ahead to large-scale development work that might take place in the 5.41 series. We talked about “hooks” as a potential long-term thought to making a more powerful Magic-like structure, for implementing new features, attributes, etc..
