Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl Monk, Perl Meditation
 
PerlMonks  

Re^3: Compare data structures (without loops)

by Aristotle (Chancellor)
on Feb 19, 2003 at 22:50 UTC ( [id://236868]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Compare data structures (without loops)
in thread Compare data structures (without loops)

Maybe contains_at_least? I can't think of any better name..

Makeshifts last the longest.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (7)
As of 2024-03-28 19:47 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found