-
> De: "Martin Buchholz"
> À: "David McManamon"
> Cc: "core-libs-dev"
> Envoyé: Lundi 23 Octobre 2017 02:38:14
> Objet: Re: AVL tree implemented in the style of TreeMap for better performance
> Another thing to keep in mind is that someda
Another thing to keep in mind is that someday Java might have value types,
which will make "inline objects" possible, which will make us reconsider
all the data structure implementations.
On Wed, Oct 18, 2017 at 3:35 PM, David McManamon wrote:
> If the BBST performance numbers from Ben Pfaff's c
On 10/18/2017 06:35 PM, David McManamon wrote:
>
> https://github.com/dmcmanam/bbst-showdown
>
> Although an old topic, it may be worth another look in Java since AVL trees
> do much better in some circumstances.
(And possibly worse in others.) As you note on the above page,
it may be the case t
If the BBST performance numbers from Ben Pfaff's c language research in 2004
https://benpfaff.org/papers/libavl.pdf
are correct then it seems the red-black tree implementations that are so
popular in the JDK might be worth another look. However, when I surveyed
the AVL implementations in the Java
