1057 typedef struct { mz_uint16 m_key, m_sym_index; } tdefl_sym_freq;  member
1061 …for (i = 0; i < num_syms; i++) { mz_uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + (…  in tdefl_radix_sort_syms()
1068 …for (i = 0; i < num_syms; i++) pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = p…  in tdefl_radix_sort_syms()
1078   if (n==0) return; else if (n==1) { A[0].m_key = 1; return; }  in tdefl_calculate_minimum_redundancy()
1079   A[0].m_key += A[1].m_key; root = 0; leaf = 2;  in tdefl_calculate_minimum_redundancy()
1082 …n || A[root].m_key<A[leaf].m_key) { A[next].m_key = A[root].m_key; A[root++].m_key = (mz_uint16)ne…  in tdefl_calculate_minimum_redundancy()
1083 …m_key<A[leaf].m_key)) { A[next].m_key = (mz_uint16)(A[next].m_key + A[root].m_key); A[root++].m_ke…  in tdefl_calculate_minimum_redundancy()
1085   A[n-2].m_key = 0; for (next=n-3; next>=0; next--) A[next].m_key = A[A[next].m_key].m_key+1;  in tdefl_calculate_minimum_redundancy()
1089     while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; }  in tdefl_calculate_minimum_redundancy()
1090     while (avbl>used) { A[next--].m_key = (mz_uint16)(dpth); avbl--; }  in tdefl_calculate_minimum_redundancy()
1122 …for (i = 0; i < table_len; i++) if (pSym_count[i]) { syms0[num_used_syms].m_key = (mz_uint16)pSym_…  in tdefl_optimize_huffman_table()
1126     for (i = 0; i < num_used_syms; i++) num_codes[pSyms[i].m_key]++;  in tdefl_optimize_huffman_table()