3185   mz_uint16 m_key, m_sym_index;  member
3194     mz_uint freq = pSyms0[i].m_key;  in tdefl_radix_sort_syms()
3208       pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] =  in tdefl_radix_sort_syms()
3226     A[0].m_key = 1;  in tdefl_calculate_minimum_redundancy()
3229   A[0].m_key += A[1].m_key;  in tdefl_calculate_minimum_redundancy()
3233     if (leaf >= n || A[root].m_key < A[leaf].m_key) {  in tdefl_calculate_minimum_redundancy()
3234       A[next].m_key = A[root].m_key;  in tdefl_calculate_minimum_redundancy()
3235       A[root++].m_key = (mz_uint16)next;  in tdefl_calculate_minimum_redundancy()
3237       A[next].m_key = A[leaf++].m_key;  in tdefl_calculate_minimum_redundancy()
3238     if (leaf >= n || (root < next && A[root].m_key < A[leaf].m_key)) {  in tdefl_calculate_minimum_redundancy()
3239       A[next].m_key = (mz_uint16)(A[next].m_key + A[root].m_key);  in tdefl_calculate_minimum_redundancy()
3240       A[root++].m_key = (mz_uint16)next;  in tdefl_calculate_minimum_redundancy()
3242       A[next].m_key = (mz_uint16)(A[next].m_key + A[leaf++].m_key);  in tdefl_calculate_minimum_redundancy()
3244   A[n - 2].m_key = 0;  in tdefl_calculate_minimum_redundancy()
3246     A[next].m_key = A[A[next].m_key].m_key + 1;  in tdefl_calculate_minimum_redundancy()
3252     while (root >= 0 && (int)A[root].m_key == dpth) {  in tdefl_calculate_minimum_redundancy()
3257       A[next--].m_key = (mz_uint16)(dpth);  in tdefl_calculate_minimum_redundancy()
3306         syms0[num_used_syms].m_key = (mz_uint16)pSym_count[i];  in tdefl_optimize_huffman_table()
3313     for (i = 0; i < num_used_syms; i++) num_codes[pSyms[i].m_key]++;  in tdefl_optimize_huffman_table()