Lines Matching refs:right
304 right - description
318 BlockDescriptor *right,
330 // assume left, middle, right point to BlockDescriptors
339 right->buffer = nil;
340 right->blockHeader = nil;
388 // BTree nodes are always grabbed in left to right order.
411 *right = *middle;
432 *right = *middle;
449 err = GetRightSiblingNode (btreePtr, middle->buffer, right);
452 if ( ((NodeDescPtr) right->buffer)->kind != kBTLeafNode ||
453 ((NodeDescPtr) right->buffer)->numRecords <= 0 )
458 foundIt = SearchNode (btreePtr, right->buffer, &iterator->key, &rightIndex);
459 if (rightIndex >= ((NodeDescPtr) right->buffer)->numRecords) // we're lost
466 *middle = *right;
467 right->buffer = nil;
483 err = ReleaseNode (btreePtr, right); M_ExitOnError (err);
511 (void) ReleaseNode (btreePtr, right);