Text Extraction in Perl
Ever wanted to extract text from an image in Perl?
Here is my story to do the same.
Enjoy !!!
Ever wanted to extract text from an image in Perl?
Here is my story to do the same.
Enjoy !!!
This week felt like a PSC reunion meeting. We extended invitations to join us for a discussion of the version change to a number of core contributors, and ended up joined by ex-PSC members Ricardo and Paul (Neil would have joined, but couldn’t make it).
There is skepticism but no strong opposition. The benefits are in some doubt, and resources to implement this will not come from core contributors. So we want to experiment on a branch to get a handle on feasibility and viability, which we hope will give us better data to evaluate the proposal and, we hope, allay any worries.
We also briefly discussed our intentions for the PPC process with Paul. We are thinking about an automatically generated status page on GitHub Pages.
(English below)
Hallo zusammen,
wir laden Euch herzlich ein zum Deutschen Perl/Raku Workshop 2025.
Der Workshop findet nächstes Jahr vom Montag 12. Mai bis
Mittwoch 14. Mai im Kolpinghaus in München statt.
Die Webseite und der Call for Papers sind bereits online. Wir freuen uns auf viele interessante Vorträge!
Über Unterstützung durch Sponsoren freuen wir uns immer. Wenn Ihr bzw. Eure Firma den Workshop unterstützen möchtet, wendet Euch gerne an uns. Wir finden gemeinsam sicher eine Möglichkeit!
Wenn Ihr Fragen an die Organisatoren habt, erreicht Ihr uns am besten direkt unter orga2025@german-perl-workshop.de .
Wir freuen uns auf Eure Teilnahme,
Max Maischein für die Organisatoren und Frankfurt.pm
Wir arbeiten noch an
Hotelempfehlungen und veröffentlichen diese auf der Webseite.
Hello everybody,
we cordially invite you to the German Perl/Raku Workshop 2025.
The workshop will take place next year from Monday 12 May to
Wednesday 14 May at the Kolpinghaus in Munich..
The website and the call for papers are already online. We are looking forward to many interesting presentations!
I have just released a trial version of PPI that includes the first shot at support for Perl signatures. After installing it, you can access this feature in the following ways.
For users of perlcritic and other PPI consumers:
use 5.035;
or higher in your codeuse feature 'signatures';
in your codePPI_CUSTOM_FEATURE_INCLUDES='{MyStrict=>{signatures=>1}}' perlcritic Work.pm
For consumers of PPI, in addition to the above:
PPI::Document->new( custom_feature_includes => ... )
PPI::Document->new( feature_mods => ... )
PPI::Document->new( custom_feature_include_cb => ... )
::Element->presumed_features
In a similar way as signatures, the core try feature is also recognized.
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.
Only Aristotle and Philippe this time.
The Perl Community Conference is a hybrid in-person-and-online event held on December 18th from 10:30a-4:30p CST. Perl's 37th birthday, featuring talks from the world's top Perl programmers and community members. Topics include artificial intelligence, bioinformatics, web applications, chemometrics, genetics, data science, high performance computing, ethics, and much more! Join our mailing list to receive the latest updates!
Sign Up:
https://www.meetup.com/austin-perl-mongers/events/304573306/
We have secured a location for anyone looking for a place to participate in person to be. At least 2 Conference talks will be given and streamed LIVE from this location.
See some of the many accomplishments of the Science Perl Committee in just the last year:
At the conclusion of this Conference, we will be announcing our exciting plans for Summer 2025 and future Issues of the Science Perl Journal. Full abstracts for current Issue are now available for free at the site.
Cheers,
Brett Estrade (OODLER)
Science Perl Committee Chairman
Someone wanting to make a social media site (such as a Mastodon server & web client for example) will want to allow its users to post URLs, for which previews will be shown in their posts.
These posts will be visited by a UserAgent, but there is the risk that a private IP (disguised as a FQDN hostname that resolves to it) will be in the URL's host, and that might cause security issues.
I could use LWP::ParanoidAgent, but then I'd have to fork a process to make the whole thing async, like a good Mojolicious site will be, and too many processes running can be a problem. Also I'd be missing on the many Roles that exist for Mojo::Useragent.
So I opened this issue on Mojolicious's github wishing for a solution.
Have you used CPAN module MCE for parallel processing?
If not then you should checkout this post for introduction.
Recordings of all talks from this year's London Perl & Raku Workshop are now available on YouTube: https://www.youtube.com/playlist?list=PLxNdCz2kBhVlzbVFcjwY6GkQf4zBhvwFn.
The sound quality of the recordings is not fantastic. We had some sort of issue that I've tried to fix in post. However, the auto generated captions by YouTube tend to be pretty good these days, so enable those if you have any problems understanding the speaker.
I go into the details a bit more about this in a personal blog post about the event, and how much effort is involved in trying to create the recordings, amongst other things.
Thanks to this year's sponsors, without whom LPW would not have happened:
These are some answers to the Week 293, 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 November 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.
You are given a list of dominoes, @dominoes.
Write a script to return the number of dominoes that are similar to any other domino.
$dominoes[i] = [a, b] and $dominoes[j] = [c, d] are same if either (a = c and b = d) or (a = d and b = c).
Example 1
Input: @dominoes = ([1, 3], [3, 1], [2, 4], [6, 8])
Output: 2
Similar Dominoes: $dominoes[0], $dominoes[1]
Example 2
We were joined by Leon Timmermans and Tim Legge to discuss plans for TLS support in core.
Have you play with the new command line switch -g in Perl?
Please checkout this post for more information.
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:
All three of us attended.
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
Someone keeps registering and posting articles with links to the “skale.space” domain despite the fact that I keep deleting them, so I thought I should reward them for their effort.
They are some kind of blockchain shop (yeah, shady activities, how uncharacteristic, right?), so I don’t know that my usual note that you might want to know that if you do business with them is all that relevant, but, there you go.
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.
Another extended meeting, which everyone attended. Here’s a summary:
equ
and ===
are added to Perl, we think the negative versions (neu
and !==
) should be added as well.blogs.perl.org is a common blogging platform for the Perl community. Written in Perl with a graphic design donated by Six Apart, Ltd.