";
let i = ref((n-1) mod interval + 1) in
add_string buf (String.sub s 0 (!i));
while !i < n do
add_string buf delim;
add_string buf (String.sub s (!i) interval);
i := !i + interval
done;
add_string buf "";
contents buf
let i n = fmt (string_of_int n)
let f m = fmt (Printf.sprintf "%.0f" m) ?>
Garbage collector statistics
- minor words:
- Number of words allocated in the minor heap since
the program was started. This number is accurate in
byte-code programs, but only an approximation in
programs compiled to native code.
- promoted words:
- Number of words allocated in the minor heap that
survived a minor collection and were moved to the
major heap since the program was started.
- major words:
- Number of words allocated in the major heap, including
the promoted words, since the program was started.
- minor collections:
- Number of minor collections since the program was started.
- major collections:
- Number of major collection cycles completed since the program
was started.
- heap words:
- Total size of the major heap, in words.
- heap chunks:
- Number of contiguous pieces of memory that make up the major heap.
- live words:
- Number of words of live data in the major heap, including the header
words.
- live blocks:
- Number of live blocks in the major heap.
- free words:
- Number of words in the free list.
- free blocks:
- Number of blocks in the free list.
- largest free:
- Size (in words) of the largest block in the free list.
- fragments:
- Number of wasted words due to fragmentation. These are
1-words free blocks placed between two live blocks. They
are not available for allocation.
- compactions:
- Number of heap compactions since the program was started.
- top heap words:
- Maximum size reached by the major heap, in words.