Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re: Adjacent numbers

by jeffa (Bishop)
on Nov 20, 2015 at 00:47 UTC ( #1148189=note: print w/replies, xml ) Need Help??


in reply to Adjacent numbers

I had to take a stab at this. I am not proud of having to insert the final loop to filter out repeats, but maybe someone else can fix that. ;)

This solution splits each data element by underscore and sorts by both the left and right, which hopefully will line up any stray adjacent elements and prevent having to look behind.

use strict; use warnings; my %ordered; for (<DATA>) { chomp; my ($left,$right) = split /_/, $_, 2; push @{ $ordered{$left} }, $right; } my @matches; for my $key (sort keys %ordered) { my $last = 0; for (sort @{ $ordered{$key} } ) { push @matches, "${key}_$last","${key}_$_" if $_ - $last == 1; $last = $_; } } my %seen; for (@matches) { print "$_\n" unless $seen{$_}++; } __DATA__ X_203 2L_33 3L_45 X_202 2L_34 X_204 2L_32 3L_87 3L_88

jeffa

L-LL-L--L-LL-L--L-LL-L--
-R--R-RR-R--R-RR-R--R-RR
B--B--B--B--B--B--B--B--
H---H---H---H---H---H---
(the triplet paradiddle with high-hat)

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1148189]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (2)
As of 2022-01-27 02:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    In 2022, my preferred method to securely store passwords is:












    Results (70 votes). Check out past polls.

    Notices?