Is there any existing open-source implementation of a thread-safe Binary Search Tree (BST) in Rust?
My current approach is based off of The Complete Rust Programming Reference Guide's single-threaded red-black tree with
Arcs instead of their
Rcs, but I haven't had much success. This is for benchmarking a research project, so I'd love to just drop in an existing implementation instead of having to write my own.