Lines Matching defs:items
83 static BROTLI_INLINE void SortHuffmanTreeItems(HuffmanTree* items,
89 HuffmanTree tmp = items[i];
92 while (comparator(&tmp, &items[j])) {
93 items[k] = items[j];
97 items[k] = tmp;
108 HuffmanTree tmp = items[i];
109 for (; j >= gap && comparator(&tmp, &items[j - gap]); j -= gap) {
110 items[j] = items[j - gap];
112 items[j] = tmp;