PWC 185

PWC 185

Challenge 2 (Mask Code)

Given a list of arbitrary strings consisting of alphanumeric and other characters, we are asked to run a script that replaces the first four alphanumeric characters in each string with x. Thus (from the test example), 'ab-cde-123' gets converted to 'xx-xxe-123'.

This is a one-liner in Perl 5 and Raku. In Perl 5:

perl -E 'for my $test (@ARGV) {$test =~ s/[a-wyz0-9]/x/ for (1 .. 4); say $test}' 'ab-cde-123' '123.abc.420' '3abc-0010.xy'

I loop through the strings in ARGV and for each string loop four times through a substitution regex that finds the next alphanumeric that is not x and replaces it with x. 

The same logic in Raku:

raku -e '@*ARGS.map({my $temp=$_; ($temp ~~ s/<[a .. w y z 0 .. 9]>/x/) for (0 .. 3); say $temp;})' 'ab-cde-123' '123.abc.420' '3abc-0010.xy'

In Julia I do not use a one-liner and follow the Julia-ish approach of multiple dispatch, with a function mask() defined for an input string, and another version of mask() defined for a list of such strings. The list version of mask loops through the list calling the string version of mask for each list member.  

Here is my Julia script.  

The Julia replace function for string substitution is neat. It has an option to include a counter, say 4, to perform the substitution exactly four times. Exactly what we need for this task! 

Challenge 1 (MAC Address)

Given a MAC address in the format '1ac2.34f0.b1c2', we are asked to represent it in the format '1a:c2:34:f0:b1:c2'.

This could be a one-liner, but inspiration didn't strike, and I ended up with a straightforward multi-line script. 

I split the MAC address on /\./ into four-letter pieces, and then push each two-letter substring of each four-letter piece into an array. Finally, I join that array using ':'.

Same logic in all three languages.

Here is my Perl 5 script.

Here is my Raku script.

Here is my Julia script.  

Fellow contributor Jaldhar Vyas has a great regex-based one-liner for this, in both Perl 5 and Raku. He sets up a regex that captures each two-letter substring in the sequence, and then joins them using ':'. Now why didn't I think of that! Here is  his blog where he explains it.

Comments

Post a Comment

Popular posts from this blog

PWC 258

PWC 258 Last week (#257) I finished challenge 2 and my blog post for challenge 257 late last week, so had only submitted challenge 1. Here is my blog post for PWC 257 , including the full code for my challenge 2 solution. This week, I have done both challenges in perl 4.019 on DOSBOX. Both scripts also work fine on the latest Perl 5.38. I also did the challenges in Raku, where they are one-liners.  Challenge 1 (Count Even Digits Number) We are given a list of integers, and asked to count the number of elements whose base-10 representation has an even number of digits. In Raku , this is a one-liner. Here it is: raku -e 'say +@*ARGS.grep({$_.chars %% 2})' $@ It could be a one-liner in Perl 4 too, but since I run it on DOSBOX, my script would not be a bash shell script. Here is the short subroutine that does the job.  sub count_even_digits {  scalar( grep( ((length($_) % 2) == 0), @_) ); } The full code is here . Challenge 2 (Sum of values) We are given an integer k  and a list in
Read more

PWC 249

PWC 249 Challenge 1 (Equal pairs) We are given a list of integers with an even number of elements. We are asked to check if the list can be completely divided into sub-lists of size 2 with each sub-list containing the same integer repeated, like say (2,2). If so, we are asked to return the list of such sub-lists. This is straightforward in Perl 5. I use modern conveniences this time, though it could be done using only primitive Perl 4 syntax. Here is my subroutine. It returns a list of array references. local *equal_pairs = sub {     #-- return () if input is of odd length     ((scalar(@_) % 2) > 0) && (return ());          #-- count number of occurrences of each element using a hash     local %_ = ();     map {$_{$_}++} @_;          #-- if any element occurs an odd number of times, return ()     (grep {($_{$_} % 2) > 0} keys %_) && (return ());          #-- loop thru %_ keys, returning pairs of such keys     map {         my $k=$_;         my $num_pairs=( ($_{$k}
Read more

PWC 253

PWC 253 I do both challenges this week using old software on DOSBOX: perl 4.019, and for comparison, also python 1.4 beta. My solutions also work on the current versions of Perl 5 (5.38) and Python 2 (2.7.18) respectively. Challenge 1 (Split Strings) Links to code: perl4.019 python1.4b We are given a list of strings, and a single character say sep . We are asked to return the list, with the strings split into component substrings using sep as a separator. We should not include any empty strings in the output. In perl 4, I first stick a backslash in front of the separator character, so that it is escaped if entered in a regex. This is because the perl split function takes a regex as its first argument indicating the separator. If we have a character like '$' or ',', we want to escape it so that it is read literally when parsing the regex. Here is the key subroutine:   sub split_strings {  local ($separator, @words)=@_;  local (@retval)=(); #array to be returned  #  #--
Read more