Lines Matching defs:leaves
145 * The leaves of the trie are embedded in the trie, and so the same
157 * between 0 and 254 inclusive, which leaves 255 available as
424 int nodes, singletons, leaves;
426 nodes = singletons = leaves = 0;
432 leaves = 1;
456 leaves += 1;
470 leaves += 1;
485 printf("nodes %d leaves %d singletons %d\n",
486 nodes, leaves, singletons);
528 * fully populated and end in identical leaves. A nextbyte tagged
643 * identical choices and end in identical leaves. The keymask and
646 * branch of a node, and the two leaves comare identical, the node in
812 * Mark the nodes in the tree that lead to leaves that must be
1042 * Compute the size of nodes and leaves. We start by assuming that
1197 int leaves;
1202 leaves = 0;
1214 leaves++;
1280 leaves++;
1297 leaves++;
1313 printf("Emitted %d (%d) leaves",
1314 leaves, bytes);