English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
[Caml-list] Dynamically evaluating OCaml code
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2004-04-08 (15:39)
From: Jon Harrop <jdh30@c...>
Subject: Re: [Caml-list] Dynamically evaluating OCaml code
On Thursday 08 April 2004 4:26 pm, Markus Mottl wrote:
> That's also my opinion: it's usually an indication of a bad choice
> concerning datastructure if you need such list functions.

If you mean a bad choice from the point of view of efficiency then yes, it is, 
but I know that the resulting inefficient code will only account for a 
fraction of a percent of the total run-time and, therefore, I don't care. I 
just want to have to write as little code as possible to get the job done.


To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners