715     long    nLo     = nOldLo = 0;  in Search()  local
723     while ( !bFound && nLo <= nHi )  in Search()
725         if ( !bInterpol || nHi - nLo < 3 )  in Search()
726             i = (nLo+nHi) / 2;          // no effort, no division by zero  in Search()
729             long nLoRow = pItems[nLo].nRow;     // no unsigned underflow upon subtraction  in Search()
730             i = nLo + (long)((long)(nRow - nLoRow) * (nHi - nLo)  in Search()
734                 i = (nLo+nHi) / 2;  in Search()
741             nLo = i+1;  in Search()
744                 if ( nLo <= nOldLo )  in Search()
747                     nOldLo = nLo;  in Search()
770         nIndex = static_cast<SCSIZE>(nLo); // rear index  in Search()