Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re: How can sets be recursively concatenated when intersecting with each other

by jaredor (Curate)
on Apr 24, 2011 at 14:02 UTC ( #901047=note: print w/replies, xml ) Need Help??


in reply to How can sets be recursively concatenated when intersecting with each other

If you would be satisfied with non-Set::Scalar constructs, then I think that the answers given to how to find combine common elements of an array? obtain.
  • Comment on Re: How can sets be recursively concatenated when intersecting with each other

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://901047]
help
Chatterbox?
[Corion]: erix: Ah. I use where 1 = 0 for queries where I only am interested in the structure ;)
[erix]: 1=0 is as short as TOP :)
[erix]: "code of someone that died" -- kinda nice if your code stops working too
[erix]: hard to implement, hmm
[Corion]: erix: Well, they also seem to have changed the server, or some software, or whatever, and seem to be in the process of changing the DB schema from having the "username" as primary key to something else.
[Corion]: Far too many things being done at once, or maybe only now has it become apparent that nobody knows that piece of software anymore

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (10)
As of 2017-01-23 09:33 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Do you watch meteor showers?




    Results (192 votes). Check out past polls.