A thread-safe, persistent Treap (tree + heap) for ordered key-value mapping and priority sorting.
A simple, performant, type-safe way to persist Go structs and maps with generics and WAL-based durability. Like key-value in-memory database, but better.
A small go package which implements Immutable List (Persistent Data Structure).
Persistent, immutable, generic vectors for Go
Efficient immutable list implementation written in go.
Key-Value experimentation
Efficient immutable hash map implementation written in go.
web-based alternative for Freemind with collaboration and versioning features
Add a description, image, and links to the persistent-data-structure topic page so that developers can more easily learn about it.
To associate your repository with the persistent-data-structure topic, visit your repo's landing page and select "manage topics."