*Warm Regards,*
*Naresh*
*Developer *
*Consumer Goods Myanmar Limited ( CGM )No.15, Junction Square
Complex, 37-G, Pyay Road,**13041 Kamayut Township**, Yangon, Myanmar.*
*Tel: +959979867914*
http://www.cg-m.com
-- Forwarded message --
From:
Date: Wed, Feb 1, 2017 at 2:59 PM
David: from 9-10 minutes to about 2-3 seconds, it's amazing!
Thanks,
Naresh
___
NumPy-Discussion mailing list
NumPy-Discussion@scipy.org
http://mail.scipy.org/mailman/listinfo/numpy-discussion
. So I am looking for a solution where
all elem can get processed in a single call and the indices of ABC be
stored in another variable (separately). I would appreciate if you suggest
any faster method for getting DEF_distr.
Thanks,
Naresh
___
NumPy
Warren Weckesser enthought.com> writes:
>
>
> On Sat, Feb 4, 2012 at 2:35 PM, Benjamin Root ou.edu> wrote:
>
>
> On Saturday, February 4, 2012, Naresh Pai uark.edu> wrote:> I am
somewhat new to Python (been coding with Matlab mostly). I am trying to
>
&g
(unique_elem)):
elem_count[i]= np.sum(reduce(np.logical_or,(abc== x for x
in [unique_elem[i]])))
This loop is bottleneck because I have about 850 unique elements and it
takes
about 9-10 minutes. Can you suggest a faster way to do this?
Thank you,
Naresh
