treap
Set datastructure
An immutable data structure for efficiently managing sorted sets.
golang persistent immutable treap sorted sets
27 stars
3 watching
6 forks
Language: Go
last commit: about 5 years ago
Linked from 2 awesome lists
golangheapimmutablemappersistentsettreaptree
Related projects:
Repository | Description | Stars |
---|---|---|
| Persistent data structures for Python that provide immutable and functional design | 2,039 |
| An efficient data structure for fast insertions and queries on sequences of values | 63 |
| A library for populating structs with data from various formats. | 35 |
| Generates Go structs from multiple XML documents | 78 |
| A Rust implementation of persistent data structures with structural sharing | 1,299 |
| Provides an alternative data structure to Go's built-in map and slice types | 45 |
| An implementation of a set data structure using LinkedHashMap | 27 |
| An implementation of the hash-set data structure | 17 |
| A data structure and algorithm library designed to provide functions similar to C++ STL in Go. | 1,058 |
| A data structure library implementing persistent AVL trees for sorted maps and sets with efficient rank queries, nearest key lookups, and other operations. | 132 |
| A Go package for working with nested data structures like maps and slices | 20 |
| Efficient immutable data structures for the Crystal programming language | 201 |
| Enables regular expressions to be defined as struct fields and captures sub-expressions into those fields | 591 |
| An implementation of the Disjoint-Set data structure in Go. | 15 |
| An implementation of conflict-free distributed data synchronization using operational transformation and persistent immutable data structures | 87 |