On Tuesday, February 17, 2015 at 5:43:43 PM UTC+1, Paul Rubin wrote: > This is a reasonable place to ask specific python questions. The > algorithm description itself is pretty confusing though, and it seems to > address a problem that doesn't particularly seem to need a solution. > It's pretty typical for applications needing compact representations to > encode smallish variable-length integers in the VInt format, basically > using 7 bits from each byte for data, and the 8th bit as a terminator > flag. So VInt encodes numbers 0-127 in one byte, 128 to 16383 in 2 > bytes, etc. Bignum applications generally use a length cell and a data > array.
Thanks Paul, The algorithm sort of combines the Vint and Bignum approaches. I'm sorry to read that my description is confusing; is the illustration with 2 bit characters helpful or should it be extended? -- https://mail.python.org/mailman/listinfo/python-list
