@dallaylaen/ski-interpreter
    Preparing search index...

    Type Alias SearchOptionsExperimental

    Look for an expression that matches the predicate, starting with the seed and applying the terms to one another.

       A predicate returning 0 (or nothing) means "keep looking",
   a positive number stands for "found",
   and a negative means "discard this term from further applications".

   The order of search is from shortest to longest expressions.

    maximum generation to search for

    maximum number of tries before giving up

    whether to call infer(), default true.

    arguments in infer()

    step limit in infer()

    prevents skipping equivalent terms. Always true if infer is false.

    if true. also add the whole cache to returned value

    minimum number of tries between calls to options.progress, default 1000.

    type SearchOptions = {
        depth?: number;
        infer?: boolean;
        max?: number;
        maxArgs?: number;
        noskip?: boolean;
        progress?: (
            info: { gen: number; probed: number; step: boolean; total: number },
        ) => void;
        progressInterval?: number;
        retain?: boolean;
        tries?: number;
    }
    Index

    Properties

    depth? infer? max? maxArgs? noskip? progress? progressInterval? retain? tries?

    Properties

    depth?: number
    infer?: boolean
    max?: number
    maxArgs?: number
    noskip?: boolean
    progress?: (
        info: { gen: number; probed: number; step: boolean; total: number },
    ) => void
    progressInterval?: number
    retain?: boolean
    tries?: number

    Settings

    Member Visibility

    On This Page

    Properties