From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.1.3 Received: from discorde.inria.fr (discorde.inria.fr [192.93.2.38]) by yquem.inria.fr (Postfix) with ESMTP id 540FBBC68 for ; Thu, 26 Oct 2006 00:44:53 +0200 (CEST) Received: from ptb-relay02.plus.net (ptb-relay02.plus.net [212.159.14.213]) by discorde.inria.fr (8.13.6/8.13.6) with ESMTP id k9PMiqcE022893 (version=TLSv1/SSLv3 cipher=AES256-SHA bits=256 verify=NO) for ; Thu, 26 Oct 2006 00:44:53 +0200 Received: from [80.229.56.224] (helo=[10.0.0.5]) by ptb-relay02.plus.net with esmtp (Exim) id 1GcrUF-0002iX-Uj for caml-list@yquem.inria.fr; Wed, 25 Oct 2006 23:44:40 +0100 From: Jon Harrop Organization: Flying Frog Consultancy Ltd. To: caml-list@yquem.inria.fr Subject: Re: [Caml-list] Application wiich massively use exceptions Date: Wed, 25 Oct 2006 22:50:52 +0100 User-Agent: KMail/1.9.4 References: <003501c6f83d$d18537a0$0100a8c0@mshome.net> In-Reply-To: <003501c6f83d$d18537a0$0100a8c0@mshome.net> MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Content-Disposition: inline Message-Id: <200610252250.53078.jon@ffconsultancy.com> X-Miltered: at discorde with ID 453FE8E4.002 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; gava:01 iirc:01 reuse:01 ocaml:01 frog:98 wrote:01 caml-list:01 exception:01 exceptions:01 exceptions:01 algorithm:01 algorithm:01 caml:02 objective:02 frederic:03 On Wednesday 25 October 2006 14:59, Fr=E9d=E9ric Gava wrote: > With my research teams, we are working on parallel exceptions in parallel > programs. > > To have pratical examples, we are looking for an application which > massively use exceptions, i.e. use exceptions (many different ones if > possible) to propagate results/errors in an algorithm. > > Would somebody have an idea of such an algorithm or such an application ? > Many thanks ! IIRC, you did the parallel Set implementation. You could dust that off and= =20 reuse it, implementing insertion of an already-present element into a set=20 using an exception and applying it to the "n"th-nearest neighbours example= =20 from my book again. =2D-=20 Dr Jon D Harrop, Flying Frog Consultancy Ltd. Objective CAML for Scientists http://www.ffconsultancy.com/products/ocaml_for_scientists