If we are building an inversion list for searching only, we do not need to store the position of the last bit.
如果我们要构建一个只用于查找的倒排表，我们就不需要存储最后一比特的位置。
2
Inversion lists are best described as a condensed summary of a bit string.
对倒排表的最好描述是：它是对比特串的压缩表示。
3
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.