Robert Cimrman ntc.zcu.cz> writes:
>
> Hi Martin,
>
> thanks for your ideas and contribution.
>
> A few notes: I would let intersect1d as it is, and created a new function with
another name for that (any
> proposals?). Considering that most of arraysetops functions are based on sort,
and in pa
Hi Martin,
thanks for your ideas and contribution.
A few notes: I would let intersect1d as it is, and created a new function with
another name for that (any proposals?). Considering that most of arraysetops
functions are based on sort, and in particular here that an intersection array
is (usua
I have a list of many arrays (in my case each is unique, ie has no repeated
elements), and I'd like to extract the intersection of all of them, all in one
go. I'm running numpy 1.3.0, but looking at today's rev of numpy.lib.arraysetops
(http://svn.scipy.org/svn/numpy/trunk/numpy/lib/arraysetops.py)
