Re: Anagrams & Letter Banks

"Given a list whose elements are strings (containing only letters, as they are actually English-language words), how would one print that list only on the condition that at least one of the strings in the list contains no repeated letters?"

#!/usr/bin/perl

# http://perlmonks.org/?node_id=1202179

use strict;
use warnings;

my $good = [qw( allo mallo malo)];
my $bad  = [qw( tillo sillo sallo)];

grep !/(.).*\1/, @$_ and print "@$_\n" for $good, $bad;
[download]

Comment on Re: Anagrams & Letter Banks Download Code

Replies are listed 'Best First'.
Re^2: Anagrams & Letter Banks by dominick_t (Acolyte) on Oct 27, 2017 at 20:31 UTC
Thank you, tybalt89. It's nice to see this regex solution as well as the hash solution offered earlier. I was just reading about backreferences, and again it makes sense to me in principle, but the details remain opaque. What do the parentheses in (.) accomplish? And how does the backreference determine if something has been seen again?	[reply]
Re^3: Anagrams & Letter Banks by Cristoforo (Curate) on Oct 27, 2017 at 20:41 UTC
Hi dominick_t The parentheses capture one letter and look for a repeat, `\1`. He greps for a string which doesn't cause the regular expression to succed, (`! /....`. Update I should have been more thorough in my reply. When there is a parentheses around an expression, in this case '.', \1 refers to that captured value. If an 'a' was captured, then \1 would be a. If a 'd' was captured, then for \1 to match, it would need to find a 'd' somewhere further in the string. Perl will try to make the match succeed, so it will progress matching each letter until it finds a match. If it does, then the the regexp will succeed. Else, it will fail. If it fails then the grep succeeds! There would be a \2 if there were 2 sets of capturing parentheses. \1 would be what was captured in the first parens and \2 would be what was captured in the second set of parens. In this problem there is only one set of parens so only \1 would be involved.	[reply] [d/l] [select]
Re^4: Anagrams & Letter Banks by dominick_t (Acolyte) on Oct 27, 2017 at 20:45 UTC
Thank you, Cristoforo. Would \2 look for two repeats? Does "grep" generally return "true" if it succeeds but here the "!" returns "false" if it succeeds?	[reply]
Re^5: Anagrams & Letter Banks by dominick_t (Acolyte) on Oct 27, 2017 at 20:52 UTC
Re^6: Anagrams & Letter Banks by Laurent_R (Canon) on Oct 27, 2017 at 21:50 UTC
Some notes below your chosen depth have not been shown here


"be consistent"
	PerlMonks