该算法引入了线性索引技术和LZC算法标志位图，采用了类似于SPIHT算法的扫描顺序，将待编码流按不同种类进行算术编码。
The algorithm integrates the linear indexing technique and flag map which LZC adopts, USES the scan order which is the same of SPIHT algorithm, sends the coding stream into MQ in code process.
第一个可能的未来改变是对未应答的包列表进行修改，因此包列表的组织形式不再是当前的线性列表而是通过索引组织成红-黑树。
The first potential future change would modify the unacknowledged packet list so that it is organized with an index as a red-black tree instead of the current linear list.
增强的JFS2在执行索引节点搜索时使用二叉树表示形式，与JFS使用的线性方法相比，这种方法要好得多。
Enhanced JFS2 USES a binary tree representation while performing inode searches, which is a much better method than the linear method used by JFS.
应用推荐