treap

Sequence data structure

An efficient data structure for fast insertions and queries on sequences of values

leaves deciduous_tree fallen_leaf Efficient implementation of the implicit treap data structure

GitHub

63 stars
7 watching
1 forks
Language: Haskell
last commit: over 3 years ago
algorithmsdatastructurehaskellhomomorphismmonoidtreaptree

Related projects:

Repository Description Stars
perdata/treap An immutable data structure for efficiently managing sorted sets. 27
django-treebeard/django-treebeard Provides efficient tree data structures for Django web applications 1,119
travitch/datalog A Haskell implementation of Datalog, allowing recursive queries in a logic language. 102
kowainik/typerep-map Efficient implementation of Map where types serve as keys 100
sirherrbatka/cl-data-structures A collection of reusable data structures and streaming algorithms in Common Lisp. 47
kowainik/membrain Provides type-safe memory units through a Haskell library with minimal boilerplate 62
ekmett/structures A playground for advanced data structures in Haskell 63
precog/matryoshka A library providing generalized recursion schemes and traversals for recursive data structures in Scala. 811
iokasimov/apart A Haskell library for serializing and deserializing data structures in a persistent manner. 30
clojure/data.avl A data structure library implementing persistent AVL trees for sorted maps and sets with efficient rank queries, nearest key lookups, and other operations. 132
kowainik/tomland A Haskell library for bidirectional serialization of TOML configuration data 122
treilik/bubblelister A Go-based program for listing structs in a structured way 41
kowainik/relude A lightweight Haskell standard library designed to balance productivity, safety, and performance. 700
sidneycadot/oeis Tools for analyzing and processing sequence data from the Online Encyclopedia of Integer Sequences. 46
coq-community/fav-ssr A comprehensive library of verified data structures and algorithms in Coq 45