函数逻辑报告 |
Source Code:lib\btree.c |
Create Date:2022-07-27 07:50:35 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称:Usually this function is quite similar to normal lookup. But the key of* a parent node may be smaller than the smallest key of all its siblings.* In such a case we cannot just return NULL, as we have only proven that no
函数原型:void *btree_get_prev(struct btree_head *head, struct btree_geo *geo, unsigned long *__key)
返回类型:void
参数:
| 类型 | 参数 | 名称 |
|---|---|---|
| struct btree_head * | head | |
| struct btree_geo * | geo | |
| unsigned long * | __key |
| 321 | 如果height恒等于0则返回:NULL |
| 324 | retry : |
| 331 | 退出 |
| 353 | miss : |
| 354 | 如果retry_key则 |
| 359 | 返回:NULL |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |