Lines Matching refs:examine
10 Prune examine() search on previously visited states
23 Examine all possible Huffman codes for a given number of symbols and a
317 /* Examine all possible codes from the given node (syms, len, left). Compute
322 local void examine(int syms, int len, int left, int mem, int rem)
382 /* examine codes from here, updating table space as we go */
385 examine(syms - use, len + 1, (left - use) << 1,
423 examine(n, root + 1, left, 1 << root, 0);
428 examine((n - left) << 1, root + 1, (n - left) << 1,
437 Examine and show the total number of possible Huffman codes for a given
447 To count and examine Huffman codes that are not length-limited, provide a
