Lines Matching defs:separator
676 * Since we have the new separator, binary search for where to put
704 * will be used as the new separator in our parent, and the others
734 /* Store the new separator in a buffer. */
746 * Move the new separator to the existing buffer.
756 * Move the new separator to the existing buffer.
761 * Move the new separator into the right half, and replace it
864 /* We store the new separator in a buffer we control for simplicity. */
880 * Insert planned separator into the new leaf, and use
881 * the new value as the new separator.
981 /* Next, move the separator from the common ancestor to leaf. */
982 uint8_t *separator = common->btc_elems + common_idx * size;
985 bcpy(separator, out, size);
996 * the separator.
999 l_hdr->bth_count - move_count) * size, separator, size);
1048 /* Next, move the separator to the right node. */
1049 uint8_t *separator = parent->btc_elems + ((parent_idx - 1) *
1052 bcpy(separator, e_out, size);
1065 * separator's position.
1068 bcpy(l_neighbor->btc_elems + move_idx * size, separator, size);
1142 * separator into the first slot in the subtree to the right.
1250 * separator after our ancestor in its parent.
1298 * the subtree just to the right of the separator.
1337 * separator after our previous ancestor.
1371 * the subtree just to the left of the separator.
1423 * Remove the rm_hdr and the separator to its left from the parent node. The
1458 * children, just remove the child and separator, and return.
1478 * of elements, we move the separator between us and them to our
1480 * to the separator, and move their closest child to our node. Along
1506 * Move the separator between node and neighbor to the first
1509 uint8_t *separator = parent->btc_elems + (parent_idx - 1) *
1511 bcpy(separator, node->btc_elems, size);
1518 /* Move the last element of neighbor to the separator spot. */
1521 bcpy(take_elem, separator, size);
1536 * and the separator before it.
1542 * Move the separator between node and neighbor to the last
1545 uint8_t *separator = parent->btc_elems + parent_idx * size;
1546 bcpy(separator, node->btc_elems + (hdr->bth_count - 1) * size,
1556 /* Move the first element of neighbor to the separator spot. */
1558 bcpy(take_elem, separator, size);
1574 * arbitrarily. Move the separator into the leftmost merging node
1578 * the right merging node and the separator. This may cause further
1607 /* Move the separator into the left node. */
1609 uint8_t *separator = parent->btc_elems + (parent_idx - 1) *
1611 bcpy(separator, e_out, size);
1729 * elements, we move the separator between us and them to our node
1731 * the separator. Along the way we need to collapse the gap made by
1755 /* Move the separator to our first spot. */
1756 uint8_t *separator = parent->btc_elems + (parent_idx - 1) *
1758 bcpy(separator, leaf->btl_elems + hdr->bth_first * size, size);
1760 /* Move our neighbor's last element to the separator. */
1763 bcpy(take_elem, separator, size);
1786 /* Move the separator between us to our last spot. */
1787 uint8_t *separator = parent->btc_elems + parent_idx * size;
1788 bcpy(separator, leaf->btl_elems + (hdr->bth_first +
1791 /* Move our neighbor's first element to the separator. */
1794 bcpy(take_elem, separator, size);
1805 * After remove we move the separator into the leftmost merging node
1809 * the right merging node and the separator. This may cause further
1847 /* Move the separator into the first open spot. */
1849 uint8_t *separator = parent->btc_elems + (parent_idx - 1) * size;
1850 bcpy(separator, out, size);