@cj-tech-master/excelts 9.2.1 → 9.3.0

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

@@ -0,0 +1,902 @@
+"use strict";
+/**
+ * Lookup / Reference Functions — Native RuntimeValue Implementation
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.fnROW = fnROW;
+exports.fnCOLUMN = fnCOLUMN;
+exports.fnROWS = fnROWS;
+exports.fnCOLUMNS = fnCOLUMNS;
+exports.fnINDEX = fnINDEX;
+exports.fnMATCH = fnMATCH;
+exports.fnVLOOKUP = fnVLOOKUP;
+exports.fnHLOOKUP = fnHLOOKUP;
+exports.fnXLOOKUP = fnXLOOKUP;
+exports.fnXMATCH = fnXMATCH;
+exports.fnADDRESS = fnADDRESS;
+exports.fnLOOKUP = fnLOOKUP;
+exports.fnTRANSPOSE = fnTRANSPOSE;
+exports.fnAREAS = fnAREAS;
+const values_1 = require("../runtime/values");
+const _shared_1 = require("./_shared");
+// ============================================================================
+// Helpers
+// ============================================================================
+/** Compare two scalar values for same-type ordering. */
+function sameType(a, b) {
+    return a.kind === b.kind;
+}
+function scalarIsNumber(v) {
+    return v.kind === 1 /* RVKind.Number */;
+}
+function scalarIsString(v) {
+    return v.kind === 2 /* RVKind.String */;
+}
+function scalarStringEquals(a, b) {
+    return scalarIsString(a) && scalarIsString(b) && a.value.toLowerCase() === b.value.toLowerCase();
+}
+/**
+ * Ordered comparison of two scalars. Numbers compared by value; strings by
+ * case-insensitive lexical order. Returns NaN when the two operands have
+ * incompatible types (e.g. number vs string) so callers can skip them.
+ */
+/**
+ * @deprecated Use `compareScalarsSameKind` from `runtime/values` directly —
+ * the two are identical. Retained only as a local alias to keep the diff
+ * small; callers inside this file are free to migrate.
+ */
+const compareScalar = values_1.compareScalarsSameKind;
+// ============================================================================
+// Functions
+// ============================================================================
+function fnROW(args) {
+    // The reference-aware path is handled in evaluator.ts via tryEvaluateRefFunction.
+    // This fallback is only reached when the argument is not a reference (e.g.
+    // ROW(INDIRECT("A5")) or ROW({1,2,3})), which Excel rejects as #VALUE!.
+    return values_1.ERRORS.VALUE;
+}
+function fnCOLUMN(args) {
+    // See fnROW. Non-reference argument → #VALUE!.
+    return values_1.ERRORS.VALUE;
+}
+function fnROWS(args) {
+    const a = args[0];
+    if (a.kind === 5 /* RVKind.Array */) {
+        return (0, values_1.rvNumber)(a.height);
+    }
+    return (0, values_1.rvNumber)(1);
+}
+function fnCOLUMNS(args) {
+    const a = args[0];
+    if (a.kind === 5 /* RVKind.Array */) {
+        return (0, values_1.rvNumber)(a.width);
+    }
+    return (0, values_1.rvNumber)(1);
+}
+function fnINDEX(args) {
+    if (!(0, values_1.isArray)(args[0])) {
+        return (0, values_1.topLeft)(args[0]);
+    }
+    const arr = args[0];
+    const rowNumV = args.length > 1 ? (0, values_1.toNumberRV)(args[1]) : (0, values_1.rvNumber)(0);
+    if ((0, values_1.isError)(rowNumV)) {
+        return rowNumV;
+    }
+    // Excel truncates fractional indices toward zero before bounds checks.
+    // Without this, `INDEX(a, 1.5, 1)` would index into `arr.rows[0.5]`, which
+    // in V8 silently returns `undefined` and corrupts downstream values.
+    const rowNum = Math.trunc(rowNumV.value);
+    const colNumV = args.length > 2 ? (0, values_1.toNumberRV)(args[2]) : (0, values_1.rvNumber)(0);
+    if ((0, values_1.isError)(colNumV)) {
+        return colNumV;
+    }
+    const colNum = Math.trunc(colNumV.value);
+    if (rowNum < 0 || colNum < 0) {
+        return values_1.ERRORS.VALUE;
+    }
+    if (rowNum === 0 && colNum === 0) {
+        return arr;
+    }
+    // rowNum=0: return entire column as array
+    if (rowNum === 0) {
+        const c = colNum - 1;
+        if (c < 0 || c >= arr.width) {
+            return values_1.ERRORS.REF;
+        }
+        const rows = [];
+        for (let r = 0; r < arr.height; r++) {
+            rows.push([(0, _shared_1.getCell)(arr, r, c)]);
+        }
+        return (0, values_1.rvArray)(rows);
+    }
+    // colNum=0: return entire row as array
+    if (colNum === 0) {
+        const r = rowNum - 1;
+        if (r < 0 || r >= arr.height) {
+            return values_1.ERRORS.REF;
+        }
+        return (0, values_1.rvArray)([[...arr.rows[r]]]);
+    }
+    // Single cell
+    const r = rowNum - 1;
+    const c = colNum - 1;
+    if (r < 0 || r >= arr.height || c < 0 || c >= arr.width) {
+        return values_1.ERRORS.REF;
+    }
+    return arr.rows[r][c];
+}
+function fnMATCH(args) {
+    const lookupValue = (0, values_1.topLeft)(args[0]);
+    if (lookupValue.kind === 4 /* RVKind.Error */) {
+        return lookupValue;
+    }
+    if (!(0, values_1.isArray)(args[1])) {
+        return values_1.ERRORS.NA;
+    }
+    const lookupArr = args[1];
+    const matchTypeV = args.length > 2 ? (0, values_1.toNumberRV)(args[2]) : (0, values_1.rvNumber)(1);
+    if ((0, values_1.isError)(matchTypeV)) {
+        return matchTypeV;
+    }
+    const matchType = matchTypeV.value;
+    // Flatten to 1D
+    const flat = [];
+    for (let r = 0; r < lookupArr.height; r++) {
+        for (let c = 0; c < lookupArr.width; c++) {
+            flat.push((0, _shared_1.getCell)(lookupArr, r, c));
+        }
+    }
+    if (matchType === 0) {
+        // Exact match (with wildcard support for string lookups). The shared
+        // `excelWildcardToRegex` converter applies the same `~*`, `~?`, `~~`
+        // escape rules used by SEARCH, XLOOKUP, and SUMIF so behaviour is
+        // consistent across the engine.
+        const lookupStr = scalarIsString(lookupValue) ? lookupValue.value : null;
+        const hasWildcard = lookupStr !== null && (0, _shared_1.hasUnescapedWildcard)(lookupStr);
+        let wildcardRe = null;
+        if (hasWildcard && lookupStr !== null) {
+            try {
+                wildcardRe = new RegExp("^" + (0, _shared_1.excelWildcardToRegex)(lookupStr) + "$", "i");
+            }
+            catch {
+                wildcardRe = null;
+            }
+        }
+        for (let i = 0; i < flat.length; i++) {
+            if ((0, values_1.scalarEquals)(flat[i], lookupValue)) {
+                return (0, values_1.rvNumber)(i + 1);
+            }
+            const fi = flat[i];
+            if (scalarIsString(fi) && scalarIsString(lookupValue)) {
+                if (wildcardRe) {
+                    if (wildcardRe.test(fi.value)) {
+                        return (0, values_1.rvNumber)(i + 1);
+                    }
+                }
+                else {
+                    // No unescaped wildcard — but the pattern may still contain
+                    // `~*` / `~?` / `~~` escape sequences that should reduce to
+                    // their literal character before comparison. Calling
+                    // `unescapeExcelWildcard` here matches the treatment that
+                    // SEARCH and the criteria predicate use; without it,
+                    // `MATCH("a~*b", ...)` would literally look for `"a~*b"`
+                    // instead of `"a*b"`.
+                    const literal = (0, _shared_1.unescapeExcelWildcard)(lookupValue.value).toLowerCase();
+                    if (fi.value.toLowerCase() === literal) {
+                        return (0, values_1.rvNumber)(i + 1);
+                    }
+                }
+            }
+        }
+        return values_1.ERRORS.NA;
+    }
+    if (matchType === 1 || matchType > 0) {
+        // Sorted ascending. Find largest value <= lookupValue.
+        let bestIdx = -1;
+        for (let i = 0; i < flat.length; i++) {
+            const v = flat[i];
+            if (sameType(v, lookupValue)) {
+                if (scalarIsNumber(v) && scalarIsNumber(lookupValue)) {
+                    if (v.value <= lookupValue.value) {
+                        bestIdx = i;
+                    }
+                    else {
+                        break;
+                    }
+                }
+                else if (scalarIsString(v) && scalarIsString(lookupValue)) {
+                    if (v.value.toLowerCase() <= lookupValue.value.toLowerCase()) {
+                        bestIdx = i;
+                    }
+                    else {
+                        break;
+                    }
+                }
+            }
+        }
+        return bestIdx >= 0 ? (0, values_1.rvNumber)(bestIdx + 1) : values_1.ERRORS.NA;
+    }
+    // matchType === -1: Sorted descending. Find smallest value >= lookupValue.
+    let bestIdx = -1;
+    for (let i = 0; i < flat.length; i++) {
+        const v = flat[i];
+        if (sameType(v, lookupValue)) {
+            if (scalarIsNumber(v) && scalarIsNumber(lookupValue)) {
+                if (v.value >= lookupValue.value) {
+                    bestIdx = i;
+                }
+                else {
+                    break;
+                }
+            }
+            else if (scalarIsString(v) && scalarIsString(lookupValue)) {
+                if (v.value.toLowerCase() >= lookupValue.value.toLowerCase()) {
+                    bestIdx = i;
+                }
+                else {
+                    break;
+                }
+            }
+        }
+    }
+    return bestIdx >= 0 ? (0, values_1.rvNumber)(bestIdx + 1) : values_1.ERRORS.NA;
+}
+function fnVLOOKUP(args) {
+    const lookupValue = (0, values_1.topLeft)(args[0]);
+    if (lookupValue.kind === 4 /* RVKind.Error */) {
+        return lookupValue;
+    }
+    if (!(0, values_1.isArray)(args[1])) {
+        return values_1.ERRORS.NA;
+    }
+    const table = args[1];
+    const colIndexV = (0, values_1.toNumberRV)(args[2]);
+    if ((0, values_1.isError)(colIndexV)) {
+        return colIndexV;
+    }
+    // VLOOKUP truncates the column index toward zero before bounds checks.
+    const colIndex = Math.trunc(colIndexV.value);
+    const rangeLookupV = args.length > 3 ? (0, values_1.toBooleanRV)(args[3]) : { kind: 3 /* RVKind.Boolean */, value: true };
+    if ((0, values_1.isError)(rangeLookupV)) {
+        return rangeLookupV;
+    }
+    const rangeLookup = rangeLookupV.value;
+    if (colIndex < 1 || colIndex > table.width) {
+        return values_1.ERRORS.REF;
+    }
+    if (!rangeLookup) {
+        // Exact match
+        for (let r = 0; r < table.height; r++) {
+            const cell = (0, _shared_1.getCell)(table, r, 0);
+            if ((0, values_1.scalarEquals)(cell, lookupValue)) {
+                return (0, _shared_1.getCell)(table, r, colIndex - 1);
+            }
+            if (scalarStringEquals(cell, lookupValue)) {
+                return (0, _shared_1.getCell)(table, r, colIndex - 1);
+            }
+        }
+        return values_1.ERRORS.NA;
+    }
+    // Approximate match: sorted ascending by first column.
+    let bestRow = -1;
+    for (let r = 0; r < table.height; r++) {
+        const v = (0, _shared_1.getCell)(table, r, 0);
+        if (sameType(v, lookupValue)) {
+            if (scalarIsNumber(v) && scalarIsNumber(lookupValue)) {
+                if (v.value <= lookupValue.value) {
+                    bestRow = r;
+                }
+                else {
+                    break;
+                }
+            }
+            else if (scalarIsString(v) && scalarIsString(lookupValue)) {
+                if (v.value.toLowerCase() <= lookupValue.value.toLowerCase()) {
+                    bestRow = r;
+                }
+                else {
+                    break;
+                }
+            }
+        }
+    }
+    return bestRow >= 0 ? (0, _shared_1.getCell)(table, bestRow, colIndex - 1) : values_1.ERRORS.NA;
+}
+function fnHLOOKUP(args) {
+    const lookupValue = (0, values_1.topLeft)(args[0]);
+    if (lookupValue.kind === 4 /* RVKind.Error */) {
+        return lookupValue;
+    }
+    if (!(0, values_1.isArray)(args[1])) {
+        return values_1.ERRORS.NA;
+    }
+    const table = args[1];
+    const rowIndexV = (0, values_1.toNumberRV)(args[2]);
+    if ((0, values_1.isError)(rowIndexV)) {
+        return rowIndexV;
+    }
+    // HLOOKUP truncates the row index toward zero before bounds checks.
+    const rowIndex = Math.trunc(rowIndexV.value);
+    const rangeLookupV = args.length > 3 ? (0, values_1.toBooleanRV)(args[3]) : { kind: 3 /* RVKind.Boolean */, value: true };
+    if ((0, values_1.isError)(rangeLookupV)) {
+        return rangeLookupV;
+    }
+    const rangeLookup = rangeLookupV.value;
+    if (rowIndex < 1 || rowIndex > table.height) {
+        return values_1.ERRORS.REF;
+    }
+    if (!rangeLookup) {
+        for (let c = 0; c < table.width; c++) {
+            if ((0, values_1.scalarEquals)((0, _shared_1.getCell)(table, 0, c), lookupValue)) {
+                return (0, _shared_1.getCell)(table, rowIndex - 1, c);
+            }
+        }
+        return values_1.ERRORS.NA;
+    }
+    let bestCol = -1;
+    for (let c = 0; c < table.width; c++) {
+        const hv = (0, _shared_1.getCell)(table, 0, c);
+        if (sameType(hv, lookupValue)) {
+            // For approximate match, find largest <= lookupValue
+            if (scalarIsNumber(hv) && scalarIsNumber(lookupValue)) {
+                if (hv.value <= lookupValue.value) {
+                    bestCol = c;
+                }
+            }
+            else if (scalarIsString(hv) && scalarIsString(lookupValue)) {
+                if (hv.value.toLowerCase() <= lookupValue.value.toLowerCase()) {
+                    bestCol = c;
+                }
+            }
+        }
+    }
+    return bestCol >= 0 ? (0, _shared_1.getCell)(table, rowIndex - 1, bestCol) : values_1.ERRORS.NA;
+}
+function fnXLOOKUP(args) {
+    const lookupValue = (0, values_1.topLeft)(args[0]);
+    if (lookupValue.kind === 4 /* RVKind.Error */) {
+        return lookupValue;
+    }
+    if (!(0, values_1.isArray)(args[1])) {
+        return values_1.ERRORS.VALUE;
+    }
+    const lookupArr = args[1];
+    if (!(0, values_1.isArray)(args[2])) {
+        return values_1.ERRORS.VALUE;
+    }
+    const returnArr = args[2];
+    const ifNotFound = args.length > 3 ? (0, values_1.topLeft)(args[3]) : null;
+    const matchModeV = args.length > 4 ? (0, values_1.toNumberRV)(args[4]) : (0, values_1.rvNumber)(0);
+    if ((0, values_1.isError)(matchModeV)) {
+        return matchModeV;
+    }
+    const matchMode = matchModeV.value;
+    const searchModeV = args.length > 5 ? (0, values_1.toNumberRV)(args[5]) : (0, values_1.rvNumber)(1);
+    if ((0, values_1.isError)(searchModeV)) {
+        return searchModeV;
+    }
+    const searchMode = searchModeV.value;
+    // Flatten lookup array to 1D
+    const flat = [];
+    const isRow = lookupArr.height === 1;
+    if (isRow) {
+        for (let c = 0; c < lookupArr.width; c++) {
+            flat.push((0, _shared_1.getCell)(lookupArr, 0, c));
+        }
+    }
+    else {
+        for (let r = 0; r < lookupArr.height; r++) {
+            flat.push((0, _shared_1.getCell)(lookupArr, r, 0));
+        }
+    }
+    let foundIdx = -1;
+    const doCompare = (a, b) => {
+        // Use `compareScalarsSameKind` (shared with sorting / linear match)
+        // instead of `localeCompare`. `localeCompare` is locale-sensitive and
+        // can disagree with the `toLowerCase+===` equality check used on the
+        // linear-search path — binary search would then skip the exact cell
+        // that linear search would find (e.g. Turkish dotless I, ß→ss, etc.).
+        // See R6-P1-11.
+        const cmp = (0, values_1.compareScalarsSameKind)(a, b);
+        return Number.isFinite(cmp) ? cmp : 0;
+    };
+    // ── Binary search for sorted data (searchMode = ±2) ──
+    // Excel assumes the data is sorted ascending (2) or descending (-2). The
+    // array must contain values of a single type compatible with `lookupValue`;
+    // cells of an incompatible type make the sort invalid and binary search
+    // cannot produce a meaningful result, so we fall back to #N/A in that
+    // scenario (matching Excel's behaviour when the data is "not sorted").
+    //
+    // Supports matchMode 0 (exact), -1 (exact or next smaller), 1 (exact or
+    // next larger). Wildcard matchMode (2) is incompatible with binary search
+    // by definition — Excel silently downgrades to linear scan, which we do
+    // by leaving `searchMode` as 1 below.
+    const isBinary = (searchMode === 2 || searchMode === -2) && matchMode !== 2;
+    if (isBinary) {
+        const ascending = searchMode === 2;
+        let lo = 0;
+        let hi = flat.length - 1;
+        let exact = -1;
+        let nextSmaller = -1; // largest index with value < lookupValue (ascending)
+        let nextLarger = -1; // smallest index with value > lookupValue (ascending)
+        while (lo <= hi) {
+            const mid = (lo + hi) >>> 1;
+            const v = flat[mid];
+            if (!sameType(v, lookupValue)) {
+                // Heterogeneous array — binary search preconditions violated.
+                exact = -1;
+                nextSmaller = -1;
+                nextLarger = -1;
+                break;
+            }
+            const cmp = doCompare(v, lookupValue);
+            if (cmp === 0) {
+                exact = mid;
+                break;
+            }
+            // In descending order, the ordering is inverted: treat `cmp > 0` on
+            // the left half as "still greater than target" → search right.
+            const goLeft = ascending ? cmp > 0 : cmp < 0;
+            if (goLeft) {
+                // mid is larger (ascending) or smaller (descending) than target
+                if (ascending) {
+                    nextLarger = nextLarger === -1 || mid < nextLarger ? mid : nextLarger;
+                }
+                else {
+                    nextSmaller = nextSmaller === -1 || mid < nextSmaller ? mid : nextSmaller;
+                }
+                hi = mid - 1;
+            }
+            else {
+                if (ascending) {
+                    nextSmaller = nextSmaller === -1 || mid > nextSmaller ? mid : nextSmaller;
+                }
+                else {
+                    nextLarger = nextLarger === -1 || mid > nextLarger ? mid : nextLarger;
+                }
+                lo = mid + 1;
+            }
+        }
+        if (exact !== -1) {
+            foundIdx = exact;
+        }
+        else if (matchMode === -1) {
+            foundIdx = nextSmaller;
+        }
+        else if (matchMode === 1) {
+            foundIdx = nextLarger;
+        }
+        else {
+            foundIdx = -1;
+        }
+    }
+    else if (matchMode === 0) {
+        // Exact match
+        const start = searchMode === -1 ? flat.length - 1 : 0;
+        const end = searchMode === -1 ? -1 : flat.length;
+        const step = searchMode === -1 ? -1 : 1;
+        for (let i = start; i !== end; i += step) {
+            if ((0, values_1.scalarEquals)(flat[i], lookupValue)) {
+                foundIdx = i;
+                break;
+            }
+            if (scalarStringEquals(flat[i], lookupValue)) {
+                foundIdx = i;
+                break;
+            }
+        }
+    }
+    else if (matchMode === -1) {
+        // Exact match or next smaller
+        let best = -1;
+        for (let i = 0; i < flat.length; i++) {
+            if (sameType(flat[i], lookupValue)) {
+                const cmp = doCompare(flat[i], lookupValue);
+                if (cmp === 0) {
+                    best = i;
+                    break;
+                }
+                if (cmp < 0 && (best === -1 || doCompare(flat[i], flat[best]) > 0)) {
+                    best = i;
+                }
+            }
+        }
+        foundIdx = best;
+    }
+    else if (matchMode === 1) {
+        // Exact match or next larger
+        let best = -1;
+        for (let i = 0; i < flat.length; i++) {
+            if (sameType(flat[i], lookupValue)) {
+                const cmp = doCompare(flat[i], lookupValue);
+                if (cmp === 0) {
+                    best = i;
+                    break;
+                }
+                if (cmp > 0 && (best === -1 || doCompare(flat[i], flat[best]) < 0)) {
+                    best = i;
+                }
+            }
+        }
+        foundIdx = best;
+    }
+    else if (matchMode === 2) {
+        // Wildcard match — uses the shared Excel wildcard converter so SEARCH,
+        // MATCH, XLOOKUP, and SUMIF/COUNTIF agree on `~*`, `~?`, `~~` escaping.
+        const lookupStr = (0, values_1.toStringRV)(lookupValue);
+        const pattern = (0, _shared_1.excelWildcardToRegex)(lookupStr);
+        try {
+            const re = new RegExp("^" + pattern + "$", "i");
+            for (let i = 0; i < flat.length; i++) {
+                if (re.test((0, values_1.toStringRV)(flat[i]))) {
+                    foundIdx = i;
+                    break;
+                }
+            }
+        }
+        catch {
+            for (let i = 0; i < flat.length; i++) {
+                if ((0, values_1.toStringRV)(flat[i]).toLowerCase() === lookupStr.toLowerCase()) {
+                    foundIdx = i;
+                    break;
+                }
+            }
+        }
+    }
+    if (foundIdx === -1) {
+        return ifNotFound !== null ? ifNotFound : values_1.ERRORS.NA;
+    }
+    // Return from return array
+    if (isRow) {
+        // Horizontal lookup: the lookup axis is the column axis of the return
+        // array, so `foundIdx` selects a column. A single-row return array
+        // yields a scalar; a multi-row return array yields a column vector.
+        if (foundIdx >= returnArr.width) {
+            return values_1.BLANK;
+        }
+        if (returnArr.height === 1) {
+            return (0, _shared_1.getCell)(returnArr, 0, foundIdx);
+        }
+        const col = [];
+        for (let r = 0; r < returnArr.height; r++) {
+            col.push([(0, _shared_1.getCell)(returnArr, r, foundIdx)]);
+        }
+        return (0, values_1.rvArray)(col);
+    }
+    // Vertical lookup: `foundIdx` selects a row; a single-column return
+    // array yields a scalar; a multi-column array yields a row vector.
+    if (foundIdx < returnArr.height) {
+        if (returnArr.width === 1) {
+            return (0, _shared_1.getCell)(returnArr, foundIdx, 0);
+        }
+        const row = [];
+        for (let c = 0; c < returnArr.width; c++) {
+            row.push((0, _shared_1.getCell)(returnArr, foundIdx, c));
+        }
+        return (0, values_1.rvArray)([row]);
+    }
+    return values_1.BLANK;
+}
+function fnXMATCH(args) {
+    const lookupValue = (0, values_1.topLeft)(args[0]);
+    if (lookupValue.kind === 4 /* RVKind.Error */) {
+        return lookupValue;
+    }
+    if (!(0, values_1.isArray)(args[1])) {
+        return values_1.ERRORS.VALUE;
+    }
+    const lookupArr = args[1];
+    const matchModeV = args.length > 2 ? (0, values_1.toNumberRV)(args[2]) : (0, values_1.rvNumber)(0);
+    if ((0, values_1.isError)(matchModeV)) {
+        return matchModeV;
+    }
+    const matchMode = matchModeV.value;
+    const searchModeV = args.length > 3 ? (0, values_1.toNumberRV)(args[3]) : (0, values_1.rvNumber)(1);
+    if ((0, values_1.isError)(searchModeV)) {
+        return searchModeV;
+    }
+    const searchMode = searchModeV.value;
+    const flat = [];
+    if (lookupArr.height === 1) {
+        for (let c = 0; c < lookupArr.width; c++) {
+            flat.push((0, _shared_1.getCell)(lookupArr, 0, c));
+        }
+    }
+    else {
+        for (let r = 0; r < lookupArr.height; r++) {
+            flat.push((0, _shared_1.getCell)(lookupArr, r, 0));
+        }
+    }
+    if (matchMode === 0) {
+        const start = searchMode === -1 ? flat.length - 1 : 0;
+        const end = searchMode === -1 ? -1 : flat.length;
+        const step = searchMode === -1 ? -1 : 1;
+        for (let i = start; i !== end; i += step) {
+            if ((0, values_1.scalarEquals)(flat[i], lookupValue)) {
+                return (0, values_1.rvNumber)(i + 1);
+            }
+            if (scalarStringEquals(flat[i], lookupValue)) {
+                return (0, values_1.rvNumber)(i + 1);
+            }
+        }
+        return values_1.ERRORS.NA;
+    }
+    if (matchMode === 2) {
+        // Wildcard matching — `*` and `?` (with `~` escape). Only meaningful
+        // when the lookup value is a string; for non-string lookup values
+        // Excel falls back to plain comparison.
+        if (lookupValue.kind !== 2 /* RVKind.String */) {
+            // Fall through to exact-match semantics for non-string lookups.
+            const start = searchMode === -1 ? flat.length - 1 : 0;
+            const end = searchMode === -1 ? -1 : flat.length;
+            const step = searchMode === -1 ? -1 : 1;
+            for (let i = start; i !== end; i += step) {
+                if ((0, values_1.scalarEquals)(flat[i], lookupValue)) {
+                    return (0, values_1.rvNumber)(i + 1);
+                }
+            }
+            return values_1.ERRORS.NA;
+        }
+        const pattern = lookupValue.value;
+        const matcher = (0, _shared_1.hasUnescapedWildcard)(pattern)
+            ? new RegExp(`^${(0, _shared_1.excelWildcardToRegex)(pattern)}$`, "iu")
+            : null;
+        const literal = matcher ? null : (0, _shared_1.unescapeExcelWildcard)(pattern).toLowerCase();
+        const start = searchMode === -1 ? flat.length - 1 : 0;
+        const end = searchMode === -1 ? -1 : flat.length;
+        const step = searchMode === -1 ? -1 : 1;
+        for (let i = start; i !== end; i += step) {
+            const cell = flat[i];
+            if (cell.kind !== 2 /* RVKind.String */) {
+                continue;
+            }
+            if (matcher) {
+                if (matcher.test(cell.value)) {
+                    return (0, values_1.rvNumber)(i + 1);
+                }
+            }
+            else if (cell.value.toLowerCase() === literal) {
+                return (0, values_1.rvNumber)(i + 1);
+            }
+        }
+        return values_1.ERRORS.NA;
+    }
+    if (matchMode === -1) {
+        // Next-smaller-or-equal: largest item <= lookupValue.
+        let best = -1;
+        for (let i = 0; i < flat.length; i++) {
+            const cmp = compareScalar(flat[i], lookupValue);
+            if (Number.isNaN(cmp)) {
+                continue;
+            }
+            if (cmp <= 0 && (best === -1 || compareScalar(flat[i], flat[best]) > 0)) {
+                best = i;
+            }
+        }
+        return best >= 0 ? (0, values_1.rvNumber)(best + 1) : values_1.ERRORS.NA;
+    }
+    if (matchMode === 1) {
+        // Next-larger-or-equal: smallest item >= lookupValue.
+        let best = -1;
+        for (let i = 0; i < flat.length; i++) {
+            const cmp = compareScalar(flat[i], lookupValue);
+            if (Number.isNaN(cmp)) {
+                continue;
+            }
+            if (cmp >= 0 && (best === -1 || compareScalar(flat[i], flat[best]) < 0)) {
+                best = i;
+            }
+        }
+        return best >= 0 ? (0, values_1.rvNumber)(best + 1) : values_1.ERRORS.NA;
+    }
+    return values_1.ERRORS.NA;
+}
+function fnADDRESS(args) {
+    const rowNumV = (0, values_1.toNumberRV)(args[0]);
+    if ((0, values_1.isError)(rowNumV)) {
+        return rowNumV;
+    }
+    const rowNum = Math.trunc(rowNumV.value);
+    const colNumV = (0, values_1.toNumberRV)(args[1]);
+    if ((0, values_1.isError)(colNumV)) {
+        return colNumV;
+    }
+    const colNum = Math.trunc(colNumV.value);
+    // ADDRESS rejects non-positive row/col with #VALUE!. Without this guard
+    // ADDRESS(0, 1) would silently return "$A$0" and ADDRESS(1, 0) would
+    // produce "$$1" (no column letter) — neither is a legal cell reference.
+    if (!Number.isFinite(rowNum) || !Number.isFinite(colNum) || rowNum < 1 || colNum < 1) {
+        return values_1.ERRORS.VALUE;
+    }
+    const absNumV = args.length > 2 ? (0, values_1.toNumberRV)(args[2]) : (0, values_1.rvNumber)(1);
+    if ((0, values_1.isError)(absNumV)) {
+        return absNumV;
+    }
+    const absNum = Math.trunc(absNumV.value);
+    // Excel only accepts abs_num ∈ {1, 2, 3, 4}; anything else is #VALUE!.
+    if (absNum < 1 || absNum > 4) {
+        return values_1.ERRORS.VALUE;
+    }
+    // a1 style (true/default) vs r1c1 (false)
+    const a1Arg = args.length > 3 ? (0, values_1.topLeft)(args[3]) : { kind: 3 /* RVKind.Boolean */, value: true };
+    const a1 = a1Arg.kind === 3 /* RVKind.Boolean */ ? a1Arg.value : true;
+    const sheetText = args.length > 4 ? (0, values_1.toStringRV)(args[4]) : "";
+    if (!a1) {
+        // R1C1 style
+        const rPart = absNum === 1 || absNum === 2 ? `R${rowNum}` : `R[${rowNum}]`;
+        const cPart = absNum === 1 || absNum === 3 ? `C${colNum}` : `C[${colNum}]`;
+        const prefix = sheetText ? `${renderSheetPrefix(sheetText)}!` : "";
+        return (0, values_1.rvString)(prefix + rPart + cPart);
+    }
+    // Convert column number to letters
+    let col = "";
+    let cv = colNum;
+    while (cv > 0) {
+        cv--;
+        col = String.fromCharCode(65 + (cv % 26)) + col;
+        cv = Math.floor(cv / 26);
+    }
+    let result;
+    switch (absNum) {
+        case 1:
+            result = "$" + col + "$" + rowNum;
+            break;
+        case 2:
+            result = col + "$" + rowNum;
+            break;
+        case 3:
+            result = "$" + col + rowNum;
+            break;
+        case 4:
+            result = col + rowNum;
+            break;
+        default:
+            // Unreachable — `absNum` is already validated to {1, 2, 3, 4} above.
+            result = "$" + col + "$" + rowNum;
+    }
+    if (sheetText) {
+        result = renderSheetPrefix(sheetText) + "!" + result;
+    }
+    return (0, values_1.rvString)(result);
+}
+/**
+ * Quote a sheet name for use in a reference prefix the way Excel does:
+ *   - plain `Name` (letters, digits, underscore, leading non-digit) → as-is
+ *   - anything else → wrapped in single quotes with embedded `'` doubled
+ */
+function renderSheetPrefix(name) {
+    if (/^[A-Za-z_][A-Za-z0-9_]*$/.test(name)) {
+        return name;
+    }
+    return `'${name.replace(/'/g, "''")}'`;
+}
+function fnLOOKUP(args) {
+    const lookupValue = (0, values_1.topLeft)(args[0]);
+    if (lookupValue.kind === 4 /* RVKind.Error */) {
+        return lookupValue;
+    }
+    if (!(0, values_1.isArray)(args[1])) {
+        return values_1.ERRORS.NA;
+    }
+    const lookupArr = args[1];
+    if (args.length > 2 && (0, values_1.isArray)(args[2])) {
+        const resultArr = args[2];
+        const flat = [];
+        const isRow = lookupArr.height === 1;
+        if (isRow) {
+            for (let c = 0; c < lookupArr.width; c++) {
+                flat.push((0, _shared_1.getCell)(lookupArr, 0, c));
+            }
+        }
+        else {
+            for (let r = 0; r < lookupArr.height; r++) {
+                flat.push((0, _shared_1.getCell)(lookupArr, r, 0));
+            }
+        }
+        let bestIdx = -1;
+        for (let i = 0; i < flat.length; i++) {
+            const v = flat[i];
+            if (sameType(v, lookupValue)) {
+                if (scalarIsNumber(v) && scalarIsNumber(lookupValue) && v.value <= lookupValue.value) {
+                    bestIdx = i;
+                }
+                else if (scalarIsString(v) &&
+                    scalarIsString(lookupValue) &&
+                    v.value.toLowerCase() <= lookupValue.value.toLowerCase()) {
+                    bestIdx = i;
+                }
+            }
+        }
+        if (bestIdx === -1) {
+            return values_1.ERRORS.NA;
+        }
+        if (isRow) {
+            return resultArr.height === 1
+                ? bestIdx < resultArr.width
+                    ? (0, _shared_1.getCell)(resultArr, 0, bestIdx)
+                    : values_1.BLANK
+                : bestIdx < resultArr.height
+                    ? (0, _shared_1.getCell)(resultArr, bestIdx, 0)
+                    : values_1.BLANK;
+        }
+        return bestIdx < resultArr.height ? (0, _shared_1.getCell)(resultArr, bestIdx, 0) : values_1.BLANK;
+    }
+    const rows = lookupArr.height;
+    const cols = lookupArr.width;
+    if (cols === 0) {
+        return values_1.ERRORS.NA;
+    }
+    if (cols >= rows) {
+        let bestIdx = -1;
+        for (let c = 0; c < cols; c++) {
+            const v = (0, _shared_1.getCell)(lookupArr, 0, c);
+            if (sameType(v, lookupValue)) {
+                if (scalarIsNumber(v) && scalarIsNumber(lookupValue) && v.value <= lookupValue.value) {
+                    bestIdx = c;
+                }
+                else if (scalarIsString(v) &&
+                    scalarIsString(lookupValue) &&
+                    v.value.toLowerCase() <= lookupValue.value.toLowerCase()) {
+                    bestIdx = c;
+                }
+            }
+        }
+        return bestIdx >= 0 ? (0, _shared_1.getCell)(lookupArr, rows - 1, bestIdx) : values_1.ERRORS.NA;
+    }
+    let bestIdx = -1;
+    for (let r = 0; r < rows; r++) {
+        const v = (0, _shared_1.getCell)(lookupArr, r, 0);
+        if (sameType(v, lookupValue)) {
+            if (scalarIsNumber(v) && scalarIsNumber(lookupValue) && v.value <= lookupValue.value) {
+                bestIdx = r;
+            }
+            else if (scalarIsString(v) &&
+                scalarIsString(lookupValue) &&
+                v.value.toLowerCase() <= lookupValue.value.toLowerCase()) {
+                bestIdx = r;
+            }
+        }
+    }
+    return bestIdx >= 0 ? (0, _shared_1.getCell)(lookupArr, bestIdx, cols - 1) : values_1.ERRORS.NA;
+}
+function fnTRANSPOSE(args) {
+    if (!(0, values_1.isArray)(args[0])) {
+        const sv = (0, values_1.topLeft)(args[0]);
+        // Excel propagates errors through TRANSPOSE rather than burying them
+        // inside a 1×1 array — callers that then aggregate the result (e.g.
+        // `SUM(TRANSPOSE(#N/A))`) expect the error to surface. R8-P1 fix.
+        if (sv.kind === 4 /* RVKind.Error */) {
+            return sv;
+        }
+        return (0, values_1.rvArray)([[sv]]);
+    }
+    const arr = args[0];
+    const rows = arr.height;
+    const cols = arr.width;
+    const result = [];
+    for (let c = 0; c < cols; c++) {
+        const row = [];
+        for (let r = 0; r < rows; r++) {
+            row.push((0, _shared_1.getCell)(arr, r, c));
+        }
+        result.push(row);
+    }
+    return (0, values_1.rvArray)(result);
+}
+function fnAREAS(args) {
+    if (args.length === 0) {
+        return values_1.ERRORS.VALUE;
+    }
+    // Error in the argument propagates (Excel parity). A reference value
+    // counts as one area; the engine does not yet build multi-area
+    // references via `(A1, B1)` union syntax — when that lands, the arity
+    // should be `v.areas.length`, not a hardcoded 1.
+    const a = args[0];
+    if (a.kind === 4 /* RVKind.Error */) {
+        return a;
+    }
+    if (a.kind === 6 /* RVKind.Reference */) {
+        return (0, values_1.rvNumber)(a.areas.length);
+    }
+    return (0, values_1.rvNumber)(1);
+}