in reply to Challenge: Perl 5: lazy sameFringe()?
Very nice exercise!
use strict; use warnings; sub make_iterator { my $s = shift; my @stack = (); return sub { while(defined $s) { if( !ref $s ) { my $n = $s; $s = pop @stack; return $n; # leaf & back up the t +ree } if( ref $s->[0] ) { push @stack, $s->[1]; $s = $s->[0]; # down & and memorize othe +r branch } else { my $n = $s->[0]; $s = $s->[1]; return $n; # leaf & down the ot +her branch } } return undef; } } sub sameFringe { my ($i1, $i2) = map { make_iterator( $_ ) } @_; while( my $n = $i1->() ) { return 0 if $n ne $i2->(); } return defined( $i2->() ) ? 0 : 1; } my @trees = ( [ [ 1, [ [2, [4, 7] ], 5 ] ], [3, [6, [8, 9] ] ] ], [ [ 1, [ [2, [4, 7] ], 5 ] ], [3, [6, [8, 9] ] ] ], [ [ 1, [ [ [2, 4], 7], 5 ] ], [3, [6, [8, 9] ] ] ], [ [ 1, [ [2, [4, 7] ], 5 ] ], [3, [6, [8, [9, 0 ] ] ] ] ] +, [ [ 1, [ [0, [4, 7] ], 5 ] ], [3, [6, [8, 9] ] ] ], ); print sameFringe( $trees[0], $_ )?"Same\n":"Different\n" for @trees; my $a = [ 1, [ 2, [ 3, [ 4, 5 ] ] ] ]; my $b = [ 1, [ [ 2, 3 ], [ 4, 5 ] ] ]; my $c = [ [ [ [ 1, 2 ], 3 ], 4 ], 5 ]; print sameFringe( $a, $a )?"Same\n":"Different\n"; print sameFringe( $a, $b )?"Same\n":"Different\n"; print sameFringe( $a, $c )?"Same\n":"Different\n"; my $x = [ 1, [ 2, [ 3, [ 4, [ 5, 6 ] ] ] ] ]; my $y = [ 0, [ [ 2, 3 ], [ 4, 5 ] ] ]; my $z = [ 1, [ 2, [ [ 4, 3 ], 5 ] ] ]; print sameFringe( $a, $x )?"Same\n":"Different\n"; print sameFringe( $a, $y )?"Same\n":"Different\n"; print sameFringe( $a, $z )?"Same\n":"Different\n";
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Challenge: Perl 5: lazy sameFringe()?
by LanX (Saint) on Jun 30, 2013 at 11:49 UTC | |
Re^2: Challenge: Perl 5: lazy sameFringe()?
by BrowserUk (Patriarch) on Jun 30, 2013 at 12:35 UTC |
In Section
Seekers of Perl Wisdom