btree VS re2j

For a simple and readable implementation of a Python btree see this:

https://github.com/samsquire/btree

I tried to keep the implementation as simple as I could.

Btrees can be really simple, I've written a super simple understandable readable btree here.

https://github.com/samsquire/btree

It doesn't balance laterally like some B+ btrees do but it handles splits in a really simple way.

I did this for an object pool in re2j and saw even single threaded performance improve.

https://github.com/google/re2j/blob/dc7d6e5d41225dc0825ea6fe...

Java doesn't suffer from pointer address ABA but I did have to handle reinsertion (except when the stack had only one element).

To fix it, we’ll use the Re2j library.

Safe regex The default Java regex matcher has a flaw that could be exploited and should thus be avoided, especially when dealing with user input. Use another matcher, such as Google’s RE2/J. You can find instructions and additional information at that link.