The slice of the chart a link group drives. Chart satisfies it; declaring it structurally keeps the group testable against a stub, which is the only practical way to prove the feedback guard (the engine's own programmatic setters do not echo today, and the guard exists for the day they do and for the host callbacks that echo right now).

interface LinkChart {
    dataLayer: LinkDataLayer;
    isDestroyed?: boolean;
    addPrimitive(primitive: IPrimitive, paneIndex?: number): void;
    getVisibleLogicalRange(): LogicalRange;
    on(event: string, cb: (payload: unknown) => void): () => void;
    panes(): readonly unknown[];
    removePrimitive(primitive: IPrimitive): void;
    setVisibleLogicalRange(range: LogicalRange): void;
}

Properties

dataLayer: LinkDataLayer
isDestroyed?: boolean

Set by Chart. Optional so the group stays testable against a stub and usable by a host wrapping something that is not a Chart, but when it is there it is the answer: an empty pane list is only ever an inference.

Methods

  • Parameters

    • event: string
    • cb: (payload: unknown) => void

    Returns () => void

  • Only the count is read: the fallback destruction probe. See alive.

    Returns readonly unknown[]