testtreet树型结构测试例子

testtreet树型结构测试例子

wangxl@20200924

 

为了方便理解Mosquitto订阅树，本人用bcb工具编写了testtreet， 树型结构测试例子

，为了直观理解，画了个草图。

测试例子链接：https://download.csdn.net/download/flyme2010/12882760

 

以下为测试数据：

00c67d90

cur_subhier_node->children = NULL;

cur_subhier_node->topic_key =$SYS

cur_subhier_node->prev = NULL

cur_subhier_node->next=NULL

cur_subhier_node->parent=&int_db.subs=00404510;

 

00c67f9c

cur_subhier_node->children = NULL;

cur_subhier_node->topic_key =aaa

cur_subhier_node->prev = NULL

cur_subhier_node->next=NULL

parent->children = cur_subhier_node=00c67f9c;

cur_subhier_node->parent=00c67d90

 

00c66666c

cur_subhier_node->children = NULL;

cur_subhier_node->topic_key =bbb

cur_subhier_node->prev = NULL

parent->children->prev = 00c66666c

cur_subhier_node->next = parent->children=00c67f9c;

parent->children = cur_subhier_node=00c66666c;

cur_subhier_node->parent=00c67d90

 

00c666b8

cur_subhier_node->children = NULL;

cur_subhier_node->topic_key =bbb01

cur_subhier_node->prev = NULL

parent->children->prev = 00c66666c

cur_subhier_node->next = NULL;

parent->children = cur_subhier_node=00c666b8;

cur_subhier_node->parent=00c66666c

 

00c66710

cur_subhier_node->children = NULL;

cur_subhier_node->topic_key =$SYS2

cur_subhier_node->prev = NULL

int_db.subs.children->prev = cur_subhier_node=00c66710;

cur_subhier_node->next = int_db.subs.children=00c67d90;

int_db.subs.children = cur_subhier_node=00c66710;

cur_subhier_node->parent = &int_db.subs=00404510;

00c66768

cur_subhier_node->children = NULL;

cur_subhier_node->topic_key =ccc

cur_subhier_node->prev = NULL

cur_subhier_node->next=NULL

parent->children = cur_subhier_node=00c66768

cur_subhier_node->parent=00c66710

 

树型图

g_subhier_dic=00c67d90

int_db.subs.children=00c66710