]> >From: Julie Farago <farago@eecs.harvard.edu> > >Is there a paper on the compaction code (compact.c) of the garbage >collector (in byterun/)? Even though the documentation in this file is >really exceptional, I am a little confused by how the inversion of >pointers is used to compact the heap. Is there an algorithm I should >lookup? There is no paper on compact.c itself, but the algorithm is not original. If I remember correctly, it is from this paper: F. Lockwood Morris, A time- and space-efficient garbage compaction algorithm, Communications of the ACM, v.21 n.8, p.662-665, Aug. 1978 The only tricky part is the double inversion of pointers to infix headers. If you really need it, I'll write up a short description and put it on my web page. -- Damien ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners