"Simon Strandgaard" <0bz63fz3m1qt3001 / sneakemail.com> schrieb im
Newsbeitrag news:pan.2003.06.27.08.07.16.538696 / sneakemail.com...
> On Fri, 27 Jun 2003 10:41:55 +0200, Robert Klemme wrote:
> > "Simon Strandgaard" <0bz63fz3m1qt3001 / sneakemail.com> schrieb im
> >>
> >> There is no intersection(&) method.
> >
> > There is:
> > 07:31:22 [temp]: ri 'Array#&'
>
> I was refering to the code posted in the root of this thread.
> You can see that the adjustment I proposed uses Array#&.

Sorry, I don't seem to understand you.  The OP used Array#& and it is
defined.  What did you want to say with "There is no intersection(&)
method"?

Extract from thread root

# Now make some arrays
foo = [Trivial.new(1), Trivial.new(12)]
bar = [Trivial.new(1), Trivial.new(4)]

p (foo[0] == bar[0]) # returns true
p (foo[0] <=> bar[0]) # returns 0 -- Great! everything seems to be
working!

p (foo & bar) # returns an empty array! NOOOOO!!!!!

Regards

    robert