AutoMovie API
    Preparing search index...

    What the search is given.

    interface IProps<T> {
        arcs: readonly IAutoMovieSwivelArcs.IArc[];
        better: (a: T, b: T) => boolean;
        bounded?: {
            below: (low: number, high: number) => number;
            key: (candidate: T) => number | null;
        };
        probe: (swivel: number) => T;
        refine: (probe: (swivel: number) => T, swivel: number) => T;
    }

    Type Parameters

    • T
    Index
    arcs: readonly IAutoMovieSwivelArcs.IArc[]

    The arcs searched, degrees, in the order ties are resolved in; an arc a full turn wide or wider is the whole circle.

    better: (a: T, b: T) => boolean

    Whether the first candidate is strictly ahead of the second (hingedSwivelAhead).

    bounded?: {
        below: (low: number, high: number) => number;
        key: (candidate: T) => number | null;
    }

    Branch and bound over the arcs (Land and Doig 1960): below is a certified lower bound of key over every candidate at a swivel from low to high degrees, and key the number a candidate is ranked by among those that can be chosen, or null for a candidate no bound may be compared with (an illegal one). Arcs are then visited in the order of their bounds and the visit ends at the first whose bound exceeds the least key read; absent, every arc is visited.

    probe: (swivel: number) => T

    The actual scorer at a swivel, degrees; periodic over a turn.

    refine: (probe: (swivel: number) => T, swivel: number) => T

    The refinement of the two-step bracket about a swivel, degrees, with a scorer (refineHingedSwivel at the articulation's pass count).