Re: [Caml-list] Ask for a more efficient way to deallocate memory (full version)

[Oliver Bandel <oliver@first.in-berlin.de>]

Zitat von Fabrice.Pardo@lpn.cnrs.fr:

[...]
>
> My question is how to write a code as efficient
> as it would be possible using a reference-counted language.
[...]

I don't now, from which languages you come, but possibly Python or Perl.

In a discussion on using data-structures (e.g. lists) compared to do it
"with iterators", I talked witha Python-programmer. He insisted to use
iterators, because that's so much more effifient.
Yes, when using Python you possibly should use it, because it's not as
efficient like OCaml is.

I prefer to have the data in a data structure,
so when changing something I easily can insert
a map-function to recalculate the results, without
ugly hacking.
And always I was astouned on OCaml's efficiency.

But when I started with OCaml I also had same
ideas in my head: I couldn't believe that it's true
how efficient OCaml is. But you have to do very
heavy things to come to the limits. I doubt that you are at
that point. :-)


Ciao,
   Oliver