Lines Matching refs:numRecords
511 ((BTNodeDescriptor*) node.buffer)->numRecords > 0 )
515 //�� if !foundRecord, we could still skip tree search if ( 0 < index < numRecords )
718 ((NodeDescPtr) node.buffer)->numRecords <= 0 )
730 else index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
785 index = ((NodeDescPtr) node.buffer)->numRecords -1;
792 (index == ((NodeDescPtr) node.buffer)->numRecords))
799 if ((foundRecord == false) && (index != ((NodeDescPtr) node.buffer)->numRecords))
803 if (index < ((NodeDescPtr) node.buffer)->numRecords -1)
836 (index >= ((NodeDescPtr) node.buffer)->numRecords))
1026 ((NodeDescPtr)node.buffer)->numRecords <= 0 )
1040 index = ((BTNodeDescriptor*) node.buffer)->numRecords - 1;
1096 index = ((NodeDescPtr) node.buffer)->numRecords -1;
1103 (index == ((NodeDescPtr)node.buffer)->numRecords))
1110 if ((foundRecord == false) && (index != ((NodeDescPtr)node.buffer)->numRecords))
1114 if (index < ((NodeDescPtr)node.buffer)->numRecords -1)
1147 (index >= ((NodeDescPtr)node.buffer)->numRecords))
1167 if ((index+1) < ((NodeDescPtr)node.buffer)->numRecords) {
1717 // check hint for simple delete case (index > 0, numRecords > 2)
1786 info->numRecords = btreePtr->leafRecords;