You are viewing a plain text version of this content. The canonical link for it is here.
Posted to dev@commons.apache.org by Rodion Efremov <ro...@cs.helsinki.fi> on 2013/10/09 11:24:57 UTC
[Collections] A better TreeList?
Hello, y'all!
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.
Your opinion?
--
TIA, Rodion
---------------------------------------------------------------------
To unsubscribe, e-mail: dev-unsubscribe@commons.apache.org
For additional commands, e-mail: dev-help@commons.apache.org
Re: [Collections] A better TreeList?
Posted by James Carman <ja...@carmanconsulting.com>.
This is basically a b-tree, the "TreeList-like structure."
On Wed, Oct 9, 2013 at 2:15 PM, Bernd Eckenfels <ec...@zusammenkunft.net> wrote:
> Am 09.10.2013, 11:24 Uhr, schrieb Rodion Efremov <ro...@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
Re: [Collections] A better TreeList?
Posted by Bernd Eckenfels <ec...@zusammenkunft.net>.
Am 09.10.2013, 11:24 Uhr, schrieb Rodion Efremov <ro...@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