Fixed a bug in HASHED | MULTIPLE properties.  The ordinals are represented as their value + 1 encoded as a variant of variable-length integers.  These ordinals are hashed into a byte sequence.  For sets with the single value equal to 127, this was resulting in a prediction of 2 bytes for the size of the encoded set.

This left no holes when the actual represented value (128 = 127 + 1) took up two bytes.

This resulted in the linear probing algorithm spinning forever because it never encountered a hole (0 byte) for this edge case.