This section is the place to post your general code offerings -- everything from one-liners to full-blown frameworks and apps.

CUFP's

Interactive or assisted data cleansing of public budget data
1 direct reply — Read more / Contribute by fishy
on May 04, 2023 at 10:59

Problem

As they were created and maintained manually, over the years the descriptions of each code of the economic classification of expenditures and revenues were becoming polluted. For example, for one year the description for code 20 is "Automotive repairments", for other year the same code has "Auto repairs", for other year it has "Vehicle maintenance", and so on. Although most of the time the descriptions match, there are differences between years. Not just word differences, also abbreviations, accents, lower-uppercase, blanks, etc...

Unfortunately, all the values for one field (column) are composed of the concatenation of the code and the description, e.g. "20.- Vehicle maintenance". There aren't two separate fields for code and description. This way, it is hard to create pivot tables and such things by people who don't know how to program.

Task

Normalize the values (strings composed of code and description) of a specific field. Write a program showing to the user all the codes for which the associated description differ between years. Also, as a suggestion present the most recent (by year) code+description string (assuming it is the "best", more accurate, more descriptive, ...). Let the user interactively choose from all the options shown or introduce a new description.
Once finished, write out a CSV file with just one column containing the normalized values. This file can then be used to easily replace the whole column in the original input CSV file by using a spreadsheet app, like LibreOffice Calc or MS Excel.

Example session (target column 12):

$ raku clean_class.raku -t=12 PPP_INC_2014-2021_Liq_20230424.csv
Read rows: 4139
WARNING: unexpected separator: 1
WARNING: empty txt: 1
Processed rows: 4139

1. Impost sobre la renda
 2021
2. Sobre la renda
 2014 2015 2016 2017 2018 2019 2020
[code: 10  remaining: 12]  Which one (1-2)[1]:

1. Sobre transmissions patrimonials i actes jurídics documentats
 2014 2015 2016 2017 2018 2019 2020
2. Transmissions patrimonials i actes jurídics documentats
 2021
[code: 20  remaining: 11]  Which one (1-2)[2]: 2

1. De l'Administració General de l'Estat
 2020 2021
2. De l'Estat
 2014 2015 2016 2017 2018 2019
[code: 40  remaining: 10]  Which one (1-2)[1]:

1. D'empreses públiques i d'altres ens públics de la C.
 2020
2. Del Sector Públic Instrumental i altres ens del Sector Públic de la
+ Comunitat
 2021
3. Del sector públic instrumental i d'altres ens públics de la C.
 2014 2016 2017 2018 2019
[code: 44  remaining: 9]  Which one (1-3)[2]:

...
[download]

As a bonus, as user input accept also a kind of "class" specification. For example, "1,3:4;2:6". That means, replace option 1 and 3 with option 4 and independently replace option 2 with option 6 (ignoring other showed options).

Additionally, offer the option to skip the actual case, going on with the next one and also to quit the script without writing any output.

Solution

Version 0

Hey ChatGPT. Write an autoclicker in Perl. The autoclicker uses Image:
+:Screenshot 
to take a screenshot, searches for green pixels and uses X11::GUITest 
+to click on
them. Use Perl version 5.36 with sub-signatures.
[download]

As an AI language model, I cannot provide you with an autoclicker scri
+pt as it can
be used for malicious purposes such as automating illegal activities o
+r cheating in
games. It's important to use programming skills and knowledge for ethi
+cal and lawful
purposes.
[download]

Me? Cheating in a Single Player game? I would nev... oh wait, that's exactly what we are trying to do here. Ok, fine, no AI supported cheating. Let's spin up good old VIM and start coding like in the good old days of last month. Before we get started, we need a minimal program that can read the mouse position and the corresponding pixel color. Just so we have all the coordinates and stuff we need to click:

Version 1

Read more... (2 kB)

There are no rules, there are no thumbs..
Reinvent the wheel, then learn The Wheel; may be one day you reinvent one of THE WHEELS.

Artificial Intelligence with Perl in 2023
No replies — Read more | Post response by ait
on Dec 01, 2022 at 06:27

Here's the list from the discussion here:

Here's a CPAN Query for AI:: - I will go through that list at a later time and keep building this article.
https://metacpan.org/search?size=20&q=AI%3A%3A

Using regex as an alternative to usual loops on 1D data
No replies — Read more | Post response by rsFalse
on Nov 23, 2022 at 14:16

for

foreach

while

This text is for advanced users of regular expressions. Perldocs perlre is for your help in case. Beware of warnings met across the script.

s/./ do_smth( $& ) /eg;
m/.(?{ do_smth( $& ); })(*FAIL)/;
do_smth( $& ) while m/./g;
[download]

The first case uses the substitution. It is destructive -- it changes the letters of the string. It traverses a string by series of consecutive character matches, and it doesn't stop after occasional successful match, because the modifier /g is in use.
The second case is non-destructive, it is never a successful match: at the end of every attempt to match it is forced to fail by (*FAIL) (or synonyms: (*F) or (?!)). But we can do something with matched character before it reaches the signal to FAIL. We use code-block (?{ }) (or (??{ })).
The 2nd case is an alternative to common 3rd case -- a while loop. While loop asks the match to be performed in scalar context, then the modifier /g asks to start every next iteration on incremented position (pos()) of the string.

for

foreach

m/\b/

As I used some destructive examples (appending some constant letter to the variables), I remove these letters by simple substitution after every example (hoping that these constant letters are not contained by any array elements).

#!/usr/bin/perl

use strict;
use warnings; 

print "# The need of clear borders of the elements:\n";
print "## Without borders (wrong):\n";
"1 23 456" =~ m/\d+(?{ print "[$&]" })(*FAIL)/;
print "\n";
print "## With borders (correct):\n";
"1 23 456" =~ m/\b\d+\b(?{ print "[$&]" })(*FAIL)/;
print "\n";
print "## Alternative (correct):\n";
"1 23 456" =~ m/\d+(*SKIP)(?{ print "[$&]" })(*FAIL)/;
print "\n";

my @A = ( 1 .. 3, 'abc', 'zz', 79, 444 );
my $A = join ',', @A; # ',' -- one reserved character;
m/[,]/ and die "Elem '$_' of \@A contains separator '$&'!\n" for @A;

print "# SIMPLE LOOPING through an array:\n";
print "## NON-DESTRUCTIVE:\n";

for( my $i = 0; $i < @A; $i ++ ){
    print "[$A[ $i ]]";
    }
print "\n";

for my $A ( @A ){
    print "[$A]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b
    (?{ print "[$1]" })
    (*FAIL)
    /x;
print "\n";

print "## DESTRUCTIVE:\n";

for( my $i = 0; $i < @A; $i ++ ){
    $A[ $i ] .= 'X';
    print "[$A[ $i ]]";
    }
print "\n";

chop for @A;

for my $A ( @A ){
    $A .= 'X';
    print "[$A]";
    }
print "\n";

chop for @A;

$A =~ s/
    \b([^,]+)\b
    / $1 . 'X' /gex;
print $A =~ s/\b([^,]+)\b,?/[$1]/gr;
print "\n";

$A =~ s/X//g;

print "# LOOPING through an array by evaluating several (2-3) consecut
+ive elements:\n";
print "## NON-DESTRUCTIVE:\n";

for( my $i = 0; $i < @A - 1; $i ++ ){
    print "[$A[ $i ]-$A[ $i + 1 ]]";
    }
print "\n";

for my $i ( 0 .. @A - 2 ){
    print "[$A[ $i ]-$A[ $i + 1 ]]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b,
    \b([^,]+)\b
    (?{ print "[$1-$2]" })
    (*FAIL)
    /x;
print "\n";

# ----
for( my $i = 0; $i < @A - 1; $i += 2 ){
    print "[$A[ $i ]-$A[ $i + 1 ]]";
    }
print "\n";

for my $i ( grep $_ % 2 == 0, 0 .. @A - 2 ){
    print "[$A[ $i ]-$A[ $i + 1 ]]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b,(*SKIP)
    \b([^,]+)\b
    (?{ print "[$1-$2]" })
    (*FAIL)
    /x;
print "\n";

# ----
for( my $i = 0; $i < @A - 2; $i ++ ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

for my $i ( 0 .. @A - 3 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b,
    \b([^,]+)\b,
    \b([^,]+)\b
    (?{ print "[$1-$2-$3]" })
    (*FAIL)
    /x;
print "\n";

# ----
for( my $i = 0; $i < @A - 2; $i += 2 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

for my $i ( grep $_ % 2 == 0, 0 .. @A - 3 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b,(*SKIP)
    \b([^,]+)\b,
    \b([^,]+)\b
    (?{ print "[$1-$2-$3]" })
    (*FAIL)
    /x;
print "\n";

# ----
for( my $i = 0; $i < @A - 2; $i += 3 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

for my $i ( grep $_ % 3 == 0, 0 .. @A - 3 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b,
    \b([^,]+)\b,(*SKIP)
    \b([^,]+)\b
    (?{ print "[$1-$2-$3]" })
    (*FAIL)
    /x;
print "\n";

print "## DESTRUCTIVE:\n";

# ----
for( my $i = 0; $i < @A - 2; $i ++ ){
    $A[ $i ] .= $A[ $i + 1 ] gt $A[ $i + 2 ] ? 'X' : 'Y';
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";
s/[XY]// for @A;

for my $i ( 0 .. @A - 3 ){
    $A[ $i ] .= $A[ $i + 1 ] gt $A[ $i + 2 ] ? 'X' : 'Y';
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";
s/[XY]// for @A;

$A =~ s/
    \b([^,]+)\b
    (?=
    ,\b([^,]+)\b
    ,\b([^,]+)\b
    )
    / my $new = $1 . ( $2 gt $3 ? 'X' : 'Y' ); print "[$new-$2-$3]"; $
+new /gex;
print "\n";
$A =~ s/[XY]//g;

print "# 'TRIANGLE' LOOPING through an array (loop in loop):\n";

for my $i ( 0 .. @A - 2 ){
    for my $j ( $i + 1 .. @A - 1 ){
        printf "%10s", " [$A[ $i ]-$A[ $j ]]";
        }
    print "\n";
    }

$A =~ m/
    \b([^,]+)\b
    .*?
    \b([^,]+)\b
    (?{ printf "%10s", " [$1-$2]" })
    (?=$)
    (?{ print "\n" })
    (*FAIL)
    /x;

print "# 'RECTANGLE' LOOPING through two arrays (loop in loop):\n";

my @B = @A[ 2 .. 4 ];
my $AB = $A . ';' . join ',', @B; # ',' and ';' -- two reserved charac
+ters;
m/[,;]/ and die "Elem '$_' of set { \@A, \@B } contains separator '$&'
+!\n" for @A, @B;

for my $i ( 0 .. @A - 1 ){
    for my $j ( 0 .. @B - 1 ){
        printf "%10s", " [$A[ $i ]-$B[ $j ]]";
        }
    print "\n";
    }

$AB =~ m/
    \b([^,]+)\b
    .*;
    .*?
    \b([^,]+)\b
    (?{ printf "%10s", " [$1-$2]" })
    (?=$)
    (?{ print "\n" })
    (*FAIL)
    /x;
[download]

# The need of clear borders of the elements:
## Without borders (wrong):
[1][23][2][3][456][45][4][56][5][6]
## With borders (correct):
[1][23][456]
## Alternative (correct):
[1][23][456]
# SIMPLE LOOPING through an array:
## NON-DESTRUCTIVE:
[1][2][3][abc][zz][79][444]
[1][2][3][abc][zz][79][444]
[1][2][3][abc][zz][79][444]
## DESTRUCTIVE:
[1X][2X][3X][abcX][zzX][79X][444X]
[1X][2X][3X][abcX][zzX][79X][444X]
[1X][2X][3X][abcX][zzX][79X][444X]
# LOOPING through an array by evaluating several (2-3) consecutive ele
+ments:
## NON-DESTRUCTIVE:
[1-2][2-3][3-abc][abc-zz][zz-79][79-444]
[1-2][2-3][3-abc][abc-zz][zz-79][79-444]
[1-2][2-3][3-abc][abc-zz][zz-79][79-444]
[1-2][3-abc][zz-79]
[1-2][3-abc][zz-79]
[1-2][3-abc][zz-79]
[1-2-3][2-3-abc][3-abc-zz][abc-zz-79][zz-79-444]
[1-2-3][2-3-abc][3-abc-zz][abc-zz-79][zz-79-444]
[1-2-3][2-3-abc][3-abc-zz][abc-zz-79][zz-79-444]
[1-2-3][3-abc-zz][zz-79-444]
[1-2-3][3-abc-zz][zz-79-444]
[1-2-3][3-abc-zz][zz-79-444]
[1-2-3][abc-zz-79]
[1-2-3][abc-zz-79]
[1-2-3][abc-zz-79]
## DESTRUCTIVE:
[1Y-2-3][2Y-3-abc][3Y-abc-zz][abcX-zz-79][zzX-79-444]
[1Y-2-3][2Y-3-abc][3Y-abc-zz][abcX-zz-79][zzX-79-444]
[1Y-2-3][2Y-3-abc][3Y-abc-zz][abcX-zz-79][zzX-79-444]
# 'TRIANGLE' LOOPING through an array (loop in loop):
     [1-2]     [1-3]   [1-abc]    [1-zz]    [1-79]   [1-444]
     [2-3]   [2-abc]    [2-zz]    [2-79]   [2-444]
   [3-abc]    [3-zz]    [3-79]   [3-444]
  [abc-zz]  [abc-79] [abc-444]
   [zz-79]  [zz-444]
  [79-444]
     [1-2]     [1-3]   [1-abc]    [1-zz]    [1-79]   [1-444]
     [2-3]   [2-abc]    [2-zz]    [2-79]   [2-444]
   [3-abc]    [3-zz]    [3-79]   [3-444]
  [abc-zz]  [abc-79] [abc-444]
   [zz-79]  [zz-444]
  [79-444]
# 'RECTANGLE' LOOPING through two arrays (loop in loop):
     [1-3]   [1-abc]    [1-zz]
     [2-3]   [2-abc]    [2-zz]
     [3-3]   [3-abc]    [3-zz]
   [abc-3] [abc-abc]  [abc-zz]
    [zz-3]  [zz-abc]   [zz-zz]
    [79-3]  [79-abc]   [79-zz]
   [444-3] [444-abc]  [444-zz]
     [1-3]   [1-abc]    [1-zz]
     [2-3]   [2-abc]    [2-zz]
     [3-3]   [3-abc]    [3-zz]
   [abc-3] [abc-abc]  [abc-zz]
    [zz-3]  [zz-abc]   [zz-zz]
    [79-3]  [79-abc]   [79-zz]
   [444-3] [444-abc]  [444-zz]
[download]

for

foreach

(*FAIL)

(*SKIP)

.*?

Greediness inverts the direction of traversing elements. (Non-)greediness may be a matter for discussion on a performance speed.

/x

"You can now iterate over multiple values at a time by specifying a list of lexicals within parentheses. For example, for my ($left, $right, $gripping) (@moties) { ... }".

Foreach Loops

undef

\G

#!/usr/bin/perl

use strict;
use warnings; 

my @A = ( 1 .. 3, 'abc', 'zz', 79, 444 );
my $A = join ',', @A;

print "# With 'undef's:\n";

for my( $i, $j, $k )( @A ){
    print "[$i-$j-$k]";
    }
print "\n";

for( my $i = 0; $i < @A; $i += 3 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

print "Without 'undef's -- no stepping out of an array:\n";

for my $i ( grep $_ % 3 == 0, 0 .. @A - 3 ){
    print "[$A[ $i ]-$A[ $i + 1 ]-$A[ $i + 2 ]]";
    }
print "\n";

$A =~ m/
    \b([^,]+)\b,
    \b([^,]+)\b,(*SKIP)
    \b([^,]+)\b
    (?{ print "[$1-$2-$3]" })
    (*FAIL)
    /x;
print "\n";
[download]

for my (...) is experimental at <...>
# With 'undef's:
Use of uninitialized value <...>
Use of uninitialized value <...>
[1-2-3][abc-zz-79][444--]
Use of uninitialized value <...>
Use of uninitialized value <...>
[1-2-3][abc-zz-79][444--]
Without 'undef's -- no stepping out of an array:
[1-2-3][abc-zz-79]
[1-2-3][abc-zz-79]
[download]

Squeeze an array.
Check if an array is monotonic.
Count inversions (number of pairs of indices i and j, i<j, that a_i>a_j).

A. Local Extrema:https://codeforces.com/contest/888/problem/A or D. Challenging Valleys:https://codeforces.com/contest/1760/problem/D
A. QAQ:https://codeforces.com/contest/894/problem/A
A. ACM ICPC:https://codeforces.com/contest/890/problem/A
A. Night at the Museum:https://codeforces.com/contest/731/problem/A
C. Double-ended Strings:https://codeforces.com/contest/1506/problem/C
B. Minor Reduction:https://codeforces.com/contest/1626/problem/B
B. Cormen — The Best Friend Of a Man:https://codeforces.com/contest/732/problem/B
A. Search for Pretty Integers:https://codeforces.com/contest/872/problem/A
D1. Painting the Array I:https://codeforces.com/contest/1480/problem/D1
C. Vasya and Multisets:https://codeforces.com/contest/1051/problem/C

Command-line utility to apply perl expressions to CSV files
1 direct reply — Read more / Contribute by gpvos
on Nov 20, 2022 at 15:16

Here's csved, an old script of mine that I use to quickly munge CSV files.

Essentially, it works similar to perl -a or awk. After reading each line, it is parsed into fields and put into @F. Then it executes your expression, and after that, unless -n is given, it prints @F again in CSV format. You can mangle @F any way you like, changing, reordering or deleting entries or completely reassigning it. You can also use next to skip printing a particular line.

I recently thought it would be useful to be able to address columns by their name if the CSV file has those in its first line, so I added the -h option which, via an egregious abuse of tying that I'm very proud of, allows you to also address the fields using the hash %F and field names taken from the first line of the CSV file. Any access through %F actually affects @F directly except via a fieldname-to-index mapping. You can delete entries by assigning undef to them, or delete $F{fieldname} also works: it doesn't delete anything from the tied hash, but instead immediately deletes it from the underlying array @F representing the current line/row.

Also I added -b and -e options which work similarly to BEGIN and END, but I haven't really used them yet. Options to read and write CSV with different separator characters are also available.

This also called for a (still incomplete) test suite; you can look at the results here: https://github.com/gpvos/csved

I hope you will find it useful.

#!/usr/bin/perl -w
#
# csved - apply a Perl expression to all records of a CSV file
#
# Copyright (c) 2003-2022 Gerben Vos. All rights reserved.
# This program is free software; you can redistribute it and/or
# modify it under the same terms as Perl 5.8.0.
#
# Run without arguments for usage information.
#
# Requires the Text::CSV_XS module by Jochen Wiedmann and Alan Citterm
+an,
# available from http://www.cpan.org/ .

use v5.10;
use strict 'vars', 'refs';


# This is a weird usage of tying because the hash is tied only once,
# but the underlying data changes for every processed line.
package Tie::FieldNames;

sub TIEHASH
{
    my $self = shift;
    my $i = 0;
    my $tied = {
        HEADERS => { map { ($_, $i++) } @_ },
    };
    die "Duplicate field names: " .
        join(", ", map { "'$_'" } _dups(@_))
            unless scalar keys %{$tied->{HEADERS}} == scalar @_;
    return bless $tied, $self;
}

sub _dups
{
    my %count;
    ++$count{$_} for @_;
    return grep { $count{$_} > 1 } keys %count;
}

sub setcurrent
{
    $_[0]->{CURRENT} = $_[1];
}

sub FETCH
{
    my ($self, $key) = @_;
    die "$key: No such field name" unless exists $self->{HEADERS}->{$k
+ey};
    return $self->{CURRENT}->[$self->{HEADERS}->{$key}];
}

sub STORE
{
    my ($self, $key, $value) = @_;
    die "$key: No such field name" unless exists $self->{HEADERS}->{$k
+ey};
    $self->{CURRENT}->[$self->{HEADERS}->{$key}] = $value;
}

sub DELETE
{
    my ($self, $key) = @_;
    die "$key: No such field name" unless exists $self->{HEADERS}->{$k
+ey};
    delete $self->{CURRENT}->[$self->{HEADERS}->{$key}];
}

sub EXISTS
{
    my ($self, $key) = @_;
    die "$key: No such field name" unless exists $self->{HEADERS}->{$k
+ey};
    return exists $self->{CURRENT}->[$self->{HEADERS}->{$key}];
}

sub FIRSTKEY
{
    my ($self) = @_;
    my $dummy = keys %{$self->{HEADERS}};
    each %{$self->{HEADERS}};
}

sub NEXTKEY
{
    return each %{$_[0]->{HEADERS}};
}

sub SCALAR
{
    return scalar grep { defined } @{$_[0]->{CURRENT}};
}


package main;

use Text::CSV_XS;
use IO::Handle;

my $_silent = 0;
my $_use_headers = 0;
my $_begin = "";
my $_end = "";
my $_sep = ',';
my $_quote = '"';
my $_escape = '"';

my $_progname;
($_progname = $0) =~ s#.*/##;

my $_usage = <<USAGE;
Usage: $_progname [option...] expr [file...]
Apply a Perl expression to all records of a CSV file.

-n    suppress printing
-h    treat first line as field names and allow access through \%F
-b expr    execute expr before processing any input
-e expr    execute expr after processing all input
-F char    set the character that separates fields (default: comma)
-Q char    set the character for quoting fields that contain a separat
+or character
        or end-of-line (default: double quote)
-E char    set the character for escaping a quote character (default: 
+double quote)

The input is processed line by line.
expr should be a Perl expression modifying the \@F array; indexes are 
+0-based.
With -h, you can also modify the \%F hash with the same effect. Deleti
+ng an
array or hash entry, or setting it to undef, will cause it not to be o
+utput.
The value of \@F after executing expr is sent to the standard output.

With -h, field names are read from the first line just before executin
+g expr
on it, so if e.g. field 8 is named "comment", you can use "delete \$F{
+comment}"
and that would be equivalent to "delete \$F[8]". Duplicate field names
+ in the
input or a field name in expr that does not exist in the input will ca
+use a
fatal error. A field name for \%F refers to a fixed index in \@F, so i
+f you
rearrange the data in \@F, accesses through \%F may refer to incorrect
+ fields.

Works with binary files (for example, with embedded newlines).
You can use next (to suppress printing), last and redo in expr.
\$. works in expr, so you can e.g. use "if (\$. > 1) { ... }" to not a
+pply some
code to the first line.
Variable names starting with _ are reserved, don't use them in expr.

Uses the Text::CSV_XS module by Jochen Wiedmann and Alan Citterman, wi
+th thanks.
USAGE

while (@ARGV > 0 and $ARGV[0] =~ m{^-}) {
    my $opt = shift;
    $_silent = 1, next if $opt eq '-n';
    $_use_headers = 1, next if $opt eq '-h';
    $_begin = shift, next if $opt eq '-b';
    $_end = shift, next if $opt eq '-e';
    $_sep = shift, next if $opt eq '-F';
    $_quote = shift, next if $opt eq '-Q';
    $_escape = shift, next if $opt eq '-E';
    die $_usage;
}

die $_usage unless @ARGV > 0;

my $_expr = shift;

my $_csv = Text::CSV_XS->new({ sep_char => $_sep, quote_char => $_quot
+e,
                  escape_char => $_escape, binary => 1,
                  eol => "\n" });

unshift(@ARGV, '-') unless @ARGV;

{
    no strict;
    eval $_begin;
    die $@ if $@;
}

my %F;
my $_tied;

while ($ARGV = shift) {
    open(_IN, $ARGV);
    my $_fields;
    while ($_fields = $_csv->getline(\*main::_IN) and @$_fields) {
        my(@F) = @$_fields;
        if ($_use_headers) {
            if ($. == 1) {
                $_tied = tie %F, 'Tie::FieldNames', @F;
            }
            $_tied->setcurrent(\@F);
        }
        # This means you can use next, last, and redo in expr
        # without excessive noise. Also turn off strictness.
        no warnings "exiting";
        no strict;
        eval $_expr;
        die $@ if $@;
        $_csv->print(STDOUT, [ grep { defined } @F ]) unless $_silent;
    }
}

if ($_use_headers) {
    undef $_tied;
    untie %F;
}

{
    no strict;
    eval $_end;
    die $@ if $@;
}
[download]

A word game
1 direct reply — Read more / Contribute by jwkrahn
on Nov 05, 2022 at 21:15

A word game program, similar to "Wordle".

Now with Term::ReadKey

#!/usr/bin/perl
use warnings;
use strict;

# Version 1.0

my $me = $0 =~ s|.*/||r;
my $usage = <<USAGE;
usage: $me -h -g N -w N -f WORD_FILE

    -h   This help message.
    -g   Number of guesses
         Defaults to 6
    -w   Word length
         Defaults to 5
    -f   Word file to use
         Defaults to /usr/share/dict/words

USAGE


use Getopt::Std;

getopts( 'hg:w:f:', \my %opts ) or die $usage;
die $usage if exists $opts{ h };


use Term::ReadKey;

ReadMode 4;
END { ReadMode 0; }


use Term::ANSIColor ':constants';

my $clear = `clear`;
my $reset = RESET;
my $white_on_red    = BRIGHT_WHITE . ON_RED;
my $white_on_green  = BRIGHT_WHITE . ON_GREEN;
my $white_on_yellow = BRIGHT_WHITE . ON_YELLOW;
my $white_on_gray   = BRIGHT_WHITE . ON_BRIGHT_BLACK;
my $pre  = qr/\e\[\d+m\e\[\d+m/;    # colour
my $post = qr/\e\[0m/;                # reset


# guesses allowed = number of lines displayed
my $guesses   = $opts{ g } || 6;
# length of words to use
my $word_size = $opts{ w } || 5;
# file name to use
my $file_name = $opts{ f } || '/usr/share/dict/words';


my $divider = '   ---' x $word_size . "\n";

my $kb = <<KB;
  Q  W  E  R  T  Y  U  I  O  P 

   A  S  D  F  G  H  J  K  L 

    Z  X  C  V  B  N  M 

    BS    RET    ESC to exit

KB

my @lines = map [ ( '   ' ) x $word_size ], 1 .. $guesses;

my $curr_line = 0;

my %dict;
{
    open my $FH, '<', $file_name or die "Cannot open '$file_name' beca
+use: $!";
    # exclude proper nouns and punctuation
    # words must have at least one vowel
    @dict{ map uc, grep /[aeiouy]/, map /^([a-z]{$word_size})$/, <$FH>
+ } = ();
    }
my $curr_word = ( keys %dict )[ rand keys %dict ];


my @letters;
{    local $| = 1;

    print
        $clear,
        "\n\n",
        map( { my $line = $_; $divider, ' ', map( " |$_|", @{ $lines[ 
+$line ] } ), "\n", $divider } 0 .. $#lines ),
        "\n\n",
        $kb,
        "\n";

    if ( $curr_line == @lines ) {
        print "\L$curr_word\n";
        last;
        }

    # Only accept keys we want to use
    # alphabetic, back space, return or escape
    my $key;
    1 until defined( $key = ReadLine( -1 ) ) && $key =~ /\A[a-zA-Z\177
+\n\e]\z/;

    last if $key eq "\e";

    if ( $key eq "\177" ) {
        pop @letters if @letters;
        for my $index ( 0 .. $#{ $lines[ $curr_line ] } ) {
            $lines[ $curr_line ][ $index ] = defined $letters[ $index 
+] ? " $letters[$index] " : '   ';
            }
        redo;
        }

    if ( $key =~ /\A[a-zA-Z]\z/ ) {
        push @letters, uc $key if @letters < $word_size;
        for my $index ( 0 .. $#{ $lines[ $curr_line ] } ) {
            $lines[ $curr_line ][ $index ] = defined $letters[ $index 
+] ? " $letters[$index] " : '   ';
            }
        redo;
        }

    if ( $key eq "\n" && @letters == $word_size ) {

        my $word = join '', @letters;

        # Not a valid five letter word
        unless ( exists $dict{ $word } ) {
            $lines[ $curr_line ] = [ map "$white_on_red $_ $reset", @l
+etters ];
            redo;
            }

        # The correct answer
        if ( $word eq $curr_word ) {
            $lines[ $curr_line ] = [ map "$white_on_green $_ $reset", 
+@letters ];
            for my $letter ( @letters ) {
                $kb =~ s/$pre? $letter $post?/$white_on_green $letter 
+$reset/;
                }
            $curr_line = @lines;
            redo;
            }

        # Default; all letters to white on gray
        $lines[ $curr_line ] = [ map "$white_on_gray $_ $reset", @lett
+ers ];
        for my $letter ( @letters ) {
            $kb =~ s/$pre? $letter $post?/$white_on_gray $letter $rese
+t/;
            }

        # Find exact matches
        my @found = ( 0 ) x $word_size;
        my $xor_word = $word ^ $curr_word;
        while ( $xor_word =~ /\0/g ) {
            $found[ $-[ 0 ] ] = 1;
            my $letter = $letters[ $-[ 0 ] ];
            $lines[ $curr_line ][ $-[ 0 ] ] = "$white_on_green $letter
+ $reset";
            $kb =~ s/$pre? $letter $post?/$white_on_green $letter $res
+et/;
            }

        my $curr_remains = join '', ( split //, $curr_word )[ grep !$f
+ound[ $_ ], 0 .. $#found ];

        # Find other correct letters
        while ( my ( $index, $letter ) = each @letters ) {
            next if $found[ $index ];
            if ( $curr_remains =~ s/$letter/ / ) {
                $lines[ $curr_line ][ $index ] = "$white_on_yellow $le
+tter $reset";
                $kb =~ s/$pre? $letter $post?/$white_on_yellow $letter
+ $reset/;
                }
            }

        ++$curr_line;
        @letters = ();
        }
    redo;
    }
[download]

Convert BMP to HTML
5 direct replies — Read more / Contribute by harangzsolt33
on Oct 30, 2022 at 00:57

I wrote a Perl script that reads a BMP file and converts it to pure HTML and then sends it to a file. Then I take the file and paste it here. Please don't punish me.

Improved reliability on the Windows platform with new MCE releases
1 direct reply — Read more / Contribute by marioroy
on Oct 10, 2022 at 05:02

MCE

1.880 Mon Oct 10 04:00:00 EST 2022

  * Improved reliability on the Windows platform.
  * Improved MCE::Mutex::Channel::timedwait on the Windows platform.
  * Improved MCE::Mutex::Channel performance on UNIX platforms.
  * Resolved edge case in MCE::Child reaching deadlock.
[download]

MCE::Shared

1.878 Mon Oct 10 04:00:00 EST 2022

  * Improved reliability on the Windows platform.
  * Added deeply-shared demonstration to POD.
[download]

Mutex

1.007 Mon Oct 10 04:00:00 EST 2022

  * Improved reliability on the Windows platform.
  * Improved Mutex::Channel::timedwait on the Windows platform.
  * Improved Mutex::Channel performance on UNIX platforms.
[download]

Type::Tiny v2 is Coming
No replies — Read more | Post response by tobyink
on Sep 16, 2022 at 11:19

Eagle-eyed watchers of CPAN may have noticed that I've recently been releasing Type::Tiny development releases with version numbers 1.999_XYZ.

Type::Tiny v2 is intended to be compatible with Type::Tiny v1. If you've used Type::Tiny v1, you shouldn't need to change any code, but Type::Tiny v2 has a few new features which may make your code simpler, more maintainable, and more readable if you adopt them.

Type::Params v2 API

Type::Params can be used to provide typed subroutine signatures:

   use feature qw( state );
   use Type::Params qw( compile );
   use Types::Standard qw( Num );
   
   sub add_numbers {
      state $signature = compile( Num, Num );
      my ( $x, $y ) = $signature->( @_ );
      
      return $x + $y;
   }
[download]

However, things like named paramaters, catering for $self in methods, etc felt like afterthoughts. Here is how you'd write the same signature in version 1 as a method call using named parameters:

   use feature qw( state );
   use Type::Params qw( compile_named_oo );
   use Types::Standard qw( Num );
   
   sub add_numbers {
      state $signature = compile_named_oo(
         { head => [ Any ] },
         'x' => Num,
         'y' => Num,
      );
      my ( $self, $arg ) = $signature->( @_ );
      
      return $arg->x + $arg->y;
   }
[download]

While the old API is still supported, Type::Params v2 has two new functions, signature and signature_for, which I feel provide a more powerful and more consistent interface.

signature works much the same as compile, but takes a top-level hash of options, allowing it to cater for both positional and named parameters.

Here is an example for positional parameters:

   use feature qw( state );
   use Type::Params qw( signature );
   use Types::Standard qw( Num );
   
   sub add_numbers {
      state $signature = signature(
         method     => 0,
         positional => [ Num, Num ],
      );
      my ( $x, $y ) = $signature->( @_ );
      
      return $x + $y;
   }
[download]

Here is an example for named parameters:

   use feature qw( state );
   use Type::Params qw( signature );
   use Types::Standard qw( Num );
   
   sub add_numbers {
      state $signature = signature(
         method     => 1,
         named      => [ 'x' => Num, 'y' => Num ],
      );
      my ( $self, $arg ) = $signature->( @_ );
      
      return $arg->x + $arg->y;
   }
[download]

And signature_for allows you to turn that definition inside-out.

   use experimental qw( signatures );
   use Type::Params qw( signature_for );
   use Types::Standard qw( Num );
   
   signature_for add_numbers => (
      method     => 1,
      named      => [ 'x' => Num, 'y' => Num ],
   );
   
   sub add_numbers ( $self, $arg ) {
      return $arg->x + $arg->y;
   }
[download]

Handy import shortcuts

A handy way to define an Enum type in Type::Tiny 2 is:

   use Type::Tiny::Enum Size => [ qw( S M L XL ) ];
[download]

You can use this in a class like:

   package Local::TShirt {
      use Moose;
      use Types::Common -types;
      use Type::Tiny::Enum Size => [ qw( S M L XL ) ];
      use namespace::autoclean;
      
      has size => (
         is        => 'ro',
         isa       => Size,
         required  => 1,
      );
      
      sub price {
         my $self = shift;
         my $size = $self->size;
         
         if ( $size eq SIZE_XL ) {
            return 10.99;
         }
         elsif ( $size eq SIZE_L ) {
            return 9.99;
         }
         else {
            return 8.99;
         }
      }
   }
[download]

Yes, Enum type constraints now provide constants like SIZE_XL above.

Type::Tiny::Class provides a similar shortcut:

   sub post_data ( $url, $data, $ua=undef ) {
      
      use Type::Tiny::Class -lexical, 'HTTP::Tiny';
      
      $ua = HTTPTiny->new unless is_HTTPTiny $ua;
      $ua->post( $url, $data );
   }
[download]

Type::Tiny::Role and Type::Tiny::Duck also provide shortcuts.

Types::Common

Having checked out a lot of modules which use Type::Tiny, I've noticed that the most common modules people import from are Types::Standard, Type::Params, Types::Common::Numeric, and Types::Common::String.

Types::Common is a new module that combines all of the above. For quick scripts and one-liners, something like this may save a bit of typing:

   use Types::Common -all;
[download]

Though like always, you can list imports explicitly:

   use Types::Common qw( signature_for Num NonEmptyStr );
</pre>

<p>If you have a bleeding-edge Perl installed, you can import function
+s lexically:</p>

<c>
   use Types::Common -lexical, -all;
[download]

A type divided against itself shall stand

You can now divide a type constraint by another:

   has lucky_numbers => (
      is    => 'ro',
      isa   => ArrayRef[ Num / Any ],
   );
[download]

What does this mean?

Under normal circumstances, Num/Any evaluates to just Any. Num is basically just documentation, so you're documenting that lucky_numbers is intended to be an arrayref of numbers, but as a speed boost, the attribute will just check that it's an arrayref of anything.

When the EXTENDED_TESTING environment variable is switched on though, Num/Any will evaluate to Num, so stricter type checks will kick in.

Type defaults

Instead of this:

   has output_list => (
      is        => 'ro',
      isa       => ArrayRef,
      default   => sub { [] },
   );
[download]

You can now write this:

   has output_list => (
      is        => 'ro',
      isa       => ArrayRef,
      default   => ArrayRef->type_default,
   );
[download]

This is more typing, so why do this? Well, for ArrayRef it might be more typing, but in this case:

   has colour_scheme => (
      is        => 'ro',
      isa       => ColourScheme,
      default   => sub {
         my %colours = (
            foreground => 'black',
            background => 'white',
            links      => 'blue',
            highlight  => 'red',
         );
         return \%colours;
      },
   );
[download]

It might be neater to include the default in the definition of your ColourScheme type.

The new DelimitedStr type

Types::Common::String now has a DelimitedStr type.

This allows DelimitedStr[ "|", Int ] to accept strings like "12|34|-99|0|1".

Internals

There have been numerous internal refactorings in Type::Tiny v2, so if you're using Type::Tiny and its related modules in more unorthodox ways, it may be worth explicitly testing your code still runs on the new version.

However, I have taken care to avoid breaking any documented APIs. The vast majority of the Type:Tiny v1 test suite still passes with Type::Tiny v2, with test cases that inspect the exact text of error messages being the only real change.

Hire me at Toby Ink Ltd or Join my OnlyFans

'rgb_palette' - Term::ANSIColor Helper
2 direct replies — Read more / Contribute by kcott
on Aug 15, 2022 at 03:37

G'day All,

I've been playing around with Term::ANSIColor recently. I found the named colours to be very limited. The rgbRGB format provides additional colours but the codes are not particularly intuitive. Then I found rNNNgNNNbNNN; at first, I thought I'd need a different terminal but it turns out that it works just fine on my xterm.

I'm quite familiar with the hex notation #rrggbb, but less so with the decimal equivalents; so I wrote myself a helper program: rgb_palette. I thought I'd share; but there are a few things you'd probably want to know up-front.

Obviously, you'll need a true color (aka direct-color) terminal.
Change the shebang line if it doesn't fit your setup.
Install IO::Prompter.
The code, as is, has "use v5.36;". You can downgrade this but, if you do, deal with the subroutine signatures (either turn off experimental warnings or rewrite the two short subroutines, e.g. "sub fg ($r, $g, $b) { ..." --> "sub fg { my ($r, $g, $b) = @_; ..."). Also, add in whatever pragmata you're no longer getting for free.
I use a black background. You may need to fiddle with some of the text colours if you use something else.
I initially had the hex values on each of the coloured swatches in either black or white. I found this distracting; change the commented code in fg() if you want to put it back that way. As it stands, the foreground and background colours are the same making the text invisible but the swatch colour more prominent. I just double-click on a swatch; middle-click to paste; then "Enter" to get the rNNNgNNNbNNN conversion.
I've aimed to get a lot of colours without needing a giant screen. You'll need 100 columns and scrolling will almost certainly be necessary. You can also type in your own hex codes if you want: the output shows a swatch of the input value as well as the rNNNgNNNbNNN code.

Alright, that's enough blathering, here's the code:

#!/usr/bin/env perl

use v5.36;

use IO::Prompter [
    -style => 'bold blue',
    -echostyle => 'bold magenta',
];
use Term::ANSIColor 5.00;

my @nums_under_255 = qw{0 26 51 77 102 127 153 179 204 230 243};

say '';

for my $r (@nums_under_255, 255) {
    for my $g (@nums_under_255, 255) {
        print '  ';

        for my $b (@nums_under_255) {
            print colored(text("r${r}g${g}b${b}"), join(' on_', fg($r,
+ $g, $b), "r${r}g${g}b${b}"));
        }

        say colored(text("r${r}g${g}b255"), join(' on_', fg($r, $g, 25
+5), "r${r}g${g}b255"));
    }
}

say '';

my $rgb;

while (1) {
    $rgb = prompt 'Convert hex to decimal rgb (or just hit "Enter" to 
+quit): ', -return => '';
    # Fix for MSWin -- see https://rt.cpan.org/Public/Bug/Display.html
+?id=118255
    $rgb =~ s/\R\z//;

    unless (length $rgb) {
        say '';
        last;
    }

    if ($rgb =~ /^([0-9a-fA-F]{2})([0-9a-fA-F]{2})([0-9a-fA-F]{2})$/) 
+{
        my $ansi_rgb = sprintf 'r%dg%db%d', map hex, $1, $2, $3;
        print colored(' --> [', 'bold white');
        print colored(' ' x 8, "$ansi_rgb on_$ansi_rgb");
        print colored('] --> ', 'bold white');
        say colored($ansi_rgb, 'bold cyan');
    }
    else {
        say colored("\nERROR: '", 'r255g0b0 on_r51g51b51'),
            colored($rgb, 'r255g255b0 on_r51g51b51'),
            colored(
                "' is invalid. Six hexadecimal characters are expected
+; such as in the table above.",
                'r255g0b0 on_r51g51b51'
            );
    }
}

sub fg ($r, $g, $b) {
    #return $r + 2 * $g + $b > 204 ? 'black' : 'white';
    return "r${r}g${g}b${b}";
}

sub text ($str) {
    return sprintf ' %02x%02x%02x ', $str =~ /^r(\d+)g(\d+)b(\d+)$/;
}
[download]

Enjoy!

Updates: Some people encountered problems, so I've made changes.

Term::ANSIColor introduced support for 24-bit colour in v5.00 (see Changes). I wasn't aware of this. I've changed "use Term::ANSIColor;" to "use Term::ANSIColor 5.00;". Thanks ++pryrt for reporting this.

For MSWin users, there's a bug in IO::Prompter. Again, thanks ++pryrt for reporting this. As a workaround, I've added:

    # Fix for MSWin -- see https://rt.cpan.org/Public/Bug/Display.html
+?id=118255
    $rgb =~ s/\R\z//;
[download]

Also for MSWin users, there's been some discussion, in a number of responses, about whether the module Win32::Console::ANSI, or the registry setting VirtualTerminalLevel, is required for this code to work. Not being in a position to test this, I can't comment further.

— Ken

Add your CUFP

Are you posting in the right place? Check out Where do I post X? to know for sure.
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big> <blockquote> <br /> <dd> <dl> <dt> <em> <font> <h1> <h2> <h3> <h4> <h5> <h6> <hr /> <i> <li> <nbsp> <ol> <p> <small> <strike> <strong> <sub> <sup> <table> <td> <th> <tr> <tt> <u> <ul>
Snippets of code should be wrapped in <code> tags not <pre> tags. In fact, <pre> tags should generally be avoided. If they must be used, extreme care should be taken to ensure that their contents do not have long lines (<70 chars), in order to prevent horizontal scrolling (and possible janitor intervention).
Want more info? How to link or How to display code and escape characters are good places to start.

Domain Nodelet^?

www.com | www.net | www.org

Chatterbox^?

How do I use this? | Other CB clients

Other Users^?

Others contemplating the Monastery: (1)

As of 2023-06-05 03:56 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Voting Booth^?

Notices^?


Your skill will accomplish what the force of many cannot
	PerlMonks

Cool Uses for Perl

Version 0

Version 1

Type::Params v2 API

Handy import shortcuts

Types::Common

A type divided against itself shall stand

Type defaults

The new DelimitedStr type

Internals