Version française
Home     About     Download     Resources     Contact us    
Browse thread
Defining type that requires hashtables with recursive definition
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Jacques Carette <carette@m...>
Subject: Re: [Caml-list] Defining type that requires hashtables with recursive definition
Hugo Ferreira wrote:
> 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
and links = (node, node) Hashtbl.t

should do it.

Jacques