Ubuntu
ocaml-reins package

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

Changelog

ocaml-reins (0.1a-4build1) oneiric; urgency=low

  * Rebuild to pick up ocaml fixes on armel.
 -- Adam Conrad <email address hidden>   Wed, 24 Aug 2011 16:35:12 -0600

Upload details

Uploaded by:
Adam Conrad
Uploaded to:
Oneiric
Original maintainer:
Debian OCaml Maintainers
Architectures:
any
Section:
libdevel
Urgency:
Low 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-4build1.debian.tar.gz 3.4 KiB 2971dc70908dea0dd98c317bdd1032fc449615586fb207dd799823769c2644cc
ocaml-reins_0.1a-4build1.dsc 1.4 KiB 0e237da55892e65872dd11844281bb2a7b5fcb1c772d54dc96e823ca126725dc

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.