/**
* Return some prime greater than @x. The function does not checks overflows, but it should
* be safe at least for @x lower than `1U << 31`.
* If the Cramer's conjecture is true, it should have complexity `O(sqrt(x) * log(x)^2)`.
**/
/**
* Return some prime greater than @x. The function does not checks overflows, but it should
* be safe at least for @x lower than `1U << 31`.
* If the Cramer's conjecture is true, it should have complexity `O(sqrt(x) * log(x)^2)`.
**/