函数逻辑报告 |
Source Code:lib\math\prime_numbers.c |
Create Date:2022-07-27 07:40:58 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：slow_next_prime_number
函数原型：static unsigned long slow_next_prime_number(unsigned long x)
返回类型：unsigned long
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| unsigned long | x |
| 84 | 当x小于ULONG_MAX且非slow_is_prime_number(++x)循环 |
| 87 | 返回:x |
| 名称 | 描述 |
|---|---|
| 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 |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |