[RFC 1982], with SERIAL_BITS = 32. Unlike the original algorithm, this implementation is based on unsigned subtraction, resolving the issue of undefined comparisons, however introducing one additional oddity - each member of a pair of serial numbers with a wrapped distance of 2^(SERIAL_BITS - 1) will be considered less than (and greater than) the other one.
@author Andreas Ergenzinger
| |
| |
| |