This is basically a b-tree, the "TreeList-like structure."
On Wed, Oct 9, 2013 at 2:15 PM, Bernd Eckenfels wrote:
> Am 09.10.2013, 11:24 Uhr, schrieb Rodion Efremov :
>>
>> My buggy experiments show that it makes sense to produce a TreeList-like
>> structure, that doesn't use an entire AVLNode fo
Am 09.10.2013, 11:24 Uhr, schrieb Rodion Efremov :
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 s
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
Arra
