#include <tigertree.h>
If this overflows (as it will for input longer than 2^64 in size), havoc may ensue.
Data Fields | |
| gchar * | top |
| top (next empty) stack slot | |
| gchar * | block |
| leaf data | |
| gint64 | count |
| total blocks processed | |
| int | index |
| index into block | |
| gchar | leaf [1+BLOCKSIZE] |
| leaf in progress | |
| gchar | node [1+NODESIZE] |
| node scratch space | |
| gchar | nodes [TIGERSIZE *56] |
| stack of interim node values | |
|
|
leaf data
|
|
|
total blocks processed
|
|
|
index into block
|
|
|
leaf in progress
|
|
|
node scratch space
|
|
|
stack of interim node values
|
|
|
top (next empty) stack slot
|
1.3.6