Function report |
Source Code:lib\math\prime_numbers.c |
Create Date:2022-07-28 06:43:29 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| home page | Tree |
| Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:slow_is_prime_number
Proto:static bool slow_is_prime_number(unsigned long x)
Type:bool
Parameter:
| Type | Parameter | Name |
|---|---|---|
| unsigned long | x |
| 71 | y = _sqrt - computes the integer square root*@x: integer of which to calculate the sqrt* Computes: floor(sqrt(x)) |
| 79 | Return y == 1 |
| Name | Describe |
|---|---|
| slow_next_prime_number | |
| is_prime_number | s_prime_number - test whether the given number is prime*@x: the number to test* A prime number is an integer greater than 1 that is only divisible by* itself and 1 |
| 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 |