Home
last modified time | relevance | path

Searched refs:left (Results 1 – 6 of 6) sorted by relevance

/DragonOS-0.1.8/kernel/src/libs/
Dbitree.c43 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
49 node->left = left; in bt_create_node()
79 this_node = this_node->left; in bt_insert()
90 last_node->left = insert_node; in bt_insert()
121 this_node = this_node->left; in bt_query()
141 while (this_node->left != NULL) in bt_get_minimum()
142 this_node = this_node->left; in bt_get_minimum()
165 if (this_node->left == NULL || this_node->right == NULL) in bt_delete()
175 if (to_delete->left != NULL) in bt_delete()
176 to_delete_son = to_delete->left; in bt_delete()
[all …]
Drbtree.rs36 left: NodePtr<K, V>, field
96 left: NodePtr::null(), in new()
151 self.parent().left() == *self in is_left_child()
162 while !temp.left().is_null() { in min_node()
163 temp = temp.left(); in min_node()
197 if !self.left().is_null() { in prev()
198 self.left().max_node() in prev()
222 fn set_left(&mut self, left: NodePtr<K, V>) { in set_left()
226 unsafe { (*self.0).left = left } in set_left()
246 fn left(&self) -> NodePtr<K, V> { in left() method
[all …]
/DragonOS-0.1.8/kernel/src/common/
Dbitree.h6 struct bt_node_t *left; 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.8/kernel/src/time/
Dtimeconv.rs59 fn math_div(left: u32, right: u32) -> u32 { in math_div()
60 return left / right; in math_div()
/DragonOS-0.1.8/kernel/src/ktest/
Dtest-bitree.c76 assert(((struct test_value_t *)tree->bt_node->left->value)->tv == tv2->tv); in ktest_bitree_case1()
/DragonOS-0.1.8/docs/userland/libc/apis/api-list/
Derrno.md121 #define ENOSPC 52 /* 设备上没有空间 No space left on device.*/