Fri Oct 15 08:41:49 PDT 2004 olaf * Extended tracing to write extended fileformat, i.e. children of Hidden nodes. Nicely only a tiny change is needed in Hat.hs, calling the new recordChild function in fun_i combinators when the parent is hidden. So the additional child information only costs time when there are such children. Most changes in hat-c.c. New buffer for every Hidden node that has children (but not those that do not). This buffer enables simple reading and updating of the child pointer of a Hidden. The buffer is only written at termination time, so unfortunately the space requirements of a traced program are no longer proportional to that of an untraced one. However, I believe that in practise the buffer will never be large. The buffer is currently a linked list of arrays. A tree structure would allow faster lookup, but the existing FiniteMap is unsuitable (only for pointers). hat-check has been modified to make appropriate checks. M ./src/hatlib/Hat/Hat.hs -15 +33 M ./src/hatlib/hat-c.c -7 +109 M ./src/hatlib/hat-c.h +3 M ./src/hattools/hat-check.c -3 +3