docs: public static int fastModPrime(long data) {
      // Mix high and low 32 bit:
      int high = (int) (data >>> 32);
      // Use fast multiplication with 5 for high:
      int alpha = ((int) data) + (high << 2 + high);
      // Note that in Java, PRIME will be negative.
      if(alpha < 0 && alpha > -5) {
        alpha = alpha + 5;
      }
      return alpha;
    }