Clojure vs. D in creating immutable lists that are almost the same.

[Abdulhaq via Digitalmars-d]

On Saturday, 27 February 2016 at 22:31:28 UTC, Brother Bill wrote:

> That is, how to create one-off changes to an immutable data 
> structure, while keeping the original immutable, as well as the 
> one-off change, and maintain good performance.
>

Clojure uses bit-partitioned hash tries.

I recommend this video (Clojure Concurrency)
https://www.youtube.com/watch?v=dGVqrGmwOAw

slides here:
https://github.com/dimhold/clojure-concurrency-rich-hickey/blob/master/ClojureConcurrencyTalk.pdf?raw=true (slide 21 about bit-partitioned hash tries)