Lines Matching refs:idx
596 int const idx = HUF_quickSortPartition(arr, low, high); in HUF_simpleQuickSort() local
597 if (idx - low < high - idx) { in HUF_simpleQuickSort()
598 HUF_simpleQuickSort(arr, low, idx - 1); in HUF_simpleQuickSort()
599 low = idx + 1; in HUF_simpleQuickSort()
601 HUF_simpleQuickSort(arr, idx + 1, high); in HUF_simpleQuickSort()
602 high = idx - 1; in HUF_simpleQuickSort()
875 FORCE_INLINE_TEMPLATE void HUF_addBits(HUF_CStream_t* bitC, HUF_CElt elt, int idx, int kFast) in HUF_addBits() argument
877 assert(idx <= 1); in HUF_addBits()
884 bitC->bitContainer[idx] >>= HUF_getNbBits(elt); in HUF_addBits()
885 bitC->bitContainer[idx] |= kFast ? HUF_getValueFast(elt) : HUF_getValue(elt); in HUF_addBits()
889 bitC->bitPos[idx] += HUF_getNbBitsFast(elt); in HUF_addBits()
890 assert((bitC->bitPos[idx] & 0xFF) <= HUF_BITS_IN_CONTAINER); in HUF_addBits()
903 assert(!kFast || (bitC->bitPos[idx] & 0xFF) <= HUF_BITS_IN_CONTAINER); in HUF_addBits()
983 HUF_encodeSymbol(HUF_CStream_t* bitCPtr, U32 symbol, const HUF_CElt* CTable, int idx, int fast) in HUF_encodeSymbol() argument
985 HUF_addBits(bitCPtr, CTable[symbol], idx, fast); in HUF_encodeSymbol()