static int nextPrime(int desiredCapacity) {
        if (desiredCapacity >= largestPrime) {
            return largestPrime;
        }
        int i = Arrays.binarySearch(primeCapacities, desiredCapacity);
        if (i < 0) {
            // desired capacity not found, choose next prime greater
            // than desired capacity
            i = -i - 1; // remember the semantics of binarySearch...
        }
        return primeCapacities[i];
    }
An open addressed Map implementation for long keys and int values.

@author Eric D. Friedman
@author Rob Eden
@author Jeff Randall
core/src/main/java/com/alibaba/fastjson2/internal/trove/map/hash/TLongIntHashMap.java