Lines Matching +defs:left +defs:right
205 left - description
207 right - description
219 BlockDescriptor *left,
221 BlockDescriptor *right,
233 // assume left, middle, right point to BlockDescriptors
238 left->buffer = nil;
240 right->buffer = nil;
297 err = GetLeftSiblingNode (btreePtr, middle->buffer, left);
300 if ( ((NodeDescPtr) left->buffer)->kind != kBTLeafNode ||
301 ((NodeDescPtr) left->buffer)->numRecords <= 0 )
306 foundIt = SearchNode (btreePtr, left->buffer, &iterator->key, &leftIndex);
309 *right = *middle;
310 *middle = *left;
311 left->buffer = nil;
321 else if (leftIndex >= ((NodeDescPtr) left->buffer)->numRecords)
323 nodeNum = ((NodeDescPtr) left->buffer)->fLink;
330 *right = *middle;
331 *middle = *left;
332 left->buffer = nil;
347 err = GetRightSiblingNode (btreePtr, middle->buffer, right);
350 if ( ((NodeDescPtr) right->buffer)->kind != kBTLeafNode ||
351 ((NodeDescPtr) right->buffer)->numRecords <= 0 )
356 foundIt = SearchNode (btreePtr, right->buffer, &iterator->key, &rightIndex);
357 if (rightIndex >= ((NodeDescPtr) right->buffer)->numRecords) // we're lost
363 *left = *middle;
364 *middle = *right;
365 right->buffer = nil;
379 err = ReleaseNode (btreePtr, left); M_ExitOnError (err);
381 err = ReleaseNode (btreePtr, right); M_ExitOnError (err);
407 (void) ReleaseNode (btreePtr, left);
409 (void) ReleaseNode (btreePtr, right);