golang persistent immutable lazy collections
-
Updated
Sep 15, 2018 - Go
golang persistent immutable lazy collections
golang rope-like data-structure for very large collections
Go implementation of a quadtree with Game of Life's hashlife algorithm.
Efficient immutable list implementation written in go.
Efficient immutable hash map implementation written in go.
an immutable string map that optimize memory usage
Immutable data storage
An implementation of a byte string which is an immutable rope-like sequence designed for efficient concatenation of byte arrays.
A distributed Key-Value-Store for lossless interactions.
A StreamLike, Immutable, Lazy Loading and smart Golang Library to deal with slices.
Type safe persistent/immutable data structures for Go
An immutable lockless Golang map
A small go package which implements Immutable List (Persistent Data Structure).
Go datastructures.
Persistent, immutable, generic vectors for Go
Immutable data structures for the Go language.
Add a description, image, and links to the immutable topic page so that developers can more easily learn about it.
To associate your repository with the immutable topic, visit your repo's landing page and select "manage topics."