Lines Matching refs:symbol
74 int symbol;
86 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
87 if (code_lengths[symbol] > max_code_length) {
88 max_code_length = code_lengths[symbol];
94 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
95 ++code_length_hist[code_lengths[symbol]];
100 // next_codes[code_len] denotes the code to be assigned to the next symbol
110 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
111 if (code_lengths[symbol] > 0) {
112 huff_codes[symbol] = next_codes[code_lengths[symbol]]++;
114 huff_codes[symbol] = NON_EXISTENT_SYMBOL;
121 int symbol, int code, int code_length) {
139 return 0; // trying to assign a symbol to already used code.
141 node->symbol_ = symbol; // Add symbol in this node.
148 int symbol;
155 // Find out number of symbols and the root symbol.
156 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
157 if (code_lengths[symbol] > 0) {
158 // Note: code length = 0 indicates non-existent symbol.
160 root_symbol = symbol;
188 for (symbol = 0; symbol < code_lengths_size; ++symbol) {
189 if (code_lengths[symbol] > 0) {
190 if (!TreeAddSymbol(tree, symbol, codes[symbol], code_lengths[symbol])) {
