Ken Seehart ken at
Tue Jan 20 21:45:17 CET 2015

Hash Table, Christiania
(a table with many kinds of hash)

On 1/20/2015 12:19 PM, Devin Jeanpierre wrote:
> There are similarly many kinds of hash tables.
> For a given use case (e.g. a sorted dict, or a list with efficient
> removal, etc.), there's a few data structures that make sense, and a
> library (even the standard library) doesn't have to expose which one
> was picked as long as the performance is good.
> -- Devin
> On Tue, Jan 20, 2015 at 12:15 PM, Ken Seehart <ken at> wrote:
>> Exactly. There are over 23,000 different kinds of trees. There's no way you
>> could get all of them to fit in a library, especially a standard one.
>> Instead, we prefer to provide people with the tools they need to grow their
>> own trees.
>> On 1/19/2015 3:01 PM, Mark Lawrence wrote:
>>> On 19/01/2015 22:06, Zachary Gilmartin wrote:
>>>> Why aren't there trees in the python standard library?
>>> Probably because you'd never get agreement as to which specific tree and
>>> which specific implementation was the most suitable for inclusion.
>> --

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: image022-447x336.jpg
Type: image/jpeg
Size: 53547 bytes
Desc: not available
URL: <>

More information about the Python-list mailing list