Lines Matching refs:left
60 * (right most key of left page and left most key of right page
934 dtpage_t *lp; /* left child page */
1116 * two children, left parent and right parent (when the parent splits).
1150 * the new entry and the entry on the page to its left.
1163 * subtree and miss x in the left subtree.)
1173 * between last entry of left page and first entry
1214 /* unpin left child page */
1337 int skip, nextindex, half, left, nxt, off, si;
1436 * reverse sorted data, that is, split the tree left,
1499 left = 0;
1537 left += n;
1538 if (left >= half)
1589 * the skipped index was on the left page,
2011 * set the 1st entry offset to 0, which force the left-most key
2014 * The btree comparison code guarantees that the left-most key on any
2632 * lmxaddr give the address of the left most page of the
3109 * Find first entry of left-most leaf
3487 /* get left most parent page */
3594 * force the left-most key on internal pages, at any level of
3673 * force the left-most key on internal pages, at any level of
3787 /* get left and right key */
4051 * function: move entries from split/left page to new/right page
4331 * shift left the succedding entries in the stbl