df-script 1.5.0 → 1.7.0

package/dist/columnExpressions/mixins/AggregationExpr.js

@@ -1,76 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.AggregationExpr = void 0;
-const ExprBase_1 = require("../ExprBase");
-const exceptions_1 = require("../../exceptions");
-const utils_1 = require("../../utils");
-class AggregationExpr extends ExprBase_1.ExprBase {
-    _deriveAgg(fn) {
-        const newInst = (0, ExprBase_1.derive)(this);
-        newInst.aggFn = fn;
-        newInst.groupingOpsIndex = this.ops.length;
-        newInst.partitionOpsIndex = this.ops.length;
-        return newInst;
-    }
-    all() {
-        return this._deriveAgg(v => (0, utils_1.isArrayOfType)(v, (x) => !!x, { mode: "every" }));
-    }
-    all_null() {
-        return this._deriveAgg(v => (0, utils_1.isArrayOfType)(v, "nullish", { mode: "every" }));
-    }
-    any() {
-        return this._deriveAgg(v => (0, utils_1.isArrayOfType)(v, (x) => !!x, { mode: "some" }));
-    }
-    any_null() {
-        return this._deriveAgg(v => (0, utils_1.isArrayOfType)(v, "nullish", { mode: "some" }));
-    }
-    avg() {
-        return this._deriveAgg(v => (0, utils_1.getListStats)(v).mean);
-    }
-    count(options = {}) {
-        if (options.includeNulls)
-            return this._deriveAgg(v => v.length);
-        return this._deriveAgg(v => (0, utils_1.getListStats)(v).count);
-    }
-    first() {
-        return this._deriveAgg(v => v[0] ?? null);
-    }
-    implode() {
-        return this._deriveAgg(v => v);
-    }
-    last() {
-        return this._deriveAgg(v => v[v.length - 1] ?? null);
-    }
-    max() {
-        return this._deriveAgg(v => (0, utils_1.getListStats)(v).max);
-    }
-    mean() {
-        return this.avg();
-    }
-    median() {
-        return this._deriveAgg(v => (0, utils_1.computeMedian)(v));
-    }
-    min() {
-        return this._deriveAgg(v => (0, utils_1.getListStats)(v).min);
-    }
-    mode() {
-        return this._deriveAgg(v => (0, utils_1.computeMode)(v));
-    }
-    n_unique(options = {}) {
-        return this._deriveAgg(v => {
-            return (0, utils_1.getUniqueListStats)(v, options).count;
-        });
-    }
-    quantile(q) {
-        if (q < 0 || q > 1)
-            throw new exceptions_1.ComputeError("Quantile q must be between 0 and 1");
-        return this._deriveAgg(v => (0, utils_1.computeQuantile)(v, q));
-    }
-    std() {
-        return this._deriveAgg(v => (0, utils_1.getListStats)(v).std);
-    }
-    sum() {
-        return this._deriveAgg(v => (0, utils_1.getListStats)(v).sum);
-    }
-}
-exports.AggregationExpr = AggregationExpr;

package/dist/columnExpressions/mixins/ArithmeticExpr.js

@@ -1,131 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ArithmeticExpr = void 0;
-const ExprBase_1 = require("../ExprBase");
-const utils_1 = require("../utils");
-const utils_2 = require("../../utils");
-class ArithmeticExpr extends ExprBase_1.ExprBase {
-    abs() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => Math.abs(v)));
-    }
-    acos() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => (v < -1 || v > 1) ? null : Math.acos(v)));
-    }
-    acosh() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v < 1 ? null : Math.acosh(v)));
-    }
-    add(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v + r));
-    }
-    asin() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => (v < -1 || v > 1) ? null : Math.asin(v)));
-    }
-    asinh() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.asinh));
-    }
-    atan() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.atan));
-    }
-    atanh() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => (v <= -1 || v >= 1) ? null : Math.atanh(v)));
-    }
-    cbrt() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.cbrt));
-    }
-    ceil() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.ceil));
-    }
-    clip(lower = null, upper = null) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => (0, utils_2.clamp)(v, { min: lower, max: upper })));
-    }
-    cos() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.cos));
-    }
-    cosh() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.cosh));
-    }
-    degrees() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v * (180 / Math.PI)));
-    }
-    div(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => r === 0 ? null : v / r));
-    }
-    exp() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.exp));
-    }
-    expm1() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.expm1));
-    }
-    floor() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.floor));
-    }
-    floordiv(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => r === 0 ? null : Math.floor(v / r)));
-    }
-    hypot(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => Math.hypot(v, r)));
-    }
-    log(base = Math.E) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v <= 0 ? null : (base === Math.E ? Math.log(v) : Math.log(v) / Math.log(base))));
-    }
-    log1p() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v <= -1 ? null : Math.log1p(v)));
-    }
-    mod(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => r === 0 ? null : v % r));
-    }
-    mul(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v * r));
-    }
-    negate() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => -v));
-    }
-    pow(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => Math.pow(v, r)));
-    }
-    radians() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v * (Math.PI / 180)));
-    }
-    rand(seed, { min = 0, max = 1, integer = false } = {}) {
-        return (0, ExprBase_1.derive)(this, (vArray) => {
-            const len = vArray.length;
-            const out = new Float64Array(len);
-            const rnd = seed !== undefined ? (0, utils_2.mulberry32)(seed) : Math.random;
-            const range = max - min;
-            for (let i = 0; i < len; i++) {
-                const raw = rnd();
-                out[i] = integer ? Math.floor(raw * (range + 1)) + min : raw * range + min;
-            }
-            return out;
-        });
-    }
-    round(decimals = 0) {
-        const factor = Math.pow(10, decimals);
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => Math.round(v * factor) / factor));
-    }
-    sign() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.sign));
-    }
-    sin() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.sin));
-    }
-    sinh() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.sinh));
-    }
-    sqrt() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)((v) => v < 0 ? null : Math.sqrt(v)));
-    }
-    sub(val) {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneBinary)(this, val, (v, r) => v - r));
-    }
-    tan() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.tan));
-    }
-    tanh() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.tanh));
-    }
-    trunc() {
-        return (0, ExprBase_1.derive)(this, (0, utils_1.kleeneUnary)(Math.trunc));
-    }
-}
-exports.ArithmeticExpr = ArithmeticExpr;

package/dist/columnExpressions/mixins/BooleanExpr.d.ts

@@ -1,40 +0,0 @@
-import type { ExprConstructor } from "../types";
-export declare const BooleanExpr: <TBase extends ExprConstructor>(Base: TBase) => {
-    new (...args: any[]): {
-        and(other: any): /*elided*/ any;
-        not(): /*elided*/ any;
-        or(other: any): /*elided*/ any;
-        xor(other: any): /*elided*/ any;
-        all(): /*elided*/ any;
-        all_null(): /*elided*/ any;
-        any(): /*elided*/ any;
-        any_null(): /*elided*/ any;
-        ops: import("../..").OpFn[];
-        colName?: string;
-        outputName?: string;
-        isLiteral?: boolean;
-        literalValue?: any;
-        aggFn?: import("../..").AggFn<any> | null;
-        groupingOpsIndex?: number;
-        partitionOpsIndex?: number;
-        partitionBy?: (string | import("../..").IExpr)[] | null;
-        windowOp?: {
-            type: string;
-            [key: string]: any;
-        } | null;
-        isWindow?: boolean;
-        alias(name: string): /*elided*/ any;
-        cast(dataType: import("../..").RegisteredDataType): /*elided*/ any;
-        _resolve(val: any, columns: import("../..").ColumnDict, height: number): import("../..").ColumnData | any;
-        evaluate(columns: import("../..").ColumnDict, height: number): import("../..").ColumnData;
-        evaluatePreGrouping(columns: import("../..").ColumnDict, height: number): import("../..").ColumnData;
-        evaluatePostGrouping(aggregatedArray: any[], columns: import("../..").ColumnDict): import("../..").ColumnData;
-        evaluatePrePartition(columns: import("../..").ColumnDict, height: number): import("../..").ColumnData;
-        evaluatePostPartition(aggregatedArray: any[], columns: import("../..").ColumnDict): import("../..").ColumnData;
-        evaluateWindow?(groupPreValues: any[], partitionIndices: number[], currentIndex: number): any;
-        debug(label?: string): /*elided*/ any;
-        _window(evaluateWindow: (this: import("../..").IExpr, groupPreValues: any[], partitionIndices: number[], currentIndex: number) => any): /*elided*/ any;
-        _rolling(windowSize: number, aggFn: (vals: any[]) => any): /*elided*/ any;
-        _deriveAgg(fn: import("../..").AggFn<any>): /*elided*/ any;
-    };
-} & TBase;

package/dist/columnExpressions/mixins/BooleanExpr.js

@@ -1,67 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.BooleanExpr = void 0;
-const ExprBase_1 = require("../ExprBase");
-const utils_1 = require("../../utils");
-const BooleanExpr = (Base) => {
-    return class extends Base {
-        and(other) {
-            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 w = isOtherArray ? otherVal[i] : otherVal;
-                    if (v === false || w === false)
-                        result[i] = false;
-                    else if (v == null || w == null)
-                        result[i] = null;
-                    else
-                        result[i] = true;
-                }
-                return result;
-            });
-        }
-        not() {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneUnary)((v) => !v));
-        }
-        or(other) {
-            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 w = isOtherArray ? otherVal[i] : otherVal;
-                    if (v === true || w === true)
-                        result[i] = true;
-                    else if (v == null || w == null)
-                        result[i] = null;
-                    else
-                        result[i] = false;
-                }
-                return result;
-            });
-        }
-        xor(other) {
-            return (0, ExprBase_1.derive)(this, (0, ExprBase_1.kleeneBinary)(this, other, (v, w) => !!v !== !!w));
-        }
-        // Boolean Aggregations
-        all() {
-            return this._deriveAgg((v) => (0, utils_1.isArrayOfType)(v, (x) => !!x, { mode: "every" }));
-        }
-        all_null() {
-            return this._deriveAgg((v) => (0, utils_1.isArrayOfType)(v, "nullish", { mode: "every" }));
-        }
-        any() {
-            return this._deriveAgg((v) => (0, utils_1.isArrayOfType)(v, (x) => !!x, { mode: "some" }));
-        }
-        any_null() {
-            return this._deriveAgg((v) => (0, utils_1.isArrayOfType)(v, "nullish", { mode: "some" }));
-        }
-    };
-};
-exports.BooleanExpr = BooleanExpr;

package/dist/columnExpressions/mixins/ComparisonExpr.js

@@ -1,250 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.ComparisonExpr = void 0;
-const ExprBase_1 = require("../ExprBase");
-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 {
-                    set.add((0, utils_2.toCanonicalString)(candidates));
-                }
-                const hasVal = set.has((0, utils_2.toCanonicalString)(v));
-                result[i] = invert ? !hasVal : hasVal;
-            }
-        }
-    }
-    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;
-            }
-        }
-    }
-    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;
-            }
-        }
-    }
-    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;
-            }
-        }
-    }
-    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 {
-                    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, 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 {
-                    result[i] = (v === o);
-                }
-            }
-            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;

package/dist/columnExpressions/mixins/ListExpr.d.ts

@@ -1,39 +0,0 @@
-import { ExprBase } from "../ExprBase";
-import { StepSliceListOptions } from "../../utils";
-import type { UniqueListStatsOptions, JoinListOptions, ExplodeOptions, IExpr } from "../../types";
-export declare class ListExprNamespace {
-    expr: any;
-    constructor(expr: any);
-    _deriveList(fn: (arr: any[] | ArrayBufferView) => any): any;
-    all(): any;
-    any(): any;
-    contains(item: any): any;
-    contains_all(items: ArrayLike<any>): any;
-    contains_any(items: ArrayLike<any>): any;
-    count_matches(item: any): any;
-    drop_nulls(): any;
-    explode({ empty_as_null, keep_nulls }?: ExplodeOptions): any;
-    first(null_on_oob?: boolean): any;
-    gather(indices: number | ArrayLike<number>, null_on_oob?: boolean): any;
-    gather_every(options?: StepSliceListOptions): any;
-    get(index: number, null_on_oob?: boolean): any;
-    join(separator?: string, options?: JoinListOptions): any;
-    last(null_on_oob?: boolean): any;
-    len(): any;
-    lengths(): any;
-    max(): any;
-    mean(): any;
-    median(): any;
-    min(): any;
-    mode(): any;
-    n_unique(options?: UniqueListStatsOptions): any;
-    reverse(): any;
-    slice(offset: number, length?: number): any;
-    sort(descending?: boolean): any;
-    sum(): any;
-    unique(options?: UniqueListStatsOptions): any;
-    eval(expr: IExpr): any;
-}
-export declare class ListExpr extends ExprBase {
-    get list(): ListExprNamespace;
-}