Searched refs:mHeap (Results 1 – 6 of 6) sorted by relevance
91 STATIC INT16 mHeap[NC + 1]; variable662 LoopVar2 = mHeap[i]; in DownHeap()665 if (LoopVar1 < mHeapSize && mFreq[mHeap[LoopVar1]] > mFreq[mHeap[LoopVar1 + 1]]) { in DownHeap()669 if (mFreq[LoopVar2] <= mFreq[mHeap[LoopVar1]]) { in DownHeap()673 mHeap[i] = mHeap[LoopVar1]; in DownHeap()678 mHeap[i] = (INT16) LoopVar2; in DownHeap()819 mHeap[1] = 0; in MakeTree()824 mHeap[mHeapSize] = (INT16) LoopVar1; in MakeTree()829 CodeParm[mHeap[1]] = 0; in MakeTree()830 return mHeap[1]; in MakeTree()[all …]
253 STATIC INT16 mHeap[NC + 1]; variable1466 k = mHeap[i]; in DownHeap()1468 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap()1471 if (mFreq[k] <= mFreq[mHeap[j]]) { in DownHeap()1474 mHeap[i] = mHeap[j]; in DownHeap()1477 mHeap[i] = (INT16)k; in DownHeap()1553 mHeap[1] = 0; in MakeTree()1557 mHeap[++mHeapSize] = (INT16)i; in MakeTree()1561 CodeParm[mHeap[1]] = 0; in MakeTree()1562 return mHeap[1]; in MakeTree()[all …]
271 STATIC INT16 mHeap[NC + 1]; variable1619 Index3 = mHeap[Index]; in DownHeap()1622 if (Index2 < mHeapSize && mFreq[mHeap[Index2]] > mFreq[mHeap[Index2 + 1]]) { in DownHeap()1626 if (mFreq[Index3] <= mFreq[mHeap[Index2]]) { in DownHeap()1630 mHeap[Index] = mHeap[Index2]; in DownHeap()1635 mHeap[Index] = (INT16) Index3; in DownHeap()1714 mHeap[1] = 0; in MakeTree()1719 mHeap[mHeapSize] = (INT16) Index; in MakeTree()1724 CodeParm[mHeap[1]] = 0; in MakeTree()1725 return mHeap[1]; in MakeTree()[all …]
243 STATIC INT16 mHeap[NC + 1]; variable1463 k = mHeap[i]; in DownHeap()1465 if (j < mHeapSize && mFreq[mHeap[j]] > mFreq[mHeap[j + 1]]) { in DownHeap()1468 if (mFreq[k] <= mFreq[mHeap[j]]) { in DownHeap()1471 mHeap[i] = mHeap[j]; in DownHeap()1474 mHeap[i] = (INT16)k; in DownHeap()1550 mHeap[1] = 0; in MakeTree()1554 mHeap[++mHeapSize] = (INT16)i; in MakeTree()1558 CodeParm[mHeap[1]] = 0; in MakeTree()1559 return mHeap[1]; in MakeTree()[all …]
252 STATIC INT16 mHeap[NC + 1]; variable1599 Index3 = mHeap[Index]; in DownHeap()1602 if (Index2 < mHeapSize && mFreq[mHeap[Index2]] > mFreq[mHeap[Index2 + 1]]) { in DownHeap()1606 if (mFreq[Index3] <= mFreq[mHeap[Index2]]) { in DownHeap()1610 mHeap[Index] = mHeap[Index2]; in DownHeap()1615 mHeap[Index] = (INT16) Index3; in DownHeap()1694 mHeap[1] = 0; in MakeTree()1699 mHeap[mHeapSize] = (INT16) Index; in MakeTree()1704 CodeParm[mHeap[1]] = 0; in MakeTree()1705 return mHeap[1]; in MakeTree()[all …]
70 STATIC INT16 mHeap[NC + 1]; variable1425 Index3 = mHeap[Index]; in DownHeap()1428 if (Index2 < mHeapSize && mFreq[mHeap[Index2]] > mFreq[mHeap[Index2 + 1]]) { in DownHeap()1432 if (mFreq[Index3] <= mFreq[mHeap[Index2]]) { in DownHeap()1436 mHeap[Index] = mHeap[Index2]; in DownHeap()1441 mHeap[Index] = (INT16) Index3; in DownHeap()1520 mHeap[1] = 0; in MakeTree()1525 mHeap[mHeapSize] = (INT16) Index; in MakeTree()1530 CodeParm[mHeap[1]] = 0; in MakeTree()1531 return mHeap[1]; in MakeTree()[all …]