- <init>
- findClosestLocation
Finds the position of the closest location in the sorted list of locations. This
is a binary search
- getClosestPeerLocation
Finds the closest non-excluded peer in O(log n + m) time, where n is the number
of peers and m the n
- updateLocation
- findFirstGreater
Finds the position of the first element in the sorted list greater than the
given element, or -1 if
- getDegree
- getLocationSetTime
- getPeersLocationArray
Returns an array copy of locations of our peer's peers, or null if we don't have
them.
- isValidLocation
- setLocation
- setPeerLocations
Should only be called in the constructor