Re: Check if string A and B are made up of same chars

Variety delights:

#!/usr/bin/env perl

use strict;
use warnings;
use Set::Scalar;
use List::MoreUtils qw(uniq);
use feature qw(say);

my $string = qw(kizuaheli);
my $s_1 = Set::Scalar->new(uniq(split//, $string));
my $s_2 = Set::Scalar->new(uniq(split//, $string));
say $s_1->is_equal($s_2);
say $s_1 == $s_2;

my $s_3 = Set::Scalar->new(uniq(split//, $string));
my $s_4 = Set::Scalar->new(uniq(split//, ""));
say $s_3->is_equal($s_4);
say $s_3 == $s_4;
[download]

Update: arunbear has pointed out that the use of uniq is superfluous here - see below.

ŤThe Crux of the Biscuit is the Apostropheť

Comment on Re: Check if string A and B are made up of same chars Select or Download Code

Replies are listed 'Best First'.
Re^2: Check if string A and B are made up of same chars by Arunbear (Prior) on Nov 18, 2024 at 11:24 UTC
The `uniq` is not really needed there because Set::Scalar itself will discard any duplicates.	[reply] [d/l]
Re^3: Check if string A and B are made up of same chars by karlgoethebier (Abbot) on Nov 18, 2024 at 16:19 UTC
Yes, thanks. I had to convince myself again - it's been a long time since I last used it. my $s_1 = Set::Scalar->new(split//, "abc"); my $s_2 = Set::Scalar->new(split//, "aaaaaabc"); dd $s_1; dd $s_2; __END__ do { my $a = bless({ elements => { a => "a", b => "b", c => "c" }, universe => bless({ elements => { a => "a", b => "b", c => "c" }, null => bless({ universe => 'fix' }, "Set::Scalar::N +ull"), universe => undef, }, "Set::Scalar::Universe"), }, "Set::Scalar"); $a->{universe}{null}{universe} = $a->{universe}; $a; } do { my $a = bless({ elements => { a => "a", b => "b", c => "c" }, universe => bless({ elements => { a => "a", b => "b", c => "c" }, null => bless({ universe => 'fix' }, "Set::Scalar::N +ull"), universe => undef, }, "Set::Scalar::Universe"), }, "Set::Scalar"); $a->{universe}{null}{universe} = $a->{universe}; $a; } [download] ŤThe Crux of the Biscuit is the Apostropheť	[reply] [d/l]
Re^2: Check if string A and B are made up of same chars by LanX (Saint) on Nov 17, 2024 at 17:42 UTC
Well the OP said "made up of same chars" but he wants "same amount of same characters" š Please compare how his test for "ABB" and "ABA" are supposed to fail. Cheers Rolf _{(addicted to the Perl Programming Language :) see Wikisyntax for the Monastery} š) or in math lingo "is a permutation"	[reply]
Re^3: Check if string A and B are made up of same chars by karlgoethebier (Abbot) on Nov 17, 2024 at 17:54 UTC
Yes, it seems so - to be honest: I didn't quite understand his specs. And aren't you neglecting the length in your example? But he can certainly adapt the example. ŤThe Crux of the Biscuit is the Apostropheť	[reply]
Re^4: Check if string A and B are made up of same chars by LanX (Saint) on Nov 17, 2024 at 19:09 UTC
> And aren't you neglecting the length in your example? Nope, different length will fail. (See also second test) But yes, I was only concentrating on the essential part, his "specs" are indeed a bit fuzzy. Anyway, there's no point in optimizing for speed if the problem-space is under-defined Cheers Rolf _{(addicted to the Perl Programming Language :) see Wikisyntax for the Monastery}	[reply]