Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^2: Relationships of Matching Sets

by biosysadmin (Deacon)
on Dec 17, 2004 at 01:48 UTC ( #415526=note: print w/ replies, xml ) Need Help??


in reply to Re: Relationships of Matching Sets
in thread Relationships of Matching Sets

Great idea, this was the first module that came to my mind. Also, if you'd like to explore your ideas on "close matching," try subclassing Set::Scalar. It seems like it might be difficult to define a general solution for "almost matching" in terms of sets but you could certainly implement specific solutions easily by adding the methods you want to a subclass of Set::Scalar (and leave the union, symmetric_difference, etc. in the original class definition).

Best of luck. :)


Comment on Re^2: Relationships of Matching Sets

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (11)
As of 2014-12-17 21:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (34 votes), past polls