in reply to Re: Regex: remove non-adjacent duplicate hashtags
in thread Regex: remove non-adjacent duplicate hashtags

To solve the presented problem this type of approach is the one I would use too but with List::Util::uniq for speed and clarity. Core modules with XS are ideal for this type of task.

#!/usr/bin/env perl
use strict;
use warnings;
use List::Util 'uniq';

my $tags = '#tag1 #tag2 #tag3 #tag1';

my $uniq = join ' ', uniq split / /, $tags;

print "Orig: $tags\nUniq: $uniq\n";

[download]

🦛

Replies are listed 'Best First'.
Re^3: Regex: remove non-adjacent duplicate hashtags
by perlfan (Parson) on Jul 26, 2022 at 06:27 UTC
    Yes, I was just showing the different approach which seemed to solve the issue, i.e., getting the list of unique tags. I also wanted to show how to do that with hashrefs; but sure what you say is another option.
[reply]

      I ++ed your reply when I first saw it, but I'm having second thoughts. (But I won't try to take back my upvote. :)

      A solution based on uniq (which utilizes a hash under the hood) preserves the order of items in the input list (with only the first of a set of non-unique items being output) whereas the method using sort does not. If information on the particular input list items that were not unique is needed, a single hash can be used both for uniqifying and for counting (and a hash reference is not needed). 

      Win8 Strawberry 5.8.9.5 (32)  Tue 07/26/2022  5:28:42
C:\@Work\Perl\monks
>perl

use strict;
use warnings;

my $s = "#tag2 #tag1 #tag2 #tag3 #tag1";
print qq{Orig: '$s' \n};

my %u;
$s = join ' ', grep { ! $u{$_}++ } split /\s+/, $s;
print  qq{Uniq: '$s' \n};

printf qq{Dups: '%s' \n}, join ', ', sort grep { $u{$_} > 1 } keys %u;

^Z
Orig: '#tag2 #tag1 #tag2 #tag3 #tag1'
Uniq: '#tag2 #tag1 #tag3'
Dups: '#tag1, #tag2'

      [download]
      Note: uniq may be found in List::MoreUtils rather than in List::Util in older versions of Perl.

      Give a man a fish:  <%-{-{-{-<

[reply]
[d/l]
[select]

In Section Seekers of Perl Wisdom