381 /* uncompress a compressed symbol. When this function is called, the best table
642 	int i, best, bestprofit;  in find_best_token()  local
645 	best = 0;  in find_best_token()
649 			best = i;  in find_best_token()
653 	return best;  in find_best_token()
656 /* this is the core of the algorithm: calculate the "best" table */
659 	int i, best;  in optimize_result()  local
669 			/* find the token with the best profit value */  in optimize_result()
670 			best = find_best_token();  in optimize_result()
671 			if (token_profit[best] == 0)  in optimize_result()
674 			/* place it in the "best" table */  in optimize_result()
676 			best_table[i][0] = best & 0xFF;  in optimize_result()
677 			best_table[i][1] = (best >> 8) & 0xFF;  in optimize_result()