mqtermtypespec.cpp

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

idx; // index in the saved state array
            int clen; // current calculated length
            bool cdFF; // the current delayed FF state
            int nb;   // the next byte of output
            int minlen; // minimum possible length
            int maxlen; // maximum possible length

            // Start on the first pass of this segment
            ridx = pidx-m_nsavedNums;
            // Minimum allowable length is length of previous termination
            minlen = (ridx-1>=0) ? pRateBuf[ridx-1] : 0;
            // Maximum possible length is the terminated length