array of size <code>n</code> where the nth entry is from the nth tree.</p>
</li>
<li>
<p><code>info</code> maintains the state of the traversal.</p>
</li>
</ul>
</div>
<div class="paragraph">
<p>Returning a negative value will terminate the traversal. Otherwise the
return value is treated as an update mask. If the nth bit is set the nth tree
will be updated and if the bit is not set the nth tree entry will be the
same in the next callback invocation.</p>
</div>
</dd>
<dt class="hdlist1"><code>make_traverse_