treap
Sequence data structure
An efficient data structure for fast insertions and queries on sequences of values
Efficient implementation of the implicit treap data structure
63 stars
7 watching
1 forks
Language: Haskell
last commit: over 3 years ago algorithmsdatastructurehaskellhomomorphismmonoidtreaptree
Related projects:
Repository | Description | Stars |
---|---|---|
| An immutable data structure for efficiently managing sorted sets. | 27 |
| Provides efficient tree data structures for Django web applications | 1,118 |
| A Haskell implementation of Datalog, allowing recursive queries in a logic language. | 104 |
| Efficient implementation of Map where types serve as keys | 101 |
| A collection of reusable data structures and streaming algorithms in Common Lisp. | 48 |
| Provides type-safe memory units through a Haskell library with minimal boilerplate | 62 |
| A playground for advanced data structures in Haskell | 63 |
| A library providing generalized recursion schemes and traversals for recursive data structures in Scala. | 811 |
| A Haskell library for serializing and deserializing data structures in a persistent manner. | 30 |
| 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 Haskell library for bidirectional serialization of TOML configuration data | 123 |
| A Go-based program for listing structs in a structured way | 42 |
| A lightweight Haskell standard library designed to balance productivity, safety, and performance. | 708 |
| Tools for analyzing and processing sequence data from the Online Encyclopedia of Integer Sequences. | 46 |
| A comprehensive library of verified data structures and algorithms in Coq | 45 |