Print statistics given the above and some internally stored
values. First controls printing out the title, and name is the
name of your table.
The description of each field is the same as above,
but hits is the total number of lookup requests, and
depth is the average search depth once we've hash to the node (smaller is
better).
Here is a run from a debugger with oodles of nodes.
table buckets total min max empty hits depth average
UST 8191 2437 0 7 6865 2527 1.762 0.298
Struct 8191 6632 0 21 6787 26484 3.877 0.810
Func 2047 1132 0 5 1240 1133 1.000 0.553
Generally decent results, but I'm sort of clueless why
Struct is so concentrated in so few buckets. Even as unhappy
as it looks, it's still much better than a binary tree or
even a 2-3 tree whose average depth would be about 10 (8-13).