reinsversion
Persistent data structure library from OCaml Summer Project 2007 sponsored by Jane St. Capital.
It provides: single linked lists, O(1) catenable lists, acyclic double linked lists, random access lists, double ended queues, binomial and skew binomial heap, AVL, red/black, splay and Patricia Maps and Sets with zipper style (persistent and bi-directional) cursor interfaces, along with functor combinators to minimize boilerplate.
| Author | Mike Furr |
|---|---|
| Published | |
| Homepage | http://ocaml-reins.sourceforge.net/ |
| Maintainer | ygrek@autistici.org |
| Dependencies | |
| Source [http] | http://downloads.sourceforge.net/project/ocaml-reins/ocaml-reins/ocaml-reins-0.1a/ocaml-reins-0.1a.tar.gz sha256=3f3fa0ac27d35abc4000184733f2a8deabd2f87310078fc343951ecb37d15a76 md5=696fa73fcce636f8710b7a83be613383 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/reins/reins.0.1a/opam |
No package is dependent
