Re: The performance cost of using exceptions?

From: Jean-Francois Monin (jeanfrancois.monin@rd.francetelecom.fr)
Date: Tue May 16 2000 - 18:11:03 MET DST

  • Next message: Markus Mottl: "Re: The performance cost of using exceptions?"

    > From: Pierpaolo Bernardi <bernardp@cli.di.unipi.it>
    >
    > Usually, that is, in the most straightforward implementation, you rebuild
    > the path on the way up. By throwing the exception, you don't cons any new
    > node.
    > [...]
    > For this to work, you should either have a low-level pointer equality
    > operator (present in OCaml, but not in other func. languages), or you
    > must return a flag to signal whether the returned tree is unchanged.
    > Both variants are ugly and cumbersome, IMO.

    This theme was discussed last year under a thread called
     "List.filter in Ocaml 2.02" 

    -- 
Jean-Francois Monin, CNET DTL/MSV,          Tel +33 2 96 05 26 79
2 av. Pierre Marzin, 22307 Lannion, France  Fax +33 2 96 05 39 45
 NEW                       JeanFrancois.Monin@francetelecom.fr

    This archive was generated by hypermail 2b29 : Tue May 16 2000 - 18:13:51 MET DST