Lines Matching refs:rB
179 void BigInt::AddLong( BigInt& rB, BigInt& rErg ) in AddLong() argument
181 if ( bIsNeg == rB.bIsNeg ) in AddLong()
188 if (nLen >= rB.nLen) in AddLong()
191 for (i = rB.nLen; i < len; i++) in AddLong()
192 rB.nNum[i] = 0; in AddLong()
196 len = rB.nLen; in AddLong()
205 nZ = (long)nNum[i] + (long)rB.nNum[i] + k; in AddLong()
221 rErg.bIsNeg = bIsNeg && rB.bIsNeg; in AddLong()
229 rB.SubLong(*this, rErg); in AddLong()
234 rB.bIsNeg = sal_False; in AddLong()
235 SubLong(rB, rErg); in AddLong()
236 rB.bIsNeg = sal_True; in AddLong()
242 void BigInt::SubLong( BigInt& rB, BigInt& rErg ) in SubLong() argument
244 if ( bIsNeg == rB.bIsNeg ) in SubLong()
252 if (nLen >= rB.nLen) in SubLong()
255 for (i = rB.nLen; i < len; i++) in SubLong()
256 rB.nNum[i] = 0; in SubLong()
260 len = rB.nLen; in SubLong()
265 if ( IsLess(rB) ) in SubLong()
269 nZ = (long)nNum[i] - (long)rB.nNum[i] + k; in SubLong()
282 nZ = (long)rB.nNum[i] - (long)nNum[i] + k; in SubLong()
300 AddLong(rB, rErg); in SubLong()
306 rB.bIsNeg = sal_False; in SubLong()
307 AddLong(rB, rErg); in SubLong()
308 rB.bIsNeg = sal_True; in SubLong()
315 void BigInt::MultLong( const BigInt& rB, BigInt& rErg ) const in MultLong() argument
320 rErg.bIsNeg = bIsNeg != rB.bIsNeg; in MultLong()
322 rErg.nLen = nLen + rB.nLen; in MultLong()
327 for (j = 0; j < rB.nLen; j++) in MultLong()
331 nZ = (sal_uInt32)nNum[i] * (sal_uInt32)rB.nNum[j] + in MultLong()
342 void BigInt::DivLong( const BigInt& rB, BigInt& rErg ) const in DivLong() argument
347 short nLenB = rB.nLen; in DivLong()
348 short nLenB1 = rB.nLen - 1; in DivLong()
351 nMult = (sal_uInt16)(0x10000L / ((long)rB.nNum[nLenB1] + 1)); in DivLong()
360 aTmpB.Mult( rB, nMult ); in DivLong()
406 rErg.bIsNeg = bIsNeg != rB.bIsNeg; in DivLong()
408 rErg.nLen = nLen - rB.nLen + 1; in DivLong()
413 void BigInt::ModLong( const BigInt& rB, BigInt& rErg ) const in ModLong() argument
418 short nLenB = rB.nLen; in ModLong()
419 short nLenB1 = rB.nLen - 1; in ModLong()
422 nMult = (sal_uInt16)(0x10000L / ((long)rB.nNum[nLenB1] + 1)); in ModLong()
431 aTmpB.Mult( rB, nMult); in ModLong()
482 sal_Bool BigInt::ABS_IsLess( const BigInt& rB ) const in ABS_IsLess()
484 if (bIsBig || rB.bIsBig) in ABS_IsLess()
488 nB.MakeBigInt( rB ); in ABS_IsLess()
501 if ( rB.nVal < 0 ) in ABS_IsLess()
502 return nVal > rB.nVal; in ABS_IsLess()
504 return nVal > -rB.nVal; in ABS_IsLess()
506 if ( rB.nVal < 0 ) in ABS_IsLess()
507 return nVal < -rB.nVal; in ABS_IsLess()
509 return nVal < rB.nVal; in ABS_IsLess()