(Context: I am working on a somewhat hairy query optimizer thingy, and need some functional datastructures and tree walkers , and a generic Tree interface and so on.)
In the interests of avoiding duplicated effort, I looked around and I found FunctionalCollections.jl <https://github.com/JuliaLang/FunctionalCollections.jl> but the readme explicitly says "This is a work in progress and is currently not optimized for performance." So do we have performance optimized persistent data structures somewhere? :-) It isn't very clear what specific optimizations are missing, or what the gap between expected and actual performance of these implementations are (which is fine, such is Open Source, I am just ensuring I am not missing anything) Speaking of performance, what is the right way (blessed framework etc) to test performance of datastructures in Julia? Unit tests seem to test for correct implementation, but if the built in datastructures are tested for performance ( O(n) performance on op X etc) I missed that. Any pointers appreciated. Also, is someone working on these issues? RedBlackTrees <https://github.com/JuliaLang/DataStructures.jl/issues/5>, a potential Trees.jl <https://github.com/JuliaLang/DataStructures.jl/issues/16>? Before going on a tear implementing/perf testing these datastructures, I thought I'd ask here. Thanks in advance,
