TASK2: https://theweeklychallenge.org/blog/perl-weekly-challenge-350/#TASK2

Looks like the consensus on how to approach this would be to "split, sort, join" to generate keys for finding pair pals. Further, as smarter guys explained, using modulo arithmetic voodoo, a lot of unfriendly numbers (which can't have any pals anyway) should simply be skipped; and, of those that remain, it's pointless to ask some of the witnesses about, i.e skip these witnesses, too. So, my subroutine to solve the problem is:

sub pwc {
    my ( $from, $to, $target ) = @_;
    
    use integer;
    my @witnesses = ([ 4, 7 ], [ 2 .. 9 ]);

    my ( %pairs, $j );
    for ( my $i = ( $from + 2 ) / 3 * 3; $i <= $to; $i += 3 ) {
        my $i_key = join '', sort split '', $i;
        my $k = $i % 9 ? 0 : 1;
        
        for ( @{ $witnesses[ $k ]}) {
            last if length( $j = $i * $_ ) != length( $i );
            $pairs{ $i }{ $j } = $_
                unless $i_key ne join '', sort split '', $j
        }
        for ( @{ $witnesses[ $k ]}) {
            last if length( $j = $i / $_ ) != length( $i );
            $pairs{ $i }{ $j } = -$_
                unless $i % $_
                    || exists $pairs{ $j } && 
                       exists $pairs{ $j }{ $i }
                    || $i_key ne join '', sort split '', $j
        }
    }
    return scalar grep { %$_ >= $target } values %pairs
}
[download]

However, even though some solutions mention "speed", I haven't seen optimizations which follow. First, if using CPAN modules is OK (and why not), almost exactly twice as fast is to sort in-place instead:

Greetings O monks,

I have turned perlcritic --stern towards several scripts I have and encountered a question. The manual page for File::Path contains the following excerpt:

@created = make_path('foo/bar/baz', '/zug/zwang', { verbose => 1, mode => 0711, });

Indeed, in my script(s) that syntax works fine, like this for example make_path($page,{mode=>0775})

However, when I point perlcritic at the script(s), I get warnings like the following about how leading zeros should be avoided:

Integer with leading zeros: "0775" at line 657, column 34. See page 58 of PBP. (Severity: 5)

What is the right way to resolve that warning or error? Putting it in quotes does not have the desired effects.

PS. Any tips on non-Amazon book sellers inside the EU which can sell a paper copy of PBP?

ab -l -v 2 -n 100 -c 50 "http://localhost:9510/helloworld/"<br/>
[download]

...
Concurrency Level: 50
Time taken for tests: 0.015 seconds
Complete requests: 100
Failed requests: 0
Non-2xx responses: 85 #NOTE: all of these are "502 Bad Gateway"
...
[download]

location /helloworld/ {
  proxy_buffering off ;
  gzip off ;
  fastcgi_pass unix:/testFolder/myPath/myUDS.sock ;
  include fastcgi_params ;
}
[download]

(SBP means "Strawberry Perl")

"C:\berrybrew\instance\5.40.2_64\perl\bin\perl.exe" "-MExtUtils::Command::MM" "-MTest::Harness" "-e" "undef *Test::Harness::Switches; test_harness(0, 'blib\lib', 'blib\arch')" t/*.t
Unable to symlink C:\Users\somia\AppData\Local\Temp\_VXLTq6lRt\sym to target C:\Users\somia\AppData\Local\Temp\_VXLTq6lRt\old for testing: Operation not permitted at t/001-fcopy.t line 71.
# Looks like your test exited with 1 just after 9.
t/001-fcopy.t ....
Dubious, test returned 1 (wstat 256, 0x100)
Failed 76/85 subtests
        (less 1 skipped subtest: 8 okay)
Unable to symlink at t/lib/Helper.pm line 179.
# Looks like your test exited with 1 just after 77.
t/002-dircopy.t ..
Dubious, test returned 1 (wstat 256, 0x100)
Failed 38/115 subtests
        (less 1 skipped subtest: 76 okay)
Unable to symlink C:\Users\somia\AppData\Local\Temp\6cvtKrEDFd\sym to target C:\Users\somia\AppData\Local\Temp\6cvtKrEDFd\old for testing: Operation not permitted at t/003-rcopy.t line 78.
# Looks like your test exited with 1 just after 9.
t/003-rcopy.t ....
Dubious, test returned 1 (wstat 256, 0x100)
Failed 179/188 subtests
        (less 1 skipped subtest: 8 okay)

I was not actually aiming to test or install File::Copy::Recursive::Reduced, but it was a dependency for Mouse.

As always, I will greatly appreciate any knowledge and insights. Thanks, good monks.

Would this algorithm by Ben Joffe be something useful for Date::Calc or Time::Piece as is?

A Very Fast 64–Bit Date Algorithm: 30-40% faster.

It apparently gains speed by counting backwards and doing fewer multiplications than the earlier algorithms.

I have the problem to find multilingual filenames, where diacritics are inconsistently used. °

Of course I could do the normalization manually and map à á ä å ... -> a and so on.

But I suppose that

• I'm reinventing the wheel
• there is consistent unicode attribute for this.¹
• or a cpan module

(The only remote possibility which comes to mind is a special locale doing the trick ...hmm)

Thanks in advance!

UPDATES

°) Latin alphabet only in my case!

¹) compare Based on "a" (U+0061)

Hi, I am currently using Filesys::SmbClient to access a text file but when using tcpdump I notice that the path etc are not encrypted. How do I force encryption?

I have set the following at: ~/.smb/smb.conf and /etc/samba/smb.conf

[global]
   client min protocol = SMB3
   client smb encrypt = required
[download]

When I use /usr/bin/smbclient the stuff seems to be encrypted. However safely passing passwords to smbclient appears to be trickier and more troublesome.

root@localhost [project_db]> describe articles_table;
+------------------------+--------------+------+-----+---------+------
+-+
| Field                  | Type         | Null | Key | Default | Extra
+ |
+------------------------+--------------+------+-----+---------+------
+-+
| db_art_id              | bigint       | YES  | MUL | NULL    |      
+ |
[download]

root@localhost [project_db]> SELECT MAX(db_art_id) FROM articles_table
+;
[...]
+----------------+
| MAX(db_art_id) |
+----------------+
|              1 |
+----------------+
1 row in set (0.01 sec)

root@localhost [project_db]>
[download]

    my $my_articletable = 'articles_table';
    my $p_db_art_id = 'db_art_id';
    my $sqlcmd = "SELECT MAX($p_db_art_id) FROM $my_articletable;";
    logit("SQLCMD: '$sqlcmd'");
    my $sth = $p_dbh->prepare($sqlcmd);
    $sth->execute();
[download]

Dear monks,

I am participating in a coding-contest, where you have to steer a bot through an arena and collect gems. (hidden gems (german only)). I am one of only two contestants using perl.

As part of the rules the bot must behave deterministic - two runs in the same arena need to result in the same result. For random numbers this is ensured by setting a fixed seed in srand().

The challenge comes with hashes, which by design are unordered. Here I ensure determinism using sort on the keys. But now I want to access the hash based on the order of a field inside:

foreach my $k sort { $hash{$a}{value} <=> $hash{$b}{value} } (keys %ha
+sh)
[download]

Is there a way to force perl to access a hash in a deterministic way? Similar to srand()? Or what is the preferred way to enforce it? I could try something like

foreach my $k sort { $hash{$a}{value} <=> $hash{$b}{value} } (sort key
+s %hash)
[download]