Lines Matching refs:nLen
57 while ( nLen > 1 && nNum[nLen-1] == 0 ) in MakeBigInt()
58 nLen--; in MakeBigInt()
82 nLen = 2; in MakeBigInt()
84 nLen = 1; in MakeBigInt()
94 while ( nLen > 1 && nNum[nLen-1] == 0 ) in Normalize()
95 nLen--; in Normalize()
97 if ( nLen < 3 ) in Normalize()
99 if ( nLen < 2 ) in Normalize()
115 nLen = 2; in Normalize()
117 nLen = 1; in Normalize()
125 for ( int i = 0; i < rVal.nLen; i++ ) in Mult()
134 nNum[rVal.nLen] = nK; in Mult()
135 nLen = rVal.nLen + 1; in Mult()
138 nLen = rVal.nLen; in Mult()
149 for ( int i = nLen - 1; i >= 0; i-- ) in Div()
157 if ( nNum[nLen-1] == 0 ) in Div()
158 nLen -= 1; in Div()
165 if ( rVal.nLen < nLen) in IsLess()
167 if ( rVal.nLen > nLen ) in IsLess()
171 for ( i = nLen - 1; i > 0 && nNum[i] == rVal.nNum[i]; i-- ) in IsLess()
188 if (nLen >= rB.nLen) in AddLong()
190 len = nLen; in AddLong()
191 for (i = rB.nLen; i < len; i++) in AddLong()
196 len = rB.nLen; in AddLong()
197 for (i = nLen; i < len; i++) in AddLong()
220 rErg.nLen = len; in AddLong()
252 if (nLen >= rB.nLen) in SubLong()
254 len = nLen; in SubLong()
255 for (i = rB.nLen; i < len; i++) in SubLong()
260 len = rB.nLen; in SubLong()
261 for (i = nLen; i < len; i++) in SubLong()
292 rErg.nLen = len; in SubLong()
322 rErg.nLen = nLen + rB.nLen; in MultLong()
324 for (i = 0; i < rErg.nLen; i++) in MultLong()
327 for (j = 0; j < rB.nLen; j++) in MultLong()
329 for (i = 0, k = 0; i < nLen; i++) in MultLong()
347 short nLenB = rB.nLen; in DivLong()
348 short nLenB1 = rB.nLen - 1; in DivLong()
354 if ( aTmpA.nLen == nLen ) in DivLong()
356 aTmpA.nNum[aTmpA.nLen] = 0; in DivLong()
357 aTmpA.nLen++; in DivLong()
362 for (j = aTmpA.nLen - 1; j >= nLenB; j--) in DivLong()
408 rErg.nLen = nLen - rB.nLen + 1; in DivLong()
418 short nLenB = rB.nLen; in ModLong()
419 short nLenB1 = rB.nLen - 1; in ModLong()
425 if ( aTmpA.nLen == nLen ) in ModLong()
427 aTmpA.nNum[aTmpA.nLen] = 0; in ModLong()
428 aTmpA.nLen++; in ModLong()
433 for (j = aTmpA.nLen - 1; j >= nLenB; j--) in ModLong()
489 if (nA.nLen == nB.nLen) in ABS_IsLess()
492 for (i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i--) in ABS_IsLess()
498 return nA.nLen < nB.nLen; in ABS_IsLess()
619 nLen = i; in BigInt()
637 nLen = 2; in BigInt()
652 else if ( nLen == 2 ) in operator sal_uIntPtr()
670 int i = nLen-1;
1056 if ( nA.nLen == nB.nLen ) in operator ==()
1059 for ( i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i-- ) in operator ==()
1083 if ( nA.nLen == nB.nLen ) in operator <()
1086 for ( i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i-- ) in operator <()
1096 return nA.nLen > nB.nLen; in operator <()
1098 return nA.nLen < nB.nLen; in operator <()
1116 if ( nA.nLen == nB.nLen ) in operator >()
1119 for ( i = nA.nLen - 1; i > 0 && nA.nNum[i] == nB.nNum[i]; i-- ) in operator >()
1129 return nA.nLen < nB.nLen; in operator >()
1131 return nA.nLen > nB.nLen; in operator >()