Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re^2: Finding list elements in other lists.

by Hofmator (Curate)
on Oct 17, 2006 at 08:53 UTC ( #578712=note: print w/replies, xml ) Need Help??

in reply to Re: Finding list elements in other lists.
in thread Finding list elements in other lists.

I like your package solution, as well as the arguments for it. This package can easily be extended to work for any number of arrays, not only two. The calling code stays the same.
package All_In; use strict; use warnings; sub new { my $class = shift; my $self = []; for my $aref (@_) { my %h; @h{ @$aref } = (); push @$self, \%h; } bless $self, $class; } sub qualify { my $self = shift; for my $href (@$self) { return 0 if ! grep { exists $href->{$_} } @_; } return 1; } 1;

-- Hofmator

Code written by Hofmator and posted on PerlMonks is public domain. It is provided as is with no warranties, express or implied, of any kind. Posted code may not have been tested. Use of posted code is at your own risk.

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://578712]
[erix]: choroba I believe you ;)
[1nickt]: Corion I assume you are talking about Retry? Attempt doesn;t offer callbacks and has a much simpler interface. (Also written by someone I trust...)
[perldigious]: I train for long portaging/rowing trips by carrying my kayak to the river about a half mile from my house 2-3 times a week depending on weather... but due to a lingering winter, I haven't had long to train this year.

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (10)
As of 2017-05-24 12:58 GMT
Find Nodes?
    Voting Booth?