函数逻辑报告 |
Source Code:lib\interval_tree.c |
Create Date:2022-07-27 07:50:59 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:interval_tree_iter_next
函数原型:struct interval_tree_node *interval_tree_iter_next(struct interval_tree_node *node, unsigned long start, unsigned long last)
返回类型:struct interval_tree_node
参数:
类型 | 参数 | 名称 |
---|---|---|
struct interval_tree_node * | node | |
unsigned long | start | |
unsigned long | last |
12 | 当(true)循环 |
12 | 如果rb则 |
12 | struct interval_tree_node * right = ({ |
12 | }) |
12 | 如果start小于等于__subtree_last则返回:interval_tree_subtree_search(right, start, last) |
12 | 循环 |
12 | 如果last小于 Start of interval 则返回:NULL |
12 | 否则如果start小于等于 Last location _in_ interval 则返回:node |
名称 | 描述 |
---|---|
search | |
mn_itree_inv_next |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |