Ubuntu
ocaml-reins package

ocaml-reins 0.1a-4build3 source package in Ubuntu

Changelog

ocaml-reins (0.1a-4build3) trusty; urgency=medium

  * Rebuild for ocaml-4.01.
 -- Matthias Klose <email address hidden>   Mon, 23 Dec 2013 20:27:51 +0000

Upload details

Uploaded by:
Matthias Klose
Uploaded to:
Trusty
Original maintainer:
Debian OCaml Maintainers
Architectures:
any
Section:
libdevel
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section

Downloads

File Size SHA-256 Checksum
ocaml-reins_0.1a.orig.tar.gz 95.1 KiB 3f3fa0ac27d35abc4000184733f2a8deabd2f87310078fc343951ecb37d15a76
ocaml-reins_0.1a-4build3.debian.tar.gz 3.6 KiB d03b79bd027acfca1b9fc3882d61ce24caf3c22665f1dea69347df5f6d026386
ocaml-reins_0.1a-4build3.dsc 1.5 KiB 53a02c98b0535ca267a90715f54737a30d33f52e7daa273435421d8d1f84d204

Available diffs

View changes file

Binary packages built by this source

libreins-ocaml-dev: data structure library for OCaml

 The OCaml Reins data structure library consists of the following
 persistent implementations:
  * Lists (singly, O(1) catenable, Acyclic doubly linked,
           random access)
  * Sets/Maps (AVL, Red/Black, Patricia, Splay)
  * Heaps (Binomial, Skew-Binomial)
 .
 All of the implementations conform to a unified signature for each
 data type. Also, each data types include zipper style cursor
 interfaces and persistent, bi-directional cursor based iterators.
 The library also includes a set of standard modules to hoist the base
 typs into the module level (Int, Bool, etc...) as well as a
 collection of functor combinators to minimize boilerplate (e.g., for
 constructing compare or to_string functions). Finally, a
 quickcheck-like random testing framework is included and each data
 type supports the necessary "gen" function to generate a random
 instance of the type.