Function report |
Source Code:lib\math\prime_numbers.c |
Create Date:2022-07-28 06:43:30 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| home page | Tree |
| Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:slow_next_prime_number
Proto:static unsigned long slow_next_prime_number(unsigned long x)
Type:unsigned long
Parameter:
| Type | Parameter | Name |
|---|---|---|
| unsigned long | x |
| 84 | When x < ULONG_MAX && Not slow_is_prime_number(++x) cycle |
| 87 | Return x |
| Name | Describe |
|---|---|
| next_prime_number | 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 |
| 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 |