@tsdotnet/array-procedure/dist/esm/arrayProcedure.js

[](https://github.com/tsdotnet/array-procedure/blob/master/LICENSE)  [![npm ve

/*!
 * @author electricessence / https://github.com/electricessence/
 * Licensing: MIT
 */
function sum(source, ignoreNaN = false) {
    if (!source || !source.length)
        return 0;
    let result = 0;
    if (ignoreNaN) {
        for (const n of source) {
            if (!isNaN(n))
                result += n;
        }
    }
    else {
        for (const n of source) {
            if (isNaN(n))
                return NaN;
            result += n;
        }
    }
    return result;
}
function average(source, ignoreNaN = false) {
    if (!source || !source.length)
        return NaN;
    let result = 0, count;
    if (ignoreNaN) {
        count = 0;
        for (const n of source) {
            if (!isNaN(n)) {
                result += n;
                count++;
            }
        }
    }
    else {
        count = source.length;
        for (const n of source) {
            if (isNaN(n))
                return NaN;
            result += n;
        }
    }
    return !count || isNaN(result) ? NaN : result / count;
}
function product(source, ignoreNaN = false) {
    if (!source || !source.length)
        return NaN;
    let result = 1;
    if (ignoreNaN) {
        let found = false;
        for (const n of source) {
            if (!isNaN(n)) {
                result *= n;
                found = true;
            }
        }
        if (!found)
            return NaN;
    }
    else {
        for (const n of source) {
            if (isNaN(n))
                return NaN;
            result *= n;
        }
    }
    return result;
}
function quotient(source, ignoreNaN = false) {
    const len = source ? source.length : 0;
    if (len < 2)
        return NaN;
    let result = source[0];
    if (result === undefined || isNaN(result))
        return NaN;
    let found = false;
    for (let i = 1; i < len; i++) {
        const n = source[i];
        if (n === undefined)
            return NaN;
        if (n === 0) {
            return NaN;
        }
        if (isNaN(n)) {
            if (!ignoreNaN) {
                return NaN;
            }
        }
        else {
            result /= n;
            if (!found)
                found = true;
        }
    }
    return found ? result : NaN;
}
function ifSet(source, start, ignoreNaN, predicate) {
    if (!source || !source.length)
        return NaN;
    let result = start;
    if (ignoreNaN) {
        let found = false;
        for (const n of source) {
            if (!isNaN(n)) {
                if (predicate(n, result))
                    result = n;
                if (!found)
                    found = true;
            }
        }
        if (!found)
            return NaN;
    }
    else {
        for (const n of source) {
            if (isNaN(n))
                return NaN;
            if (predicate(n, result))
                result = n;
        }
    }
    return result;
}
function min(source, ignoreNaN = false) {
    return ifSet(source, +Infinity, ignoreNaN, (n, result) => n < result);
}
function max(source, ignoreNaN = false) {
    return ifSet(source, -Infinity, ignoreNaN, (n, result) => n > result);
}

export { average, max, min, product, quotient, sum };
//# sourceMappingURL=arrayProcedure.js.map