Consistent hashing is a scheme that provides hash table
functionality in a way that the addition or removal of one slot does
not significantly change the mapping of keys to slots. In contrast,
in most traditional hash tables, a change in the number of array
slots causes nearly all keys to be remapped.
Consistent hashing was introduced in 1997 as a way of distributing
requests among a changing population of web servers. More recently,
it and similar techniques have been employed in distributed hash
tables.

Given a $point, an integer in the range [0,2**32), returns (somewhat slowly), the next target found, clockwise from that point on the circle.

This is mostly an internal method, used to generated the 1024-element cached bucket arrayref when needed. You probably don't want to use this. Instead, use the buckets method, and run your hash function on your key, generating an integer, modulous 1024, and looking up that bucket index's target.