From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 2133EBBBB for ; Fri, 31 Mar 2006 14:22:07 +0200 (CEST) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id k2VCM7xZ021931 for ; Fri, 31 Mar 2006 14:22:07 +0200 Received: from concorde.inria.fr (concorde.inria.fr [192.93.2.39]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id OAA23180 for ; Fri, 31 Mar 2006 14:22:06 +0200 (MET DST) Received: from ash25e.internode.on.net (ash25e.internode.on.net [203.16.214.182]) by concorde.inria.fr (8.13.0/8.13.0) with ESMTP id k2VCM44g030170 for ; Fri, 31 Mar 2006 14:22:05 +0200 Received: from rosella (ppp36-94.lns2.syd6.internode.on.net [59.167.36.94]) by ash25e.internode.on.net (8.13.6/8.13.5) with ESMTP id k2VCLo63050399; Fri, 31 Mar 2006 22:51:51 +1030 (CST) (envelope-from skaller@users.sourceforge.net) Subject: Re: [Caml-list] efficient binary relations? From: skaller To: Christian Lindig Cc: Caml List In-Reply-To: <4120ea8c70420ccd2f670bd9e4433527@cs.uni-sb.de> References: <4120ea8c70420ccd2f670bd9e4433527@cs.uni-sb.de> Content-Type: text/plain Date: Fri, 31 Mar 2006 23:21:50 +1100 Message-Id: <1143807710.8248.6.camel@rosella.wigram> Mime-Version: 1.0 X-Mailer: Evolution 2.4.1 Content-Transfer-Encoding: 7bit X-Miltered: at nez-perce with ID 442D1EEF.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at concorde with ID 442D1EEC.001 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; binary:01 lindig:01 binary:01 ocaml:01 bitvectors:01 high-level:01 2006:98 wrote:01 sourceforge:01 caml-list:01 imperative:01 data:02 fri:05 structure:05 elements:06 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 On Fri, 2006-03-31 at 13:56 +0200, Christian Lindig wrote: > I am looking for an efficient representation of binary relations in > OCaml. I have used bitvectors in the past but would like to use a more > high-level and less imperative data structure. You have said nothing about the type of elements and their distribution.. -- John Skaller Felix, successor to C++: http://felix.sf.net