I'm currently working on implementing Relaxed Radix B-Trees for Elm, and I find myself wondering why Clojure doesn't have an rrbt implementation in its core library. After all, it promises the same performance for all other operations than append and slice, where it offers an order of magnitude improvement.
Am I missing something?
Does rrbt have any downsides I'm not aware of compared to Clojure's current PersistentVector, or just hasn't there been any particular interest in (effectively) constant time append and slice?
Thanks!