Any plans on implementing AVL tree?

[germaniuss]

I was in need of a simple string map data structure that would be alphabetically sorted, however the only map implementation in here is a simple hash map. I was wondering if there are any plans to implement an ordered map in the form of an AVL tree? I ended up using another random implementation I found on github though I would've loved to use this library since it's awesome and I use it for everything else.

[tezc]

I agree a tree implementation is missing in the toolset :)

Currently, there is no plan for it. There is a bplus tree which I couldn't publish due to licensing but I was told that I can open source it after 2022. So, I guess, I'll add it by the end of this year. Not sure if it helps you though.

[germaniuss]

Well for now I'll use the other tree implementation I found. On another note is there anything in the library that can be used as a shared semaphore between processes. Kind of like semaphore.h on POSIX systems.

[tezc]

Sorry, there is nothing for inter-process communication.

[germaniuss]

That's fine I might just change the mutex implementation a little and use the mmap to store it. Thanks for your time anyways!

[iz0eyj]

Here you can find a non-recursive implementation of the AVL Tree that is well done and simple to adapt to your needs.

https://github.com/xieqing/avl-tree

[MykolaKovalyk]

@tezc Any updates on this? A b+ tree would be nice too.

[tezc]

@MykolaKovalyk Unfortunately, I could not open source the b+ tree implementation I mentioned above (I was not allowed).

Whenever I have some free time, I'll check if I can come up with a new tree implementation. I try to make these libraries short, fast and easy to use. Hope I can achieve these goals with a tree implementation, let me experiment a bit.