Browse thread
Memory statistics tool
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2008-07-23 (13:09) |
From: | Dr. Thomas Fischbacher <t.fischbacher@s...> |
Subject: | Re: [Caml-list] Memory statistics tool |
dmitry grebeniuk wrote: > DTF> memory_footprint: 'a -> int64 (or maybe float), > > objsize, now hosted on OCaml forge: > http://forge.ocamlcore.org/projects/objsize/ Many thanks! I just had a glance at it, but it seems to be just how one would have to approach such a problem. (The issue with hash-based approaches to find previously visited substructures is that during traversal, a GC may occur. Now I just assume that this may involve relocation and heap compaction in OCaml. The problem then is that OCaml does not properly support what would be known as eq hash tables in Lisp.) -- best regards, Thomas Fischbacher t.fischbacher@soton.ac.uk