aureooms/js-polynomial

/**
 * little endian
 * hypothesis : rj - ri >= pj - pi >= qj - pi
 * @param {function} nadd number type addition function
 * @param {function} copy number type copy function
 */
export function __ladd__ ( nadd , copy ) {

    const ladd = function ( p , pi , pj , q , qi , qj , r , ri , rj ) {

        for ( ; qi < qj ; ++qi , ++pi , ++ri ) {

            r[ri] = nadd( p[pi] , q[qi] ) ;

        }

        for ( ; pi < pj ; ++pi , ++ri ) {

            r[ri] = copy( p[pi] ) ;

        }

    } ;

    return ladd ;

} ;