void function ( LongPolynomial2 arg0 ) { if ( arg0 . coeffs . length > coeffs . length ) { coeffs = Arrays . copyOf ( coeffs , arg0 . coeffs . length ) ; } for ( int loc0 = 0 ; loc0 < arg0 . coeffs . length ; loc0 ++ ) { coeffs [ loc0 ] = ( coeffs [ loc0 ] + arg0 . coeffs [ loc0 ] ) & 0x7FF0007FFL ; } }
adds another polynomial which can have a different number of coefficients . concode_field_sep long[] coeffs concode_elem_sep int numCoeffs concode_field_sep void sub concode_elem_sep LongPolynomial2 mult concode_elem_sep boolean equals concode_elem_sep Object clone concode_elem_sep LongPolynomial2 multRecursive concode_elem_sep void mult2And concode_elem_sep void subAnd concode_elem_sep IntegerPolynomial toIntegerPolynomial