commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From James Carman <ja...@carmanconsulting.com>
Subject Re: [Collections] A better TreeList?
Date Wed, 09 Oct 2013 20:46:22 GMT
This is basically a b-tree, the "TreeList-like structure."

On Wed, Oct 9, 2013 at 2:15 PM, Bernd Eckenfels <ecki@zusammenkunft.net> wrote:
> Am 09.10.2013, 11:24 Uhr, schrieb Rodion Efremov <rodionef@cs.helsinki.fi>:
>>
>> My buggy experiments show that it makes sense to produce a TreeList-like
>> structure, that doesn't use an entire AVLNode for storing each god damned
>> element, but rather stores, say, 128 elements in a node. In such a way, you
>> can talk about a structure that takes the best from
>> Array-/Linked-/Tree-list.
>
>
> Just a related note, JEP-180 hit OpenJDK, they introduced a balanced tree
> implementation for hash collisions (strange enough the implementation does
> not used a array based implementation)
>
> Bernd
>
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
> For additional commands, e-mail: dev-help@commons.apache.org
>

---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org


Mime
View raw message