I just wrote a two Yegge long blogpost on the performance of the Persistent Vector, along with some ways to speed the Clojure implementation a bit up. It's available on Persistent Vector Performance. For people not that interested in the details, I'll recommend waiting until I have written a summary.
Latest (interesting?) blogposts:
- Suboptimal Optimisations
- Understanding Clojure's Persistent Vectors — pt. 1, pt. 2, pt. 3, transients
- Read RFS Documents in HTML Form
- Introduction to Open Source Workflows
- Hello World in Swearjure
- How to Cancel a Blocking Read in Java
- A Language Without Conditionals
I designed a quicksort implementation in Swearjure. It's completely useless, but is a proof of concept that Clojure is "usable" even if you remove alphanumerics.