public final static int nextPrime(int n) {
        for(int i=0;i<PRIMES.length;i++) {
            if (PRIMES[i] > n) {
                return PRIMES[i];
            }
        }
        return 0;
    }
Finds the next prime number greater than or equal to n.
@param n the number from which to find the next higher prime number.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/Prime.java