Lines Matching refs:child_pos
633 int h, int child_pos)
648 internal_delete_childs(&bi, child_pos, -insert_num);
792 * child_pos is the position of the node-pointer in S[h] that
795 * child_pos
805 int child_pos,
849 balance_internal_when_delete(tb, h, child_pos);
861 if (tb->lnum[h] <= child_pos) {
865 child_pos -= tb->lnum[h];
866 } else if (tb->lnum[h] > child_pos + insert_num) {
877 n + child_pos + 1,
889 internal_shift1_left(tb, h, child_pos + 1);
891 k = tb->lnum[h] - child_pos - 1;
898 n + child_pos + 1, k,
919 child_pos = 0;
930 if (n - tb->rnum[h] >= child_pos)
934 else if (n + insert_num - tb->rnum[h] < child_pos) {
946 child_pos - n - insert_num +
955 internal_shift1_right(tb, h, n - child_pos + 1);
957 k = tb->rnum[h] - n + child_pos - 1;
1061 if (n - snum >= child_pos) {
1070 } else if (n + insert_num - snum < child_pos) {
1091 child_pos - n - insert_num +
1104 n - child_pos + 1, 1);
1106 k = snum - n + child_pos - 1;
1145 if (0 <= child_pos && child_pos <= n && insert_num > 0) {
1152 child_pos, insert_num, insert_key,