Searched refs:right (Results 1 – 5 of 5) sorted by relevance
| /DragonOS-0.1.7/kernel/src/libs/ |
| D | bitree.c | 43 struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t … in bt_create_node() argument
50 node->right = right; in bt_create_node()
81 this_node = this_node->right; in bt_insert()
92 last_node->right = insert_node; in bt_insert()
123 this_node = this_node->right; in bt_query()
165 if (this_node->left == NULL || this_node->right == NULL) in bt_delete()
169 to_delete = bt_get_minimum(this_node->right); in bt_delete()
178 to_delete_son = to_delete->right; in bt_delete()
190 to_delete->parent->right = to_delete_son; in bt_delete()
223 if (nd->right != NULL) in bt_destroy_tree()
[all …]
|
| D | rbtree.rs | 37 right: NodePtr<K, V>, field
97 right: NodePtr::null(), in new()
156 self.parent().right() == *self in is_right_child()
171 while !temp.right().is_null() { in max_node()
172 temp = temp.right(); in max_node()
179 if !self.right().is_null() { in next()
180 self.right().min_node() in next()
230 fn set_right(&mut self, right: NodePtr<K, V>) { in set_right()
234 unsafe { (*self.0).right = right } in set_right()
254 fn right(&self) -> NodePtr<K, V> { in right() method
[all …]
|
| /DragonOS-0.1.7/kernel/src/common/ |
| D | bitree.h | 7 struct bt_node_t *right; member
43 struct bt_node_t *bt_create_node(struct bt_node_t *left, struct bt_node_t *right, struct bt_node_t …
|
| /DragonOS-0.1.7/kernel/src/ktest/ |
| D | test-bitree.c | 77 assert(((struct test_value_t *)tree->bt_node->right->value)->tv == tv3->tv); in ktest_bitree_case1()
97 assert(((struct test_value_t *)node2->right->value)->tv == tv4->tv); in ktest_bitree_case1()
111 assert(tree->bt_node->right == NULL); in ktest_bitree_case1()
|
| /DragonOS-0.1.7/ |
| D | LICENSE | 126 exercise the right to control the distribution of derivative or
216 patents or other property right claims or to contest validity of any
|