| Function report | 
| Source Code: lib\math\prime_numbers.c | Create Date:2022-07-28 06:43:32 | 
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick | 
| home page | Tree | 
| Annotation kernel can get tool activity | Download SCCT | Chinese | 
Name:xt_prime_number - return the next prime number*@x: the starting point for searching to test* A prime number is an integer greater than 1 that is only divisible by* itself and 1
Proto:unsigned long next_prime_number(unsigned long x)
Type:unsigned long
Parameter:
| Type | Parameter | Name | 
|---|---|---|
| unsigned long | x | 
| 197 | If Not expand_to_next_prime(x) Then Return slow_next_prime_number(x) | 
| 206 | Return x | 
| Name | Describe | 
|---|---|
| selftest | 
| Source code conversion tool public plug-in interface | X | 
|---|---|
| Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |