Lines Matching refs:moveIndex
974 u_int16_t index, moveIndex;
998 moveIndex = 0;
1002 if ( moveIndex < rightInsertIndex )
1004 moveSize = GetRecordSize (btreePtr, rightNode, moveIndex) + 2;
1006 else if ( moveIndex == rightInsertIndex )
1010 else // ( moveIndex > rightInsertIndex )
1012 moveSize = GetRecordSize (btreePtr, rightNode, moveIndex - 1) + 2;
1017 ++moveIndex;
1024 --moveIndex;
1037 // we've found balance point, moveIndex == number of records moved into leftNode
1042 *recsRotated = moveIndex;
1046 while ( index < moveIndex )
1080 if ( moveIndex <= rightInsertIndex ) // then insert new record in right node