ocaml-reins 0.1a-7build1 source package in Ubuntu


ocaml-reins (0.1a-7build1) bionic; urgency=medium

  * Rebuild against new OCAML ABIs.

 -- Gianfranco Costamagna <email address hidden>  Sat, 28 Oct 2017 13:36:57 +0200

Upload details

Uploaded by:
Gianfranco Costamagna on 2017-10-28
Uploaded to:
Original maintainer:
Debian OCaml Maintainers
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Disco release on 2018-10-30 universe libdevel
Cosmic release on 2018-05-01 universe libdevel
Bionic release on 2017-11-05 universe libdevel


File Size SHA-256 Checksum
ocaml-reins_0.1a.orig.tar.gz 95.1 KiB 3f3fa0ac27d35abc4000184733f2a8deabd2f87310078fc343951ecb37d15a76
ocaml-reins_0.1a-7build1.debian.tar.xz 5.2 KiB de731e0bb89eed037c06785061f467208b00770d9305aeeaf633e9e13d18906c
ocaml-reins_0.1a-7build1.dsc 2.0 KiB c13fb96355e29a1b3ff2c78e23ea20c69139b9903a520e45f1e747c34e66813b

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.