Persistent Data Structures

[burner]

There is an ongoing effort to reduce the reliance of Phobos on the GC but the GC is not going anywhere given that it has many advantages over manual memory management. The community would greatly benefit from a wide range of functional programming techniques that have their roots in the usage of immutable and persistent data structures that heavily rely on the GC. Persistent Data Structures are heavily used in Scala and Clojure and they allow the programmer to reason about interactivity, sharing and parallelism.

The focus of this project would be to create a varying range of persistent data structures (sets, vectors, maps, strings, trees, lists, etc...) that respects the range interface and the semantics of Phobos.

Related Work:

• https://www.cs.cmu.edu/~rwh/theses/okasaki.pdf
• https://www.worldcat.org/title/rrb-trees-efficient-immutable-vectors/oclc/820379112
• https://www.youtube.com/watch?v=7BFF50BHPPo
• https://www.infoq.com/presentations/Value-Values
• https://github.com/arximboldi/immer