- an array of most significant bits of the Guids to be stored, sorted in ascending order.
- an array of the least significant bits of the Guids to be stored.
- an array of the least significant bits of the Guids to be stored. The bits in this array must be in sync with the bits in the highBits array.
(Changed in version 2.8.0) Set.map now returns a Set, so it will discard duplicate values.
(Changed in version 2.9.0) The behavior of scanRight has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose throws an IllegalArgumentException if collections are not uniformly sized.
A Set implementation for Guids, which stores the data in a memory efficient way that is optimized for fast look-ups