Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion programming language benchmark
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Fahrzin Hemmati  
View profile  
 More options Jun 28 2011, 7:32 am
From: Fahrzin Hemmati <fahh...@gmail.com>
Date: Tue, 28 Jun 2011 04:32:50 -0700
Local: Tues, Jun 28 2011 7:32 am
Subject: Re: programming language benchmark
Static analysis might be able determine if the dictionary is small
(statically defined or assigned to often) so it can choose between
algorithms.

On 6/27/2011 10:11 PM, Fran ois Boutines wrote:

> On Tue, Jun 28, 2011 at 2:03 AM, Fahrzin Hemmati<fahh...@gmail.com>  wrote:
>> dict-ordering is not guaranteed in the python spec since it's based on
>> hashing which could change between even similar computers (x86 vs x64).
> Thanks Fahrzin, I was surprised too, but this test just ensures that.

> There is an interesting dictnotes.txt file in the Python distribution
> which explains the rationale behind the hash table implementation. It
> is optimized for small dictionaries (up to 16 elements) which are very
> common in Python (attribute storage, string-formatting, etc). We could
> maybe take some liberalities here if it doesn't break anything.

> Fran ois.


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.