Lines Matching defs:nodes
113 * Internal nodes are one byte for the node itself, and up to three
128 * Due to the way utf8 works, there cannot be branching nodes with
129 * NEXTBYTE set, and moreover those nodes always have a righthand
424 int nodes, singletons, leaves;
426 nodes = singletons = leaves = 0;
444 nodes += 1;
485 printf("nodes %d leaves %d singletons %d\n",
486 nodes, leaves, singletons);
638 * Prune internal nodes.
641 * been collapsed. There are still internal nodes that have for both
644 * keybits collected in the nodes describe the choices made in these
649 * Note that nodes with the nextbyte tag set will not be removed by
651 * utf8 ensures that these nodes would not have been candidates for
808 printf("Pruned %d nodes\n", count);
812 * Mark the nodes in the tree that lead to leaves that must be
934 printf("Marked %d nodes\n", marked);
940 * offsets between nodes are used to navigate the tree.
1023 * Mark the nodes in a subtree, helper for size_nodes().
1042 * Compute the size of nodes and leaves. We start by assuming that
1044 * nodes are calculated based on that, and then this function is
1045 * called to see if the sizes of some nodes can be reduced. This is
1198 int nodes[4];
1201 nodes[0] = nodes[1] = nodes[2] = nodes[3] = 0;
1242 nodes[offlen]++;
1255 nodes[0]++;
1262 nodes[0]++;
1315 printf(" %d (%d+%d+%d+%d) nodes",
1316 nodes[0] + nodes[1] + nodes[2] + nodes[3],
1317 nodes[0], nodes[1], nodes[2], nodes[3]);