Ubuntu
ocaml-reins package

ocaml-reins 0.1a-11build2 source package in Ubuntu

Changelog

ocaml-reins (0.1a-11build2) noble; urgency=medium

  * Rebuild against new OCAML ABIs.

 -- Gianfranco Costamagna <email address hidden>  Fri, 16 Feb 2024 16:30:45 +0100

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Noble
Original maintainer:
Debian OCaml Maintainers
Architectures:
any
Section:
ocaml
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Noble release universe ocaml

Downloads

File Size SHA-256 Checksum
ocaml-reins_0.1a.orig.tar.gz 95.1 KiB 3f3fa0ac27d35abc4000184733f2a8deabd2f87310078fc343951ecb37d15a76
ocaml-reins_0.1a-11build2.debian.tar.xz 6.1 KiB 11c78b7eefdf05b8c97927714c82bec58e2832e542a5d8fe7707f33ac5b62a94
ocaml-reins_0.1a-11build2.dsc 2.0 KiB 2b42513c83de767b60ed442e55c9cec94ffd51c571e1950de68250f03d502e10

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.