ocaml-reins 0.1a-4build2 source package in Ubuntu
Changelog
ocaml-reins (0.1a-4build2) precise; urgency=low * Rebuild for OCaml 3.12.1. -- Colin Watson <email address hidden> Sat, 19 Nov 2011 12:07:12 +0000
Upload details
- Uploaded by:
- Colin Watson
- Uploaded to:
- Precise
- Original maintainer:
- Debian OCaml Maintainers
- Architectures:
- any
- Section:
- libdevel
- Urgency:
- Low Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Precise | release | universe | libdevel |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
ocaml-reins_0.1a.orig.tar.gz | 95.1 KiB | 3f3fa0ac27d35abc4000184733f2a8deabd2f87310078fc343951ecb37d15a76 |
ocaml-reins_0.1a-4build2.debian.tar.gz | 3.5 KiB | fd969af319282ecaa650a5118c53f4e73b2914f8f92f6db648aa87c05ca84cac |
ocaml-reins_0.1a-4build2.dsc | 2.2 KiB | a678f3c76d0c7baf2ec732f0265b19cabae7dc2956ecfe1cd2106730b6bd4b32 |
Available diffs
- diff from 0.1a-4build1 to 0.1a-4build2 (326 bytes)
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.