Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

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: -- (:)
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 Archives:
Bug reports: FAQ:
Beginner's list: