ptsetversion Documentation on ocaml.org
Sets of integers implemented as Patricia trees
An implementation inspired by Okasaki & Gill's paper 'Fast Mergeable Integer Maps'
| Author | Jean-Christophe Filliâtre |
|---|---|
| License | LGPL-2.1-only |
| Published | |
| Homepage | https://github.com/backtracking/ptset |
| Issue Tracker | https://github.com/backtracking/ptset/issues |
| Maintainer | Jean-Christophe.Filliatre@lri.fr |
| Dependencies |
|
| Source [http] | https://github.com/backtracking/ptset/releases/download/1.0.1/ptset-1.0.1.tbz sha256=4490119ee0eb40f9b148b0343286ee2a336696d8daf1805b1d898a305f0528df sha512=c8ddaa078319639ffb778d64feca6b2d590bd9b77b9e9d0b055aaf2d46400be3898939aa63a5b319267c034a43ba233f8f019f178f166ea2961480fb5bd00037 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/ptset/ptset.1.0.1/opam |
Required by
