Beefy Boxes and Bandwidth Generously Provided by pair Networks
Your skill will accomplish
what the force of many cannot
 
PerlMonks  

comment on

( [id://3333] : superdoc . print w/replies, xml ) Need Help??

You can try this straight-forward solution:

#!/usr/bin/perl -w use strict; # Define patterns to look for, and create a regexp with them. my @patterns = qw(1dlw 1sdh 1cgi 1xnf); my $expr = join("|", map {quotemeta} @patterns); # The source array. my @source = ( '$?/1dlw&', '*%1sdh^?', '@/!1dlw\/', '$1cgi*&', '?@1sdh%&', '~#1xnf$%', ); # Iterate over each element in source, # and store how many times each pattern # is found. my %seen; foreach my $element (@source) { if($element =~ /($expr)/) { $seen{$1}++; } } # ...and remove the patterns found more than once. while(my($pattern, $count) = each %seen) { @source = grep {!/\Q$pattern\E/} @source if $count > 1; } print join("\n", @source), "\n";
-- Ash/asksh <ask@unixmonks.net>

In reply to Re: removing elements from an array containing duplicated patterns by ash
in thread removing elements from an array containing duplicated patterns by Anonymous Monk

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • 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.