reins

Persistent data structure library from OCaml Summer Project 2007 sponsored by Jane St. Capital.
Description

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.

Install
Published
21 Nov 2013
Authors
Sources
ocaml-reins-0.1a.tar.gz
md5=696fa73fcce636f8710b7a83be613383
Dependencies
Reverse Dependencies