Clojure finger trees and flexvec

Question

I am looking for a persistent sequential datastructure that allows efficient random insertions and deletions. I found the following implementations:

• clojure.data.finger-tree (the counted-double-list implementation)
• wgjo.data.cljs
• flexvec

Since there was not much activity in clojure.data.finger-tree for the last two years, and the others are relatively new, I was wondering if someone has experince of using any of these in production, and whether there are alternatives that I have overlooked.

Answer 1

Another implementation clojure/core.rrb-vector was announced. Since it's in the clojure github account, it seems like it's going to be the de-facto implementation.