Lie Ryan lie.1296 at gmail.com
Sat Dec 10 18:58:43 EST 2011

• Previous message (by thread): order independent hash?
• Next message (by thread): order independent hash?
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

On 12/09/2011 10:27 PM, Steven D'Aprano wrote:
> On Thu, 08 Dec 2011 10:30:01 +0100, Hrvoje Niksic wrote:
>
>> In a language like Python, the difference between O(1) and O(log n) is
>> not the primary reason why programmers use dict; they use it because
>> it's built-in, efficient compared to alternatives, and convenient to
>> use.  If Python dict had been originally implemented as a tree, I'm sure
>> it would be just as popular.
>
> Except for people who needed dicts with tens of millions of items.

who should be using a proper DBMS in any case.

---

• Previous message (by thread): order independent hash?
• Next message (by thread): order independent hash?
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

---

More information about the Python-list mailing list