David Di Biase wrote:
When you say slightly, is it enough to make a difference? Why would
getitems be faster even - not sure I can think why...
Using key is faster than cmp because key is called just once for each
item whereas cmp is called once for each of the O(nlogn) compares.
Operator.
When you say slightly, is it enough to make a difference? Why would
getitems be faster even - not sure I can think why...
Sent from my iPhone
On 24-Sep-08, at 5:46 PM, Matt Nordhoff <[EMAIL PROTECTED]>
wrote:
Chris Rebert wrote:
On Wed, Sep 24, 2008 at 2:02 PM, David Di Biase <[EMAIL PROT
Chris Rebert wrote:
> On Wed, Sep 24, 2008 at 2:02 PM, David Di Biase <[EMAIL PROTECTED]> wrote:
>> Hi,
>>
>> I have a rather large list structure with tuples contained in them (it's
>> part of a specification I received) looks like so:
>> [(x1,y1,r1,d1),(x2,y2,r2,d2)...]
>>
>> The list can range f
On Wed, Sep 24, 2008 at 2:02 PM, David Di Biase <[EMAIL PROTECTED]> wrote:
> Hi,
>
> I have a rather large list structure with tuples contained in them (it's
> part of a specification I received) looks like so:
> [(x1,y1,r1,d1),(x2,y2,r2,d2)...]
>
> The list can range from about 800-1500 tuples in
