/usr/lib/ocaml/reins/patriciaSet.mli is in libreins-ocaml-dev 0.1a-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 | (**************************************************************************)
(* The OCaml Reins Library *)
(* *)
(* Copyright 2007 Mike Furr. *)
(* All rights reserved. This file is distributed under the terms of the *)
(* GNU Lesser General Public License version 2.1 with the linking *)
(* exception given in the COPYING file. *)
(**************************************************************************)
(** Efficient sets of integers
Patricia trees are balanced binary search trees whose elements are
integers. These trees can be very efficient since navigating the
each tree uses only specific bits of the elements value. They
have O(w) worst case running time for the [mem], [add], [remove]
where w is the number of bits in an integer, but typically run in
O(log n) time for most inputs. Because, Patricia trees never need
to be re-balanced, [union], [inter], and [diff] can be much faster
than ordinary balanced trees, but still may take O(n+m) in the
worst case.
*)
(** This module implements sets with integer keys *)
module MonoSet : Sets.MonoSetSig with type elt = int
and type 'a result = 'a
(** Same as the {!PatriciaSet.MonoSet} module, except it also provides
the [gen] function.
*)
module GenSet : Sets.GenSetSig with type elt = int
and type 'a result = 'a
|