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
Re: [Caml-list] mark_slice, sweep_slice, oldify
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2001-09-24 (17:48)
From: Marco Maggesi <maggesi@m...>
Subject: Re: [Caml-list] mark_slice, sweep_slice, oldify

Damien and Xavier, thank you for your clear and concrete answers.  I
already had some benefit by playing with [Gc.set].  However, I think I
will need more time to do some tests and understand better what's
going on, but I do not have enough time at the moment.  I will send a
notice if I will obtain something interesting.

I realized that my problem can be described with a good approximation
as follows: how to merge a certain number of ordered lists in a single
orederd list.  Even better, I need to merge a matrix a_{i,j} of
elements which are ordered by rows and by columns
  a_{i+1,j} >= a_{i,j}   and   a_{1,j+1} >= a_{i,j}
for all i, j.

My approach is to use leftist trees to reduce the cost of merging
lists in pairs.  Probably, this is responsable for the allocation of
many intermediate structures to compute the result.  Probably I can do
better than that.  I think I have to look more depthly in the theory.
(Perhaps The Art of Computer Programs?)

Ciao, Marco
Bug reports:  FAQ:
To unsubscribe, mail  Archives: