I wonder if it might not be a good idea to implement a function to 
compute the intersection of two sets-as-hashes.

Intersection is the only basic set function that's not trivially
implementable with perl hashes. Sure, it's not hard to do, with 
a loop and a small bit of programming, but maybe it should be a
primitive.

I dunno. I don't use set functions, so I'd never use it, personally.
But I'm sure many set mathematicians out there would.
 ----------------------------------------------------------------------
 Eric J. Roode,  [EMAIL PROTECTED]           print  scalar  reverse  sort
 Senior Software Engineer                'tona ', 'reh', 'ekca', 'lre',
 Myxa Corporation                        '.r', 'h ', 'uj', 'p ', 'ts';

Reply via email to