Lines Matching defs:left
430 treePathTable [level + 1].index = 1; // 1 since we always split/rotate left
502 primaryKey->skipRotate = insertParent; // don't rotate left if we have two inserts occuring
537 err = UpdateNode (btreePtr, &leftNode, 0, kLockTransaction); // all done with left sibling
587 /* sanity check our left and right nodes here. */
650 // might not have left node...
1048 if ( index == rightInsertIndex ) // insert new record in left node
1058 Panic ("RotateLeft: InsertKeyRecord (left) returned false!");
1130 NodeDescPtr left, right;
1138 left = leftNode->buffer;
1140 PanicIf ( right->bLink != 0 && left == 0, " SplitLeft: left sibling missing!?" );
1147 if ( left != nil )
1149 if ( left->fLink != rightNodeNum )
1152 if ( left->height != right->height )
1155 if ( left->kind != right->kind )
1168 if ( left != nil )
1173 left->fLink = newNodeNum;
1187 left = leftNode->buffer;
1188 left->fLink = rightNodeNum;
1193 left->bLink = right->bLink;
1194 left->kind = right->kind;
1195 left->height = right->height;
1199 if ( (left->kind == kBTLeafNode) && (left->bLink == 0) )
1209 err = RotateLeft (btreePtr, left, right, index, keyPtr, recPtr, recSize,
1299 PanicIf ( !didItFit, "AddNewRootNode:InsertKeyRecord failed for left index record");