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
Is OCaml fast?
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2010-11-24 (17:32)
From: Isaac Gouy <igouy2@y...>
Subject: Re: Is OCaml fast?
Christophe Troestler <Christophe.Troestler+ocaml <at>> writes:

> Isolating a sentence gives a misleading idea of what I said. 

gmane demands "Prune quoted stuff."

> Must I
> really repeat that I was asking WHY is C allowed to use an external
> library to enhance its memory management¹ but OCaml cannot use its own
> library to do that.

Do the OCaml binary-trees programs that are shown not use OCaml memory 


Do the C programs that are shown tune the external library memory management

they use?

> I am not asking WHAT the rules are but a JUSTIFICATION for them (which you
> have been incapable of providing so far).

I feel no need to provide a JUSTIFICATION to you for anything.

> ¹ Apparently the "Please don't implement your own custom memory pool
> or free list." does not count if it's implemented by others!

Many C and C++ programmmers rolled their own custom free list implementations as

part of their program. 

Library memory pool and free list implementations have to be more generally

useful (and probably less efficient) than custom solutions created specifically

for this tiny task.

"Please don't implement your own custom memory pool or free list." means exactly
what it says.