@cj-tech-master/excelts 9.2.1 → 9.3.0

package/dist/cjs/modules/formula/functions/conditional.js

@@ -0,0 +1,354 @@
+"use strict";
+/**
+ * Conditional Aggregate Functions — Native RuntimeValue Implementation
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildCriteriaPredicateRV = buildCriteriaPredicateRV;
+exports.fnSUMIF = fnSUMIF;
+exports.fnSUMIFS = fnSUMIFS;
+exports.fnCOUNTIF = fnCOUNTIF;
+exports.fnCOUNTIFS = fnCOUNTIFS;
+exports.fnAVERAGEIF = fnAVERAGEIF;
+exports.fnAVERAGEIFS = fnAVERAGEIFS;
+exports.fnMAXIFS = fnMAXIFS;
+exports.fnMINIFS = fnMINIFS;
+const values_1 = require("../runtime/values");
+const _shared_1 = require("./_shared");
+// ============================================================================
+// Criteria Predicate Builder (RuntimeValue version)
+// ============================================================================
+/**
+ * Build a criteria predicate from a ScalarValue.
+ * Matches Excel SUMIF/COUNTIF criteria semantics:
+ * - number → exact numeric match
+ * - boolean → exact boolean match
+ * - string with operator prefix (">5", "<=10", "<>abc") → comparison
+ * - string with wildcards (* ?) → pattern match
+ * - plain string → case-insensitive exact match (or numeric if parseable)
+ */
+function buildCriteriaPredicateRV(criteria) {
+    if (criteria.kind === 1 /* RVKind.Number */) {
+        const n = criteria.value;
+        return v => v.kind === 1 /* RVKind.Number */ && v.value === n;
+    }
+    if (criteria.kind === 3 /* RVKind.Boolean */) {
+        const b = criteria.value;
+        return v => v.kind === 3 /* RVKind.Boolean */ && v.value === b;
+    }
+    if (criteria.kind === 4 /* RVKind.Error */) {
+        return () => false;
+    }
+    // Blank criteria: match blank/empty-string
+    if (criteria.kind === 0 /* RVKind.Blank */) {
+        return v => v.kind === 0 /* RVKind.Blank */ || (v.kind === 2 /* RVKind.String */ && v.value === "");
+    }
+    // String criteria
+    const s = criteria.kind === 2 /* RVKind.String */ ? criteria.value : "";
+    // Operator-prefixed criteria. Order the regex alternatives longest-first
+    // so that `<>abc` matches the `<>` branch (not `<` with `>abc` as the
+    // value). Without the explicit ordering, `/^[<>]=?/` would greedily
+    // consume just `<` and silently mis-route every not-equal criterion to
+    // the `<` branch.
+    const opMatch = /^(<>|<=|>=|<|>|=)(.*)$/.exec(s);
+    if (opMatch) {
+        const [, op, valStr] = opMatch;
+        const numVal = Number(valStr);
+        const isNum = !isNaN(numVal) && valStr.trim() !== "";
+        // For numeric comparisons Excel coerces booleans (TRUE→1, FALSE→0) and
+        // blank (→0); numeric strings are NOT coerced (COUNTIF stays textual
+        // for those). Only real Number / Boolean / Blank cells participate in
+        // numeric comparisons; everything else falls back to string compare.
+        const numericOf = (v) => {
+            if (v.kind === 1 /* RVKind.Number */) {
+                return v.value;
+            }
+            if (v.kind === 3 /* RVKind.Boolean */) {
+                return v.value ? 1 : 0;
+            }
+            if (v.kind === 0 /* RVKind.Blank */) {
+                return 0;
+            }
+            return Number.NaN;
+        };
+        return (v) => {
+            const vn = numericOf(v);
+            const vs = (0, values_1.toStringRV)(v).toLowerCase();
+            const cs = valStr.toLowerCase();
+            switch (op) {
+                case "=":
+                    return isNum ? vn === numVal : vs === cs;
+                case "<>":
+                    return isNum ? vn !== numVal : vs !== cs;
+                case ">":
+                    return isNum ? vn > numVal : vs > cs;
+                case "<":
+                    return isNum ? vn < numVal : vs < cs;
+                case ">=":
+                    return isNum ? vn >= numVal : vs >= cs;
+                case "<=":
+                    return isNum ? vn <= numVal : vs <= cs;
+                default:
+                    return false;
+            }
+        };
+    }
+    // Wildcard match (case-insensitive). Excel treats `~*`, `~?`, `~~` as
+    // literal `*`, `?`, `~` and everything else as a regex special character
+    // that must be escaped. Only an unescaped `*` or `?` triggers the wildcard
+    // path; a pattern like `~*` matches a literal asterisk.
+    if ((0, _shared_1.hasUnescapedWildcard)(s)) {
+        try {
+            const re = new RegExp("^" + (0, _shared_1.excelWildcardToRegex)(s) + "$", "i");
+            return v => re.test((0, values_1.toStringRV)(v));
+        }
+        catch {
+            const literal = (0, _shared_1.unescapeExcelWildcard)(s).toLowerCase();
+            return v => (0, values_1.toStringRV)(v).toLowerCase() === literal;
+        }
+    }
+    // No wildcards: strip any `~` escapes and do a literal case-insensitive compare.
+    const literal = (0, _shared_1.unescapeExcelWildcard)(s);
+    // Exact match (case-insensitive for strings, numeric for numbers)
+    const numCriteria = Number(literal);
+    if (!isNaN(numCriteria) && literal.trim() !== "") {
+        return v => v.kind === 1 /* RVKind.Number */ && v.value === numCriteria;
+    }
+    const literalLc = literal.toLowerCase();
+    return v => (0, values_1.toStringRV)(v).toLowerCase() === literalLc;
+}
+/**
+ * Scan a criteria string for an unescaped `*` or `?`. A backslash-style
+ * escape in Excel is `~`; so `~*` and `~?` are literals, while `*` and `?`
+ * on their own or at a position not preceded by `~` count as wildcards.
+ */
+// ── Wildcard helpers live in `_shared.ts` and are re-used by SEARCH / MATCH /
+//    XLOOKUP / SUMIF / COUNTIF so every function agrees on the same escape
+//    semantics (`~*`, `~?`, `~~`). See `excelWildcardToRegex`,
+//    `hasUnescapedWildcard`, and `unescapeExcelWildcard`.
+// ============================================================================
+// Functions
+// ============================================================================
+function fnSUMIF(args) {
+    const rangeArr = (0, _shared_1.asArray)(args[0]);
+    if (!rangeArr) {
+        return values_1.ERRORS.VALUE;
+    }
+    const criteriaScalar = (0, values_1.topLeft)(args[1]);
+    if ((0, values_1.isError)(criteriaScalar)) {
+        return criteriaScalar;
+    }
+    const pred = buildCriteriaPredicateRV(criteriaScalar);
+    const sumArr = args.length > 2 ? ((0, _shared_1.asArray)(args[2]) ?? rangeArr) : rangeArr;
+    let sum = 0;
+    for (let r = 0; r < rangeArr.height; r++) {
+        for (let c = 0; c < rangeArr.width; c++) {
+            if (pred((0, _shared_1.getCell)(rangeArr, r, c))) {
+                const sv = (0, _shared_1.getCell)(sumArr, r, c);
+                if (sv.kind === 1 /* RVKind.Number */) {
+                    sum += sv.value;
+                }
+            }
+        }
+    }
+    return (0, values_1.rvNumber)(sum);
+}
+/**
+ * Scan successive `(range, criteria)` argument pairs starting at
+ * `startIdx`. Returns a list of `{ arr, pred }` ready for iteration, or
+ * an `{ error }` sentinel when a range argument is missing, a criteria
+ * value is itself an error, or a criteria range's shape does not match
+ * `target`'s shape (Excel's SUMIFS/COUNTIFS require identical shapes —
+ * silently zero-extending with `BLANK` produced wrong counts).
+ *
+ * Used by SUMIFS/COUNTIFS/AVERAGEIFS/MAXIFS/MINIFS which share the
+ * "target array + N criteria pairs" shape.
+ */
+function collectCriteriaPairs(args, startIdx, target) {
+    const pairs = [];
+    for (let i = startIdx; i < args.length - 1; i += 2) {
+        const critRange = (0, _shared_1.asArray)(args[i]);
+        if (!critRange) {
+            return { error: values_1.ERRORS.VALUE };
+        }
+        if (critRange.height !== target.height || critRange.width !== target.width) {
+            return { error: values_1.ERRORS.VALUE };
+        }
+        const cs = (0, values_1.topLeft)(args[i + 1]);
+        if ((0, values_1.isError)(cs)) {
+            return { error: cs };
+        }
+        pairs.push({ arr: critRange, pred: buildCriteriaPredicateRV(cs) });
+    }
+    return { pairs };
+}
+/**
+ * Walk every (row, col) position in `target` and invoke `onMatch(r, c)`
+ * whenever all criteria predicates evaluate true at that position. The
+ * criteria arrays are expected to share `target`'s shape — Excel returns
+ * `#VALUE!` at the call site if they don't, which callers can detect by
+ * checking `target.height` / `target.width` before invoking this helper.
+ */
+function iterateMultiCriteria(target, pairs, onMatch) {
+    const rows = target.height;
+    const cols = target.width;
+    for (let r = 0; r < rows; r++) {
+        for (let c = 0; c < cols; c++) {
+            let allMatch = true;
+            for (const p of pairs) {
+                if (!p.pred((0, _shared_1.getCell)(p.arr, r, c))) {
+                    allMatch = false;
+                    break;
+                }
+            }
+            if (allMatch) {
+                onMatch(r, c);
+            }
+        }
+    }
+}
+function fnSUMIFS(args) {
+    const sumArr = (0, _shared_1.asArray)(args[0]);
+    if (!sumArr || args.length < 3) {
+        return values_1.ERRORS.VALUE;
+    }
+    const pairs = collectCriteriaPairs(args, 1, sumArr);
+    if ("error" in pairs) {
+        return pairs.error;
+    }
+    let sum = 0;
+    iterateMultiCriteria(sumArr, pairs.pairs, (r, c) => {
+        const sv = (0, _shared_1.getCell)(sumArr, r, c);
+        if (sv.kind === 1 /* RVKind.Number */) {
+            sum += sv.value;
+        }
+    });
+    return (0, values_1.rvNumber)(sum);
+}
+function fnCOUNTIF(args) {
+    const rangeArr = (0, _shared_1.asArray)(args[0]);
+    if (!rangeArr) {
+        return values_1.ERRORS.VALUE;
+    }
+    const cs = (0, values_1.topLeft)(args[1]);
+    if ((0, values_1.isError)(cs)) {
+        return cs;
+    }
+    const pred = buildCriteriaPredicateRV(cs);
+    let count = 0;
+    for (let r = 0; r < rangeArr.height; r++) {
+        for (let c = 0; c < rangeArr.width; c++) {
+            if (pred((0, _shared_1.getCell)(rangeArr, r, c))) {
+                count++;
+            }
+        }
+    }
+    return (0, values_1.rvNumber)(count);
+}
+function fnCOUNTIFS(args) {
+    if (args.length < 2 || !(0, values_1.isArray)(args[0])) {
+        return values_1.ERRORS.VALUE;
+    }
+    // The first range defines the target shape; every subsequent criteria
+    // range must match. `collectCriteriaPairs` also validates args[0]
+    // against itself (trivially passes) as a nice-to-have for consistency.
+    const target = args[0];
+    const pairs = collectCriteriaPairs(args, 0, target);
+    if ("error" in pairs) {
+        return pairs.error;
+    }
+    let count = 0;
+    iterateMultiCriteria(target, pairs.pairs, () => {
+        count++;
+    });
+    return (0, values_1.rvNumber)(count);
+}
+function fnAVERAGEIF(args) {
+    const rangeArr = (0, _shared_1.asArray)(args[0]);
+    if (!rangeArr) {
+        return values_1.ERRORS.VALUE;
+    }
+    const cs = (0, values_1.topLeft)(args[1]);
+    if ((0, values_1.isError)(cs)) {
+        return cs;
+    }
+    const pred = buildCriteriaPredicateRV(cs);
+    const avgArr = args.length > 2 ? ((0, _shared_1.asArray)(args[2]) ?? rangeArr) : rangeArr;
+    let sum = 0;
+    let count = 0;
+    for (let r = 0; r < rangeArr.height; r++) {
+        for (let c = 0; c < rangeArr.width; c++) {
+            if (pred((0, _shared_1.getCell)(rangeArr, r, c))) {
+                const sv = (0, _shared_1.getCell)(avgArr, r, c);
+                if (sv.kind === 1 /* RVKind.Number */) {
+                    sum += sv.value;
+                    count++;
+                }
+            }
+        }
+    }
+    return count === 0 ? values_1.ERRORS.DIV0 : (0, values_1.rvNumber)(sum / count);
+}
+function fnAVERAGEIFS(args) {
+    const avgArr = (0, _shared_1.asArray)(args[0]);
+    if (!avgArr || args.length < 3) {
+        return values_1.ERRORS.VALUE;
+    }
+    const pairs = collectCriteriaPairs(args, 1, avgArr);
+    if ("error" in pairs) {
+        return pairs.error;
+    }
+    let sum = 0;
+    let count = 0;
+    iterateMultiCriteria(avgArr, pairs.pairs, (r, c) => {
+        const sv = (0, _shared_1.getCell)(avgArr, r, c);
+        if (sv.kind === 1 /* RVKind.Number */) {
+            sum += sv.value;
+            count++;
+        }
+    });
+    return count === 0 ? values_1.ERRORS.DIV0 : (0, values_1.rvNumber)(sum / count);
+}
+function fnMAXIFS(args) {
+    const maxArr = (0, _shared_1.asArray)(args[0]);
+    if (!maxArr || args.length < 3) {
+        return values_1.ERRORS.VALUE;
+    }
+    const pairs = collectCriteriaPairs(args, 1, maxArr);
+    if ("error" in pairs) {
+        return pairs.error;
+    }
+    let result = -Infinity;
+    let found = false;
+    iterateMultiCriteria(maxArr, pairs.pairs, (r, c) => {
+        const sv = (0, _shared_1.getCell)(maxArr, r, c);
+        if (sv.kind === 1 /* RVKind.Number */) {
+            if (sv.value > result) {
+                result = sv.value;
+            }
+            found = true;
+        }
+    });
+    return (0, values_1.rvNumber)(found ? result : 0);
+}
+function fnMINIFS(args) {
+    const minArr = (0, _shared_1.asArray)(args[0]);
+    if (!minArr || args.length < 3) {
+        return values_1.ERRORS.VALUE;
+    }
+    const pairs = collectCriteriaPairs(args, 1, minArr);
+    if ("error" in pairs) {
+        return pairs.error;
+    }
+    let result = Infinity;
+    let found = false;
+    iterateMultiCriteria(minArr, pairs.pairs, (r, c) => {
+        const sv = (0, _shared_1.getCell)(minArr, r, c);
+        if (sv.kind === 1 /* RVKind.Number */) {
+            if (sv.value < result) {
+                result = sv.value;
+            }
+            found = true;
+        }
+    });
+    return (0, values_1.rvNumber)(found ? result : 0);
+}

package/dist/cjs/modules/formula/functions/database.js

@@ -0,0 +1,288 @@
+"use strict";
+/**
+ * Database Functions — Native RuntimeValue Implementation
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fnDSUM = fnDSUM;
+exports.fnDAVERAGE = fnDAVERAGE;
+exports.fnDCOUNT = fnDCOUNT;
+exports.fnDMAX = fnDMAX;
+exports.fnDMIN = fnDMIN;
+exports.fnDPRODUCT = fnDPRODUCT;
+exports.fnDGET = fnDGET;
+exports.fnDCOUNTA = fnDCOUNTA;
+exports.fnDSTDEV = fnDSTDEV;
+exports.fnDSTDEVP = fnDSTDEVP;
+exports.fnDVAR = fnDVAR;
+exports.fnDVARP = fnDVARP;
+const values_1 = require("../runtime/values");
+const _shared_1 = require("./_shared");
+const conditional_1 = require("./conditional");
+/**
+ * Collect the field-column values from every database row that satisfies the
+ * criteria range. The returned list preserves each matching cell's original
+ * `ScalarValue` (numbers, strings, booleans, blanks, errors) so that callers
+ * can decide how to aggregate — numeric aggregators filter to numbers while
+ * DGET inspects the raw value.
+ *
+ * Returns an error RuntimeValue when the inputs are malformed (invalid array
+ * shapes, unknown field name, etc.). On success, returns `ScalarValue[]`.
+ */
+function collectDatabaseMatches(args) {
+    const dbArr = (0, _shared_1.asArray)(args[0]);
+    const critArr = (0, _shared_1.asArray)(args[2]);
+    if (!dbArr || !critArr) {
+        return values_1.ERRORS.VALUE;
+    }
+    const fieldArg = (0, values_1.topLeft)(args[1]);
+    if (dbArr.height < 2 || critArr.height < 2) {
+        return values_1.ERRORS.VALUE;
+    }
+    // Determine field column index.
+    //
+    // Excel accepts the field argument as:
+    //   - a 1-based integer column index (or TRUE/FALSE coerced to 1/0)
+    //   - a string that matches one of the header cells (case-insensitive,
+    //     and trimmed so imported data with stray whitespace still matches)
+    let fieldIdx = -1;
+    if (fieldArg.kind === 1 /* RVKind.Number */) {
+        fieldIdx = Math.trunc(fieldArg.value) - 1;
+    }
+    else if (fieldArg.kind === 3 /* RVKind.Boolean */) {
+        // TRUE → 1-based column 1 (index 0); FALSE → 0 → invalid (Excel
+        // rejects FALSE with #VALUE!). Match that routing explicitly.
+        fieldIdx = fieldArg.value ? 0 : -1;
+    }
+    else if (fieldArg.kind === 2 /* RVKind.String */) {
+        const want = fieldArg.value.trim().toLowerCase();
+        for (let c = 0; c < dbArr.width; c++) {
+            if ((0, values_1.toStringRV)((0, _shared_1.getCell)(dbArr, 0, c))
+                .trim()
+                .toLowerCase() === want) {
+                fieldIdx = c;
+                break;
+            }
+        }
+    }
+    if (fieldIdx < 0 || fieldIdx >= dbArr.width) {
+        return values_1.ERRORS.VALUE;
+    }
+    // Parse criteria: columns map to database header columns (trimmed,
+    // case-insensitive, same as the field-name path above).
+    const critColIndices = [];
+    for (let cc = 0; cc < critArr.width; cc++) {
+        const name = (0, values_1.toStringRV)((0, _shared_1.getCell)(critArr, 0, cc))
+            .trim()
+            .toLowerCase();
+        let idx = -1;
+        for (let hc = 0; hc < dbArr.width; hc++) {
+            if ((0, values_1.toStringRV)((0, _shared_1.getCell)(dbArr, 0, hc))
+                .trim()
+                .toLowerCase() === name) {
+                idx = hc;
+                break;
+            }
+        }
+        critColIndices.push(idx);
+    }
+    // Collect matching rows' field values
+    const matches = [];
+    for (let r = 1; r < dbArr.height; r++) {
+        let matchesAnyCritRow = false;
+        for (let cr = 1; cr < critArr.height; cr++) {
+            let allMatch = true;
+            for (let cc = 0; cc < critArr.width; cc++) {
+                const critVal = (0, _shared_1.getCell)(critArr, cr, cc);
+                if (critVal.kind === 0 /* RVKind.Blank */ ||
+                    (critVal.kind === 2 /* RVKind.String */ && critVal.value === "")) {
+                    continue;
+                }
+                const dbCol = critColIndices[cc];
+                if (dbCol < 0) {
+                    allMatch = false;
+                    break;
+                }
+                const pred = (0, conditional_1.buildCriteriaPredicateRV)(critVal);
+                if (!pred((0, _shared_1.getCell)(dbArr, r, dbCol))) {
+                    allMatch = false;
+                    break;
+                }
+            }
+            if (allMatch) {
+                matchesAnyCritRow = true;
+                break;
+            }
+        }
+        if (matchesAnyCritRow) {
+            matches.push((0, _shared_1.getCell)(dbArr, r, fieldIdx));
+        }
+    }
+    return matches;
+}
+/**
+ * Shared wrapper for numeric aggregators (DSUM, DAVERAGE, DCOUNT, DMAX, DMIN,
+ * DPRODUCT). Collects matches, filters to numeric values, and delegates to the
+ * caller-supplied reducer.
+ */
+function databaseNumericAggregate(args, aggregator) {
+    const matches = collectDatabaseMatches(args);
+    if (!Array.isArray(matches)) {
+        return matches;
+    }
+    const values = [];
+    for (const v of matches) {
+        if (v.kind === 1 /* RVKind.Number */) {
+            values.push(v.value);
+        }
+    }
+    return aggregator(values);
+}
+function fnDSUM(args) {
+    return databaseNumericAggregate(args, vals => (0, values_1.rvNumber)(vals.reduce((a, b) => a + b, 0)));
+}
+function fnDAVERAGE(args) {
+    return databaseNumericAggregate(args, vals => vals.length === 0 ? values_1.ERRORS.DIV0 : (0, values_1.rvNumber)(vals.reduce((a, b) => a + b, 0) / vals.length));
+}
+function fnDCOUNT(args) {
+    return databaseNumericAggregate(args, vals => (0, values_1.rvNumber)(vals.length));
+}
+function fnDMAX(args) {
+    return databaseNumericAggregate(args, vals => {
+        if (vals.length === 0) {
+            return (0, values_1.rvNumber)(0);
+        }
+        // Avoid `Math.max(...vals)` — spreading a large numeric array onto the
+        // call stack throws `RangeError: Maximum call stack size exceeded` on
+        // databases with more than ~65k matching rows.
+        let m = vals[0];
+        for (let i = 1; i < vals.length; i++) {
+            if (vals[i] > m) {
+                m = vals[i];
+            }
+        }
+        return (0, values_1.rvNumber)(m);
+    });
+}
+function fnDMIN(args) {
+    return databaseNumericAggregate(args, vals => {
+        if (vals.length === 0) {
+            return (0, values_1.rvNumber)(0);
+        }
+        let m = vals[0];
+        for (let i = 1; i < vals.length; i++) {
+            if (vals[i] < m) {
+                m = vals[i];
+            }
+        }
+        return (0, values_1.rvNumber)(m);
+    });
+}
+function fnDPRODUCT(args) {
+    return databaseNumericAggregate(args, vals => (0, values_1.rvNumber)(vals.length === 0 ? 0 : vals.reduce((a, b) => a * b, 1)));
+}
+function fnDGET(args) {
+    const matches = collectDatabaseMatches(args);
+    if (!Array.isArray(matches)) {
+        return matches;
+    }
+    // DGET aggregator semantics: 0 matches → #VALUE!, exactly 1 → the value,
+    // >1 → #NUM!.
+    if (matches.length === 0) {
+        return values_1.ERRORS.VALUE;
+    }
+    if (matches.length > 1) {
+        return values_1.ERRORS.NUM;
+    }
+    return matches[0];
+}
+/**
+ * DCOUNTA(database, field, criteria) — count non-empty cells that match
+ * the criteria, in the specified field. Unlike DCOUNT (numeric-only),
+ * DCOUNTA counts any non-blank cell including text and booleans.
+ */
+function fnDCOUNTA(args) {
+    const matches = collectDatabaseMatches(args);
+    if (!Array.isArray(matches)) {
+        return matches;
+    }
+    let count = 0;
+    for (const v of matches) {
+        // Count anything that is not Blank and not an empty string.
+        if (v.kind === 0 /* RVKind.Blank */) {
+            continue;
+        }
+        if (v.kind === 2 /* RVKind.String */ && v.value === "") {
+            continue;
+        }
+        count++;
+    }
+    return (0, values_1.rvNumber)(count);
+}
+/**
+ * DSTDEV(database, field, criteria) — sample standard deviation of
+ * numeric cells matching criteria in the specified field.
+ */
+function fnDSTDEV(args) {
+    return databaseNumericAggregate(args, vals => {
+        if (vals.length < 2) {
+            return values_1.ERRORS.DIV0;
+        }
+        const mean = vals.reduce((a, b) => a + b, 0) / vals.length;
+        let ss = 0;
+        for (const v of vals) {
+            ss += (v - mean) * (v - mean);
+        }
+        return (0, values_1.rvNumber)(Math.sqrt(ss / (vals.length - 1)));
+    });
+}
+/**
+ * DSTDEVP(database, field, criteria) — population standard deviation
+ * of numeric cells matching criteria.
+ */
+function fnDSTDEVP(args) {
+    return databaseNumericAggregate(args, vals => {
+        if (vals.length === 0) {
+            return values_1.ERRORS.DIV0;
+        }
+        const mean = vals.reduce((a, b) => a + b, 0) / vals.length;
+        let ss = 0;
+        for (const v of vals) {
+            ss += (v - mean) * (v - mean);
+        }
+        return (0, values_1.rvNumber)(Math.sqrt(ss / vals.length));
+    });
+}
+/**
+ * DVAR(database, field, criteria) — sample variance of matching numeric
+ * cells.
+ */
+function fnDVAR(args) {
+    return databaseNumericAggregate(args, vals => {
+        if (vals.length < 2) {
+            return values_1.ERRORS.DIV0;
+        }
+        const mean = vals.reduce((a, b) => a + b, 0) / vals.length;
+        let ss = 0;
+        for (const v of vals) {
+            ss += (v - mean) * (v - mean);
+        }
+        return (0, values_1.rvNumber)(ss / (vals.length - 1));
+    });
+}
+/**
+ * DVARP(database, field, criteria) — population variance of matching
+ * numeric cells.
+ */
+function fnDVARP(args) {
+    return databaseNumericAggregate(args, vals => {
+        if (vals.length === 0) {
+            return values_1.ERRORS.DIV0;
+        }
+        const mean = vals.reduce((a, b) => a + b, 0) / vals.length;
+        let ss = 0;
+        for (const v of vals) {
+            ss += (v - mean) * (v - mean);
+        }
+        return (0, values_1.rvNumber)(ss / vals.length);
+    });
+}