函数逻辑报告 |
Source Code:lib\btree.c |
Create Date:2022-07-27 07:50:30 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| 首页 | 函数Tree |
| 注解内核,赢得工具 | 下载SCCT | English |
函数名称：bval
函数原型：static void *bval(struct btree_geo *geo, unsigned long *node, int n)
返回类型：void
参数：
| 类型 | 参数 | 名称 |
|---|---|---|
| struct btree_geo * | geo | |
| unsigned long * | node | |
| int | n |
| 名称 | 描述 |
|---|---|
| btree_last | 取btree的最后一项 |
| btree_lookup | 查btree的键 |
| btree_update | |
| btree_get_prev | 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 |
| getfill | |
| find_level | locate the correct leaf node in the btree |
| btree_shrink | |
| btree_insert_level | |
| merge | |
| rebalance | |
| btree_remove_level | |
| __btree_for_each |
| 源代码转换工具 开放的插件接口 | X |
|---|---|
| 支持：c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现：逻辑报告 代码生成和批量转换代码 |