df-script 1.4.0 → 1.5.0

package/dist/columnExpressions/mixins/ComparisonExpr.js

@@ -2,388 +2,249 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ComparisonExpr = void 0;
 const ExprBase_1 = require("../ExprBase");
-const utils_1 = require("../../utils");
-function getCacheKey(val) {
-    if (val == null) {
-        return val;
-    }
-    if (val instanceof Date) {
-        return `d:${val.getTime()}`;
-    }
-    if (val instanceof Uint8Array) {
-        return `u:${val.toString()}`;
-    }
-    if (typeof val === "object" || typeof val === "function") {
-        return String(val);
-    }
-    return val;
-}
-const ComparisonExpr = (Base) => {
-    return class extends Base {
-        between(lower, upper, closed = "both") {
-            return (0, ExprBase_1.derive)(this, (vArray, columns) => {
-                const height = vArray.length;
-                const lResolved = this._resolve(lower, columns, height);
-                const uResolved = this._resolve(upper, columns, height);
-                const result = new Array(height);
-                const isLArray = (0, utils_1.isArrayOrTypedArray)(lResolved);
-                const isUArray = (0, utils_1.isArrayOrTypedArray)(uResolved);
-                for (let i = 0; i < height; i++) {
-                    const v = vArray[i];
-                    const l = isLArray ? lResolved[i] : lResolved;
-                    const u = isUArray ? uResolved[i] : uResolved;
-                    if (v == null || l == null || u == null) {
-                        result[i] = null;
-                    }
-                    else {
-                        const geLower = closed === "both" || closed === "left" ? v >= l : v > l;
-                        const leUpper = closed === "both" || closed === "right" ? v <= u : v < u;
-                        result[i] = geLower && leUpper;
-                    }
-                }
-                return result;
-            });
-        }
-        eq(val) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, val, (v, r) => v === r));
-        }
-        eq_missing(val) {
-            return (0, ExprBase_1.derive)(this, (vArray, columns) => {
-                const height = vArray.length;
-                const rResolved = this._resolve(val, columns, height);
-                const result = new Array(height);
-                if ((0, utils_1.isArrayOrTypedArray)(rResolved)) {
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        const r = rResolved[i];
-                        if (v == null && r == null)
-                            result[i] = true;
-                        else if (v == null || r == null)
-                            result[i] = false;
-                        else
-                            result[i] = v === r;
-                    }
-                }
-                else {
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        if (v == null && rResolved == null)
-                            result[i] = true;
-                        else if (v == null || rResolved == null)
-                            result[i] = false;
-                        else
-                            result[i] = v === rResolved;
-                    }
-                }
-                return result;
-            });
-        }
-        ge(val) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, val, (v, r) => v >= r));
-        }
-        gt(val) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, val, (v, r) => v > r));
-        }
-        has_nulls() {
-            return this._deriveAgg((v) => {
-                for (let i = 0; i < v.length; i++) {
-                    if (v[i] == null)
-                        return true;
-                }
-                return false;
-            });
-        }
-        is_close(other, options = {}) {
-            const { abs_tol = 1e-8, rel_tol = 1e-8, nans_equal = false } = options;
-            return (0, ExprBase_1.derive)(this, (vArray, columns) => {
-                const height = vArray.length;
-                const otherVal = this._resolve(other, columns, height);
-                const isOtherArray = (0, utils_1.isArrayOrTypedArray)(otherVal);
-                const result = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    const v = vArray[i];
-                    const o = isOtherArray ? otherVal[i] : otherVal;
-                    if (v == null || o == null) {
-                        result[i] = null;
-                    }
-                    else if (Number.isNaN(v) || Number.isNaN(o)) {
-                        if (nans_equal && Number.isNaN(v) && Number.isNaN(o)) {
-                            result[i] = true;
-                        }
-                        else {
-                            result[i] = false;
-                        }
-                    }
-                    else if (!Number.isFinite(v) || !Number.isFinite(o)) {
-                        result[i] = (v === o);
-                    }
-                    else {
-                        const absDiff = Math.abs(v - o);
-                        const threshold = Math.max(rel_tol * Math.max(Math.abs(v), Math.abs(o)), abs_tol);
-                        result[i] = absDiff <= threshold;
-                    }
-                }
-                return result;
-            });
-        }
-        is_duplicated() {
-            return (0, ExprBase_1.derive)(this, (vArray) => {
-                const height = vArray.length;
-                const counts = new Map();
-                const keys = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    const k = getCacheKey(vArray[i]);
-                    keys[i] = k;
-                    counts.set(k, (counts.get(k) || 0) + 1);
-                }
-                const result = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    result[i] = (counts.get(keys[i]) || 0) > 1;
-                }
-                return result;
-            });
-        }
-        is_empty(options = {}) {
-            const { ignoreNulls = false } = options;
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneUnary)((v) => {
-                if (typeof v === "string") {
-                    return v.length === 0;
-                }
-                if ((0, utils_1.isArrayOrTypedArray)(v)) {
-                    if (ignoreNulls) {
-                        const len = v.length;
-                        let nonNullCount = 0;
-                        for (let i = 0; i < len; i++) {
-                            if (v[i] != null) {
-                                nonNullCount++;
-                            }
-                        }
-                        return nonNullCount === 0;
-                    }
-                    return v.length === 0;
-                }
-                return null;
-            }));
-        }
-        is_finite() {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneUnary)(Number.isFinite));
-        }
-        is_first_distinct() {
-            return (0, ExprBase_1.derive)(this, (vArray) => {
-                const height = vArray.length;
-                const seen = new Set();
-                const result = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    const k = getCacheKey(vArray[i]);
-                    if (seen.has(k)) {
-                        result[i] = false;
-                    }
-                    else {
-                        seen.add(k);
-                        result[i] = true;
-                    }
-                }
-                return result;
-            });
-        }
-        is_in(values) {
-            return (0, ExprBase_1.derive)(this, (vArray, columns) => {
-                const height = vArray.length;
-                const result = new Array(height);
-                if (values && typeof values === 'object' && 'evaluate' in values) {
-                    const resolved = values.evaluate(columns, height);
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        if (v == null) {
-                            result[i] = null;
-                        }
-                        else {
-                            const candidates = resolved[i];
-                            const set = new Set();
-                            if ((0, utils_1.isArrayOrTypedArray)(candidates)) {
-                                const cLen = candidates.length;
-                                for (let j = 0; j < cLen; j++) {
-                                    set.add(getCacheKey(candidates[j]));
-                                }
-                            }
-                            else {
-                                set.add(getCacheKey(candidates));
-                            }
-                            result[i] = set.has(getCacheKey(v));
-                        }
+const utils_1 = require("../utils");
+const utils_2 = require("../../utils");
+function computeIsIn(vArray, columns, values, invert) {
+    const height = vArray.length;
+    const result = new Array(height);
+    if (values && typeof values === 'object' && 'evaluate' in values) {
+        const resolved = values.evaluate(columns, height);
+        for (let i = 0; i < height; i++) {
+            const v = vArray[i];
+            if (v == null) {
+                result[i] = null;
+            }
+            else {
+                const candidates = resolved[i];
+                const set = new Set();
+                if ((0, utils_2.isArrayOrTypedArray)(candidates)) {
+                    const cLen = candidates.length;
+                    for (let j = 0; j < cLen; j++) {
+                        set.add((0, utils_2.toCanonicalString)(candidates[j]));
                     }
                 }
                 else {
-                    const arr = (0, utils_1.isArrayOrTypedArray)(values) ? values : [];
-                    const set = new Set();
-                    const arrLen = arr.length;
-                    for (let j = 0; j < arrLen; j++) {
-                        set.add(getCacheKey(arr[j]));
-                    }
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        result[i] = v == null ? null : set.has(getCacheKey(v));
-                    }
-                }
-                return result;
-            });
-        }
-        is_infinite() {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneUnary)((v) => v === Infinity || v === -Infinity));
-        }
-        is_last_distinct() {
-            return (0, ExprBase_1.derive)(this, (vArray) => {
-                const height = vArray.length;
-                const seen = new Set();
-                const result = new Array(height);
-                for (let i = height - 1; i >= 0; i--) {
-                    const k = getCacheKey(vArray[i]);
-                    if (seen.has(k)) {
-                        result[i] = false;
-                    }
-                    else {
-                        seen.add(k);
-                        result[i] = true;
-                    }
-                }
-                return result;
-            });
-        }
-        is_n_distinct(n) {
-            return this._deriveAgg((v) => {
-                const set = new Set();
-                const len = v.length;
-                for (let i = 0; i < len; i++) {
-                    set.add(getCacheKey(v[i]));
-                }
-                return set.size === n;
-            });
-        }
-        is_nan() {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneUnary)(Number.isNaN));
-        }
-        is_not_nan() {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneUnary)((v) => !Number.isNaN(v)));
-        }
-        is_not_null() {
-            return (0, ExprBase_1.derive)(this, (vArray) => {
-                const height = vArray.length;
-                const result = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    result[i] = vArray[i] != null;
-                }
-                return result;
-            });
-        }
-        is_null() {
-            return (0, ExprBase_1.derive)(this, (vArray) => {
-                const height = vArray.length;
-                const result = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    result[i] = vArray[i] == null;
-                }
-                return result;
-            });
-        }
-        is_unique() {
-            return (0, ExprBase_1.derive)(this, (vArray) => {
-                const height = vArray.length;
-                const counts = new Map();
-                const keys = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    const k = getCacheKey(vArray[i]);
-                    keys[i] = k;
-                    counts.set(k, (counts.get(k) || 0) + 1);
+                    set.add((0, utils_2.toCanonicalString)(candidates));
                 }
-                const result = new Array(height);
-                for (let i = 0; i < height; i++) {
-                    result[i] = counts.get(keys[i]) === 1;
-                }
-                return result;
-            });
+                const hasVal = set.has((0, utils_2.toCanonicalString)(v));
+                result[i] = invert ? !hasVal : hasVal;
+            }
         }
-        le(val) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, val, (v, r) => v <= r));
+    }
+    else {
+        const arr = (0, utils_2.isArrayOrTypedArray)(values) ? values : [];
+        const set = new Set();
+        const arrLen = arr.length;
+        for (let j = 0; j < arrLen; j++) {
+            set.add((0, utils_2.toCanonicalString)(arr[j]));
+        }
+        for (let i = 0; i < height; i++) {
+            const v = vArray[i];
+            if (v == null) {
+                result[i] = null;
+            }
+            else {
+                const hasVal = set.has((0, utils_2.toCanonicalString)(v));
+                result[i] = invert ? !hasVal : hasVal;
+            }
         }
-        lt(val) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, val, (v, r) => v < r));
+    }
+    return result;
+}
+function evaluateDuplication(vArray, checkDuplicate) {
+    const { frequencies } = (0, utils_2.getUniqueListStats)(vArray, { strict: true });
+    const height = vArray.length;
+    const result = new Array(height);
+    for (let i = 0; i < height; i++) {
+        const count = frequencies.get(vArray[i]) || 0;
+        result[i] = checkDuplicate ? count > 1 : count === 1;
+    }
+    return result;
+}
+function compareMissing(vArray, rResolved, invert) {
+    const height = vArray.length;
+    const result = new Array(height);
+    if ((0, utils_2.isArrayOrTypedArray)(rResolved)) {
+        for (let i = 0; i < height; i++) {
+            const v = vArray[i];
+            const r = rResolved[i];
+            if (v == null && r == null) {
+                result[i] = !invert;
+            }
+            else if (v == null || r == null) {
+                result[i] = invert;
+            }
+            else {
+                result[i] = invert ? v !== r : v === r;
+            }
         }
-        ne(val) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, val, (v, r) => v !== r));
+    }
+    else {
+        for (let i = 0; i < height; i++) {
+            const v = vArray[i];
+            if (v == null && rResolved == null) {
+                result[i] = !invert;
+            }
+            else if (v == null || rResolved == null) {
+                result[i] = invert;
+            }
+            else {
+                result[i] = invert ? v !== rResolved : v === rResolved;
+            }
         }
-        ne_missing(val) {
-            return (0, ExprBase_1.derive)(this, (vArray, columns) => {
-                const height = vArray.length;
-                const rResolved = this._resolve(val, columns, height);
-                const result = new Array(height);
-                if ((0, utils_1.isArrayOrTypedArray)(rResolved)) {
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        const r = rResolved[i];
-                        if (v == null && r == null)
-                            result[i] = false;
-                        else if (v == null || r == null)
-                            result[i] = true;
-                        else
-                            result[i] = v !== r;
-                    }
+    }
+    return result;
+}
+class ComparisonExpr extends ExprBase_1.ExprBase {
+    between(lower, upper, closed = "both") {
+        return (0, ExprBase_1.derive)(this, (vArray, columns) => {
+            const height = vArray.length;
+            const lResolved = this._resolve(lower, columns, height);
+            const uResolved = this._resolve(upper, columns, height);
+            const result = new Array(height);
+            const isLArray = (0, utils_2.isArrayOrTypedArray)(lResolved);
+            const isUArray = (0, utils_2.isArrayOrTypedArray)(uResolved);
+            for (let i = 0; i < height; i++) {
+                const v = vArray[i];
+                const l = isLArray ? lResolved[i] : lResolved;
+                const u = isUArray ? uResolved[i] : uResolved;
+                if (v == null || l == null || u == null) {
+                    result[i] = null;
                 }
                 else {
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        if (v == null && rResolved == null)
-                            result[i] = false;
-                        else if (v == null || rResolved == null)
-                            result[i] = true;
-                        else
-                            result[i] = v !== rResolved;
-                    }
+                    const geLower = closed === "both" || closed === "left" ? v >= l : v > l;
+                    const leUpper = closed === "both" || closed === "right" ? v <= u : v < u;
+                    result[i] = geLower && leUpper;
                 }
-                return result;
-            });
-        }
-        not_in(values) {
-            return (0, ExprBase_1.derive)(this, (vArray, columns) => {
-                const height = vArray.length;
-                const result = new Array(height);
-                if (values && typeof values === 'object' && 'evaluate' in values) {
-                    const resolved = values.evaluate(columns, height);
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        if (v == null) {
-                            result[i] = null;
-                        }
-                        else {
-                            const candidates = resolved[i];
-                            const set = new Set();
-                            if ((0, utils_1.isArrayOrTypedArray)(candidates)) {
-                                const cLen = candidates.length;
-                                for (let j = 0; j < cLen; j++) {
-                                    set.add(getCacheKey(candidates[j]));
-                                }
-                            }
-                            else {
-                                set.add(getCacheKey(candidates));
-                            }
-                            result[i] = !set.has(getCacheKey(v));
-                        }
-                    }
+            }
+            return result;
+        });
+    }
+    eq(val) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v === r));
+    }
+    eq_missing(val) {
+        return (0, ExprBase_1.derive)(this, (vArray, columns) => {
+            const rResolved = this._resolve(val, columns, vArray.length);
+            return compareMissing(vArray, rResolved, false);
+        });
+    }
+    ge(val) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v >= r));
+    }
+    gt(val) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v > r));
+    }
+    has_nulls() {
+        return this._deriveAgg((v) => {
+            for (let i = 0; i < v.length; i++) {
+                if (v[i] == null)
+                    return true;
+            }
+            return false;
+        });
+    }
+    is_close(other, { abs_tol = 1e-8, rel_tol = 1e-8, nans_equal = false } = {}) {
+        return (0, ExprBase_1.derive)(this, (vArray, columns) => {
+            const height = vArray.length;
+            const otherVal = this._resolve(other, columns, height);
+            const isOtherArray = (0, utils_2.isArrayOrTypedArray)(otherVal);
+            const result = new Array(height);
+            for (let i = 0; i < height; i++) {
+                const v = vArray[i];
+                const o = isOtherArray ? otherVal[i] : otherVal;
+                if (v == null || o == null) {
+                    result[i] = null;
+                }
+                else if ((0, utils_2.isValidNumber)(v) && (0, utils_2.isValidNumber)(o)) {
+                    const absDiff = Math.abs(v - o);
+                    const threshold = Math.max(rel_tol * Math.max(Math.abs(v), Math.abs(o)), abs_tol);
+                    result[i] = absDiff <= threshold;
+                }
+                else if (Number.isNaN(v) && Number.isNaN(o)) {
+                    result[i] = nans_equal;
                 }
                 else {
-                    const arr = (0, utils_1.isArrayOrTypedArray)(values) ? values : [];
-                    const set = new Set();
-                    const arrLen = arr.length;
-                    for (let j = 0; j < arrLen; j++) {
-                        set.add(getCacheKey(arr[j]));
-                    }
-                    for (let i = 0; i < height; i++) {
-                        const v = vArray[i];
-                        result[i] = v == null ? null : !set.has(getCacheKey(v));
-                    }
+                    result[i] = (v === o);
                 }
-                return result;
-            });
-        }
-    };
-};
+            }
+            return result;
+        });
+    }
+    is_duplicated() {
+        return (0, ExprBase_1.derive)(this, (vArray) => evaluateDuplication(vArray, true));
+    }
+    is_empty({ ignoreNulls = false } = {}) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => {
+            if (typeof v === "string") {
+                return v.length === 0;
+            }
+            if ((0, utils_2.isArrayOrTypedArray)(v)) {
+                if (ignoreNulls) {
+                    return (0, utils_2.isArrayOfType)(v, "nullish", {
+                        mode: "every"
+                    });
+                }
+                return v.length === 0;
+            }
+            return null;
+        }));
+    }
+    is_finite() {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Number.isFinite));
+    }
+    is_in(values) {
+        return (0, ExprBase_1.derive)(this, (vArray, columns) => computeIsIn(vArray, columns, values, false));
+    }
+    is_infinite() {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v === Infinity || v === -Infinity));
+    }
+    is_nan() {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Number.isNaN));
+    }
+    is_not_nan() {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => !Number.isNaN(v)));
+    }
+    is_not_null() {
+        return (0, ExprBase_1.derive)(this, (vArray) => {
+            const height = vArray.length;
+            const result = new Array(height);
+            for (let i = 0; i < height; i++) {
+                result[i] = vArray[i] != null;
+            }
+            return result;
+        });
+    }
+    is_null() {
+        return (0, ExprBase_1.derive)(this, (vArray) => {
+            const height = vArray.length;
+            const result = new Array(height);
+            for (let i = 0; i < height; i++) {
+                result[i] = vArray[i] == null;
+            }
+            return result;
+        });
+    }
+    is_unique() {
+        return (0, ExprBase_1.derive)(this, (vArray) => evaluateDuplication(vArray, false));
+    }
+    le(val) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v <= r));
+    }
+    lt(val) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v < r));
+    }
+    ne(val) {
+        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v !== r));
+    }
+    ne_missing(val) {
+        return (0, ExprBase_1.derive)(this, (vArray, columns) => {
+            const rResolved = this._resolve(val, columns, vArray.length);
+            return compareMissing(vArray, rResolved, true);
+        });
+    }
+    not_in(values) {
+        return (0, ExprBase_1.derive)(this, (vArray, columns) => computeIsIn(vArray, columns, values, true));
+    }
+}
 exports.ComparisonExpr = ComparisonExpr;