Searched refs:tree (Results 1 – 3 of 3) sorted by relevance
48 struct bt_root_t *tree = bt_create_tree(rn, compare, release); in ktest_bitree_case1() local49 assert(tree != NULL); in ktest_bitree_case1()50 assert(tree->bt_node == rn); in ktest_bitree_case1()51 assert(tree->cmp == compare); in ktest_bitree_case1()52 assert(tree->release == release); in ktest_bitree_case1()53 assert(tree->size == 1); in ktest_bitree_case1()60 int last_size = tree->size; in ktest_bitree_case1()61 val = bt_insert(tree, tv2); in ktest_bitree_case1()63 assert(last_size + 1 == tree->size); in ktest_bitree_case1()69 int last_size = tree->size; in ktest_bitree_case1()[all …]
17 - [Multiboot2 Specification](http://git.savannah.gnu.org/cgit/grub.git/tree/doc/multiboot.texi?h=mu…
402    idr是一个基于radix-tree的ID-pointer的数据结构. 该数据结构提供了建id与数据指针绑定的功能, 它的主要功能有以下4个：408    至于什么是radix-tree，您可以把他简单理解为一个向上生长的多叉树，在实现中，我们选取了64叉树。