or if you really want to define your own equality, you can use recursive modules:
module rec H : Hashtbl.HashedType =
struct
type node =
| Node of node J.t
| Leaf of int
type t = node
let equal (e1:node) (e2:node) = (==) e1 e2
let hash (e:node) = Hashtbl.hash e
end
and J : Hashtbl.S = Hashtbl.Make( H )
Hugo Ferreira wrote:and links = (node, node) Hashtbl.t
I am attempting to define a type so:
type node =
| Node of links
| Leaf of int
And I want to implement links as a
hashtable whose keys and values are
also of type node.
type node =
| Node of links
| Leaf of int
should do it.
Jacques
_______________________________________________
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs