Hi,
On Tue, Dec 20, 2011 at 3:41 AM, wrote:
> On Mon, Dec 19, 2011 at 8:16 PM, eat wrote:
> > Hi,
> >
> > On Tue, Dec 20, 2011 at 2:33 AM, wrote:
> >>
> >> On Mon, Dec 19, 2011 at 6:27 PM, eat wrote:
> >> > Hi,
> >> >
> >> > Especially when the keyword return_index of np.unique(.) is specifie
On Mon, Dec 19, 2011 at 8:16 PM, eat wrote:
> Hi,
>
> On Tue, Dec 20, 2011 at 2:33 AM, wrote:
>>
>> On Mon, Dec 19, 2011 at 6:27 PM, eat wrote:
>> > Hi,
>> >
>> > Especially when the keyword return_index of np.unique(.) is specified to
>> > be
>> > True, would it in general also be reasonable to
Hi,
On Tue, Dec 20, 2011 at 2:33 AM, wrote:
> On Mon, Dec 19, 2011 at 6:27 PM, eat wrote:
> > Hi,
> >
> > Especially when the keyword return_index of np.unique(.) is specified to
> be
> > True, would it in general also be reasonable to be able to specify the
> > sorting algorithm of the underly
On Mon, Dec 19, 2011 at 6:27 PM, eat wrote:
> Hi,
>
> Especially when the keyword return_index of np.unique(.) is specified to be
> True, would it in general also be reasonable to be able to specify the
> sorting algorithm of the underlying np.argsort(.)?
>
> The rationale is that (for at least so
Hi,
Especially when the keyword return_index of np.unique(.) is specified to be
True, would it in general also be reasonable to be able to specify the
sorting algorithm of the underlying np.argsort(.)?
The rationale is that (for at least some of my cases) higher level
algorithms seems to be too o
