If we are building an inversion list for searching only, we do not need to store the position of the last bit.
如果我们要构建一个只用于查找的倒排表，我们就不需要存储最后一比特的位置。
Inversion lists are best described as a condensed summary of a bit string.
对倒排表的最好描述是：它是对比特串的压缩表示。
There are much better compression algorithms; this is just a demonstration of how inversion lists can be applied to wider channels than a single bit string.
还可以有更好的压缩算法；这不过是为了证明倒排表可以用于比单个比特更宽的通道。
This rule can be inverted to store a 0 if the run begins with a 0 bit, but the effect is the same as long as both the encoder and the decoder of the inversion list agree on this detail.
如果开始出现的是0 ，那么这个规则需要改变，但效果是一样的，因为编码器和解码器都遵循这一规则。
这是一个小倒置。
这是一个小倒置。
应用推荐