1995-08-09 08:06:35 -07:00
|
|
|
(***********************************************************************)
|
|
|
|
|
(* *)
|
2011-07-27 07:17:02 -07:00
|
|
|
(* OCaml *)
|
1995-08-09 08:06:35 -07:00
|
|
|
(* *)
|
|
|
|
|
(* Xavier Leroy, projet Cristal, INRIA Rocquencourt *)
|
|
|
|
|
(* *)
|
1996-04-30 07:53:58 -07:00
|
|
|
(* Copyright 1996 Institut National de Recherche en Informatique et *)
|
1999-11-17 10:59:06 -08:00
|
|
|
(* en Automatique. All rights reserved. This file is distributed *)
|
|
|
|
|
(* under the terms of the Q Public License version 1.0. *)
|
1995-08-09 08:06:35 -07:00
|
|
|
(* *)
|
|
|
|
|
(***********************************************************************)
|
|
|
|
|
|
|
|
|
|
(* $Id$ *)
|
|
|
|
|
|
1995-05-04 03:15:53 -07:00
|
|
|
(* Association tables from any ordered type to any type.
|
|
|
|
|
We use the generic ordering to compare keys. *)
|
|
|
|
|
|
|
|
|
|
type ('a, 'b) t
|
|
|
|
|
|
|
|
|
|
val empty: ('a, 'b) t
|
|
|
|
|
val add: 'a -> 'b -> ('a, 'b) t -> ('a, 'b) t
|
|
|
|
|
val find: 'a -> ('a, 'b) t -> 'b
|
1998-11-05 00:08:28 -08:00
|
|
|
val mem: 'a -> ('a, 'b) t -> bool
|
1996-05-16 07:15:35 -07:00
|
|
|
val remove: 'a -> ('a, 'b) t -> ('a, 'b) t
|
2009-12-09 01:52:47 -08:00
|
|
|
val iter: ('a -> 'b -> unit) -> ('a, 'b) t -> unit
|
2009-05-20 04:52:42 -07:00
|
|
|
val map: ('a -> 'b -> 'c) -> ('a, 'b) t -> ('a, 'c) t
|
2010-04-20 07:11:28 -07:00
|
|
|
val fold: ('a -> 'b -> 'c -> 'c) -> ('a, 'b) t -> 'c -> 'c
|
1995-05-04 03:15:53 -07:00
|
|
|
|
2000-04-21 01:13:22 -07:00
|
|
|
open Format
|
|
|
|
|
|
|
|
|
|
val print: (formatter -> 'a -> unit) -> (formatter -> 'b -> unit) ->
|
|
|
|
|
formatter -> ('a, 'b) t -> unit
|
