persistent-data-structures

The Floyd programming language

Atree. Go library of scalable, persistent arrays and ordered maps used by the Cadence runtime on the Flow network

Persistent immutable data structures in C

The rep contains my experiments with state of the art NVM programming abstractions during my internship at Regal Lab of Inria Paris under the supervision of Dr Marc Shapiro and Dr Gael Thomas.

Poster presented at RECOMB 2017

Purely functional data structures implemented in Scheme and Hy, based on Chris Okasaki's book

Archived: no longer maintained. Returns native JavaScript types (Array/Object/Map/Set). Immutability faster than mutation. Dual mode: immutable + mutable patterns. 100% library compatible.

Presentation for Algorithm Design Seminar 2 on persistent data structures

An experimental Python library exploring persistent and versioned data structures.

persistent copy on write b plus tree snapshot engine in cpp

Persistent immutable Stack and amortized two-stack Queue in Java (Okasaki-style)

Persistent summary B+ trees and Unicode text ropes in pure Ruby

Persistent collection library for Java 21+

Persistent data structures with fast diff

Persistent immutable hash map and vector (HAMT/CHAMP, 32-ary trie) for Standard ML, with structural sharing. Pure, dual-compiler.

Persistent (versioned) hash array mapped trie in C with rollback, plus a Python ctypes test harness

Immutable nested update with structural sharing

[READ ONLY] A code editor for the browser that keeps every version.

Persistent data structures in the problem of performance optimization of sequential and concurrent programs in Java