codedblkdata.cpp

jpeg 2000 压缩算法源代码 核心ebcot

exs = new int[npnt];
        if (pIsTerm)
		{
            m_pIsTermPass = new bool[n];
            memcpy(m_pIsTermPass,pIsTerm,sizeof(bool)*n);

        }
        else
		{
            m_pIsTermPass = 0;
        }
        memcpy(m_pTruncRates,pRates,sizeof(int)*n);

        for (k=first_pnt, p=-1, i=0; k<n; k++)
		{
            if (pRates[k]>0)
			{ // A valid point
                m_pTruncDists[k] = pDists[k];
                if (p<0) 
				{ // Only arrives at first valid point
                    m_pTruncSlopes[i] = (double)(pDists[k]/pRates[k]);
                }
                else 
				{
                    m_pTruncSlopes[i] = (double)((pDists[k]-pDists[p])/
                                             (pRates[k]-pRates[p]));
                }
                m_pTruncIndexs[i] =