Lines Matching defs:nWords

2418     int nWords; // number of words used
2423 nWords = 1;
2432 nWords = (data[1]==0) ? 1 : 2;
2436 data = new int[nWords = other.nWords];
2437 System.arraycopy( other.data, 0, data, 0, nWords );
2442 nWords = n;
2451 nWords = (data[1]==0) ? 1 : 2;
2491 if ( nWords+wordcount+1 > t.length ){
2493 t = new int[ nWords+wordcount+1 ];
2495 int target = nWords+wordcount;
2496 int src = nWords-1;
2499 System.arraycopy( s, 0, t, wordcount, nWords );
2512 nWords += wordcount + 1;
2515 while ( nWords > 1 && data[nWords-1] == 0 )
2516 nWords--;
2536 for ( src= nWords-1 ; src >= 0 && (v=data[src]) == 0 ; src--){
2549 nWords -= wordcount;
2587 r = new int[ ( v * ((long)data[nWords-1]&0xffffffffL) > 0xfffffffL ) ? nWords+1 : nWords ];
2589 for( int i=0; i < nWords; i++ ) {
2595 return new FDBigInt( r, nWords );
2597 r[nWords] = (int)p;
2598 return new FDBigInt( r, nWords+1 );
2616 for( int i=1; i < nWords; i++ ) {
2622 data[nWords] = (int)p; // will fail noisily if illegal!
2623 nWords++;
2634 int r[] = new int[ nWords + other.nWords ];
2638 for( i = 0; i < this.nWords; i++ ){
2642 for( j = 0; j < other.nWords; j++ ){
2665 // arrange such that a.nWords >= b.nWords;
2666 // n = a.nWords, m = b.nWords
2667 if ( this.nWords >= other.nWords ){
2669 n = this.nWords;
2671 m = other.nWords;
2674 n = other.nWords;
2676 m = this.nWords;
2703 int r[] = new int[ this.nWords ];
2705 int n = this.nWords;
2706 int m = other.nWords;
2741 if ( this.nWords > other.nWords ){
2744 int j = other.nWords-1;
2745 for ( i = this.nWords-1; i > j ; i-- )
2747 }else if ( this.nWords < other.nWords ){
2750 int j = this.nWords-1;
2751 for ( i = other.nWords-1; i > j ; i-- )
2754 i = this.nWords-1;
2797 if ( nWords != S.nWords ){
2803 int n = nWords-1;
2852 assert this.nWords > 0 : this.nWords; // longValue confused
2854 if (this.nWords == 1)
2857 assert dataInRangeIsZero(2, this.nWords, this); // value too big
2866 int i = Math.min( nWords-1, data.length-1) ;
2867 if ( nWords > data.length ){
2868 r.append( "("+data.length+"<"+nWords+"!)" );