vmcontainer VS btree

Some game engine developers have certainly used this idea, to prevent any reallocations when the dynamic array needs to be resized. Such as:

https://ruby0x1.github.io/machinery_blog_archive/post/virtua...

Some ECS implementations use this to reduce the overhead of dynamic arrays, as well as ensuring pointer stability of the items stored. For example entt:

https://skypjack.github.io/2021-06-12-ecs-baf-part-11/

And here's a library implementing a resizable, pointer-stable vector using virtual memory functionality from the OS:

https://github.com/mknejp/vmcontainer

We have also released in the meantime our code on GitHub (https://github.com/mknejp/vmcontainer)

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.