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

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2008-02-07 (16:28)
From: Jon Harrop <jon@f...>
Subject: Re: [Caml-list] Performance-question
On Thursday 07 February 2008 16:13:25 Damien Doligez wrote:
> More generally, I'm looking for (small) programs that exhibit this
> kind of behaviour: they call the compactor frequently and their memory
> usage grows without bound when the compactor is disabled.

The "n"th-nearest neighbor example from OCaml for Scientists is certainly very 
allocation intensive because it makes extensive use of the Set module:

but I'm not sure that its memory use will grow unbounded if compaction is 
disabled though.

Dr Jon D Harrop, Flying Frog Consultancy Ltd.