Lines Matching defs:level
41 * tree levels, each level would consume 1 byte (See [1]).
55 * last level symbol count by 2 which makes it a number in
67 * and store pointers to each level's first symbol. In addition to
68 * that, maintain two counts for each level: inner nodes count and
76 each level */
78 each level */
83 first symbol of each tree level */
115 unpackd_fill_inodesin(const unpack_descriptor_t *unpackd, int level)
120 * leaf nodes in the next level. For the last level there
123 if (level < unpackd->treelevels) {
124 unpackd_fill_inodesin(unpackd, level + 1);
125 unpackd->inodesin[level] = (unpackd->inodesin[level + 1] +
126 unpackd->symbolsin[level + 1]) / 2;
128 unpackd->inodesin[level] = 0;
221 * it by reducing 2 from the actual number from the last level.
223 * We adjust the last level's symbol count by 1 here, because