Inversion lists are best described as a condensed summary of a bit string.
2
假设您要对一个比特串“1110011”进行编码。
Suppose you want to encode the bit string "1110011."
3
我们存储的是,开始出现1的位置,开始出现0的位置,然后再是出现1的位置,如此重复直到比特串结束。
All we store is the start position of the 1s, then the start position of the 0s, then the position of 1s again, and so on until the bit string is over.