Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

Re: Comparison by position and value

by jbrugger (Parson)
on Jan 02, 2005 at 15:36 UTC ( #418790=note: print w/replies, xml ) Need Help??


in reply to Comparison by position and value

The 'subcode' indeed would work, it looks something like:

#!/usr/bin/perl use strict; sub compare ($$) { my ($a,$b) = @_; my $ok = 0; for (my $i=0; $i < scalar(@{$a}); $i++) { if ( @{$a}[$i] eq @{$b}[$i] && @{$a}[$i] ne "_" ) { #compatible... $ok=1; } elsif (@{$a}[$i] ne @{$b}[$i] && (@{$a}[$i] ne "_" && @{$b}[$i] ne "_") ) { # totally not compatible return 0; } } $ok; } my @a1 = qw(_ 8 _ _ 3 _ _ 1 9); my @a2 = qw(2 _ 8 _ _ _ 7 _ _); my @a3 = qw(4 8 _ _ _ _ _ 7 _); my @a4 = qw(4 8 _ _ _ _ 7 _ _); print ( "1: " . compare(\@a1, \@a2) ."\n" ); print ( "2: " . compare(\@a1, \@a3) ."\n" ); print ( "3: " . compare(\@a1, \@a4) ."\n" );

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://418790]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others rifling through the Monastery: (3)
As of 2020-10-31 18:56 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    My favourite web site is:












    Results (291 votes). Check out past polls.

    Notices?