On Sun, May 18, 2008 at 9:14 PM, Anne Archibald
<[EMAIL PROTECTED]> wrote:
> 2008/5/18 Matt Crane <[EMAIL PROTECTED]>:
>> On Sun, May 18, 2008 at 8:52 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
>>> Are there repeats?
>> No, no repeats in the first column.
On Sun, May 18, 2008 at 8:52 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
> It depends on the sizes.
The sizes could range from 3 to 24 with an average of around 5500.
> Are there repeats?
No, no repeats in the first column.
I'm going to go get a cup of coffee before I forget to leave out any
p
On Sun, May 18, 2008 at 8:08 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
> Okay, then it's just a little bit more complicated.
Thanks, and that's going to be faster - the method that I posted is
linear in terms of the length of the two lists? Given that the values
in the first column are monotonica
On Sun, May 18, 2008 at 7:19 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
> Are the matching rows always going to be the same row in each? I.e.
> you want rows i such that a[i,0]==b[i,0] rather than trying to find
> all i,j such that a[i,0]==b[j,0]?
>
> If so, then I would do the following:
>
>
> In
Hey,
I'm new to numpy but not new to python or programming in general. I
was wondering if there's a way of using numpy to do the following or
whether I've got what I've got and that's as good as it's going to
get.
I have two 2d arrays and I want to create another 2d array that
contains the values
