kui_core/runtime/

builder.rs

//! The frame builder: what a view calls between `begin_frame` and
//! `finish_frame` to declare the tree — open, close, text, editors,
//! images — with each spec eased against its transitions and keyframes
//! as it is opened, and the hover / press queries a view styles by.

use super::*;

use crate::schema::{Identity, PropsOut};
use crate::slots::one;

/// What a node opened through [`Core::open_from`] holds: a box (left open
/// for its children), a fragment (likewise), a `cells` grid or a stroke
/// (leaves, closed by the door).
pub enum Content<'a> {
    Box,
    /// A fragment: the function (and its image, if any) and the params.
    Fragment(crate::fragment::FragmentRef, &'a [f32]),
    Cells(&'a crate::cells::CellGrid<'a>),
    Line(&'a [Vec2], Stroke),
    /// A filled polygon; the fill is the spec's `bg`.
    Polygon(&'a [Vec2]),
    /// A path: its ops, the fill rule, and a stroke if it has one. The
    /// fill is the spec's `bg`.
    Path(
        &'a [crate::path::PathOp],
        crate::path::FillRule,
        Option<Stroke>,
        Option<crate::path::Turn>,
    ),
    /// The same from a `d` string, parsed here by the one parser; one
    /// that does not parse raises `path-malformed` under the node's key.
    PathD(
        &'a str,
        crate::path::FillRule,
        Option<Stroke>,
        Option<crate::path::Turn>,
    ),
    /// The same from the flat op form (`Path::to_floats`), read here; one
    /// that is not the form raises `path-malformed` under the node's key
    /// as a `d` that does not parse does.
    PathFlat(
        &'a [f32],
        crate::path::FillRule,
        Option<Stroke>,
        Option<crate::path::Turn>,
    ),
}

/// Whether a transitioning node has a transform slot to ease: it declares
/// a turn or a scale, or its entrance or a stop names one (ADR 0043). Two
/// box checks for the node that does none of it.
#[inline]
fn turns(spec: &NodeSpec) -> bool {
    spec.interact
        .as_deref()
        .is_some_and(|i| i.transform.is_some())
        || spec.anim.as_deref().is_some_and(anim_turns)
}

/// [`turns`]'s half for the animation group, out of line: inlined, its
/// scan of the stops made `prepare_spec` too big to inline into
/// `open_content`, and every node paid the call (ADR 0043's amendment).
#[inline(never)]
fn anim_turns(a: &crate::spec::AnimSpec) -> bool {
    a.enter
        .is_some_and(|e| e.rotate.is_some() || e.scale.is_some())
        || a.keyframes
            .iter()
            .any(|k| k.rotate.is_some() || k.scale.is_some())
}

/// The transform slot's lanes a node declares: `[rotate, scale, 0, 0]`,
/// the identity for a node that declares none (ADR 0043).
#[inline]
fn transform_lanes(spec: &NodeSpec) -> [f32; 4] {
    let t = spec.transform_spec().unwrap_or_default();
    crate::geom::Transform::lanes(t.rotate, t.scale)
}

/// A node's keyframes flattened per slot for `ease_spec`, built once per
/// node per frame (only for nodes that declare keyframes).
struct Tracks {
    width: Option<Vec<(f32, [f32; 4])>>,
    height: Option<Vec<(f32, [f32; 4])>>,
    bg: Option<Vec<(f32, [f32; 4])>>,
    radius: Option<Vec<(f32, [f32; 4])>>,
    opacity: Option<Vec<(f32, [f32; 4])>>,
}

impl Tracks {
    fn of(spec: &NodeSpec) -> Self {
        let frames = &spec.anim().keyframes;
        let offsets = keyframes::offsets(frames);
        // Each slot's stops in lanes, the node's own value at the ends the
        // stops do not reach; a sizing with no amount (`fit`) has no track.
        let track = |slot: Slot, base: Option<[f32; 4]>| {
            keyframes::track(frames, &offsets, base?, |k| k.lanes(slot))
        };
        Tracks {
            width: track(Slot::Width, spec.layout.width.amount().map(one)),
            height: track(Slot::Height, spec.layout.height.amount().map(one)),
            bg: track(Slot::Bg, Some(spec.style.bg.lanes())),
            radius: track(Slot::Radius, Some(spec.style.radius)),
            opacity: track(Slot::Opacity, Some(one(spec.style.opacity))),
        }
    }

    fn get(&self, slot: Slot) -> Option<&Track> {
        match slot {
            Slot::Width => self.width.as_deref(),
            Slot::Height => self.height.as_deref(),
            Slot::Bg => self.bg.as_deref(),
            Slot::Radius => self.radius.as_deref(),
            Slot::Opacity => self.opacity.as_deref(),
            // Eased apart, in `ease_transform`.
            Slot::Transform => None,
            // Keyframing a shadow would need stops for four more numbers
            // and a color; a shadow tweens with `transition` and no more.
            Slot::Border | Slot::Pos | Slot::Shadow | Slot::ShadowColor => None,
        }
    }
}

impl Core {
    // -- Frame builder ------------------------------------------------------
    // Flat, non-panicking, callable through FFI. Misuse (close past the root,
    // building outside a frame) is ignored rather than UB or panic.

    /// Tags subsequently created nodes with an origin (set by the runner
    /// before handing the frame to an extension).
    pub fn set_origin(&mut self, origin: OriginId) {
        self.origin = origin;
    }

    /// Replaces the implicit root's spec (e.g. to make the top level a row).
    /// Root sizing is resolved against the viewport regardless.
    pub fn configure_root(&mut self, mut spec: NodeSpec) {
        if let Some(app) = self.dt_app {
            // The host's tree is wrapped for the devtools (ADR 0024,
            // decision 2): the spec is split between the two nodes.
            self.devtools_configure_root(app, spec);
            return;
        }
        if !self.tree.is_empty() {
            self.ease_spec(Key::ROOT, &mut spec);
            self.tree.note(&spec, &NodeContent::Container);
            self.tree.specs[0] = spec;
        }
    }

    /// Replaces a transitioning node's animatable values with this frame's
    /// eased ones. Nodes without a transition cost one branch — inlined at
    /// the call site, so it is a branch and not a call that returns.
    /// A slot the node's keyframes name is sampled from its cycle instead
    /// of tweened.
    #[inline]
    pub(super) fn ease_spec(&mut self, key: Key, spec: &mut NodeSpec) {
        if let Some(t) = spec.transition {
            // A turn the node starts declaring eases in from upright when
            // the node was already drawn: read before `ease_transitioning`
            // marks its other slots used this frame.
            let declares = turns(spec);
            let upright = declares && self.anim.turn_starts_upright(key);
            self.ease_transitioning(key, spec, t);
            // The turn and the scale (ADR 0043) are eased apart, after the
            // other slots and out of line, so `ease_transitioning` is the
            // code it was before ADR 0043 (a test for the turn inside it
            // measured about 2% on a frame of 10,000 transitioning boxes).
            // A turn the node stops declaring eases back to upright on the
            // tween it had.
            if declares || self.anim.turn_live(key) {
                self.ease_transform(key, spec, t, upright);
            }
        }
    }

    #[inline(never)]
    fn ease_transitioning(&mut self, key: Key, spec: &mut NodeSpec, t: crate::anim::Transition) {
        // One lookup for the whole node. Every slot below used to reach
        // `AnimStore` by key on its own, which was seven to nine hashes and
        // probes of the same entry per transitioning node, per frame.
        let mut anim = self.anim.node(key);
        let tracks = (!spec.anim().keyframes.is_empty()).then(|| Tracks::of(spec));
        let track = |slot: Slot| tracks.as_ref().and_then(|k| k.get(slot));
        let enter = spec.anim().enter.unwrap_or_default();
        let iterations = spec.anim().iterations;
        // Each slot: sampled from its track when keyframed, else tweened
        // toward its declared value from where the entrance says it starts.
        let mut ease = |slot: Slot, target: [f32; 4]| match track(slot) {
            Some(track) => anim.sample(track, t, iterations).unwrap_or(target),
            None => anim.drive(slot, enter.lanes(slot), target, t, true),
        };
        let mut sizing = |slot: Slot, s: Sizing| match s.amount() {
            Some(v) => s.with_amount(ease(slot, one(v))[0]),
            None => s,
        };
        spec.layout.width = sizing(Slot::Width, spec.layout.width);
        spec.layout.height = sizing(Slot::Height, spec.layout.height);
        let mut color = |slot: Slot, c: Color| Color::from_lanes(ease(slot, c.lanes()));
        spec.style.bg = color(Slot::Bg, spec.style.bg);
        spec.style.border_color = color(Slot::Border, spec.style.border_color);
        spec.style.shadow.color = color(Slot::ShadowColor, spec.style.shadow.color);
        let sh = spec.style.shadow;
        let geom = ease(Slot::Shadow, [sh.dx, sh.dy, sh.blur, sh.spread]);
        spec.style.shadow.dx = geom[0];
        spec.style.shadow.dy = geom[1];
        spec.style.shadow.blur = geom[2].max(0.0);
        spec.style.shadow.spread = geom[3];
        spec.style.opacity = ease(Slot::Opacity, one(spec.style.opacity))[0].clamp(0.0, 1.0);
        spec.style.radius = ease(Slot::Radius, spec.style.radius);
    }

    /// The transform slot of a transitioning node that turns
    /// ([`turns`]): sampled from its stops when they name `rotate` or
    /// `scale`, else tweened from where its entrance says. The eased
    /// lanes land on the spec's transform, allocated for an entrance or a
    /// cycle that turns a node declaring none.
    #[cold]
    #[inline(never)]
    fn ease_transform(
        &mut self,
        key: Key,
        spec: &mut NodeSpec,
        t: crate::anim::Transition,
        upright: bool,
    ) {
        let declared = spec.interact().transform.is_some();
        let base = transform_lanes(spec);
        let frames = &spec.anim().keyframes;
        // A stop's lanes are filled from the node's own transform, so a
        // stop naming only `rotate` keeps the scale.
        let track = if frames.is_empty() {
            None
        } else {
            keyframes::track(frames, &keyframes::offsets(frames), base, |k| {
                k.transform_lanes(base)
            })
        };
        let v = match track {
            Some(track) => self
                .anim
                .sample_cycle(key, &track, t, spec.anim().iterations)
                .unwrap_or(base),
            None => {
                // Already drawn upright, the turn eases in from there; a
                // node new this frame enters as its `enter` says.
                const UPRIGHT: [f32; 4] = [0.0, 1.0, 0.0, 0.0];
                let from = if upright {
                    Some(UPRIGHT)
                } else {
                    spec.anim().enter.and_then(|e| e.transform_lanes(base))
                };
                let v = self.anim.drive_turn(key, from, base, t);
                if !declared && v == UPRIGHT {
                    self.anim.forget_settled_turn(key, UPRIGHT);
                }
                v
            }
        };
        if declared || v != base {
            let tr = spec.transform_mut();
            tr.rotate = v[0];
            tr.scale = v[1];
        }
    }

    /// The root node's key — for hover/press queries or `set_key_focus` when
    /// the root itself declares the interaction (e.g. a root-level key sink).
    pub fn root_key(&self) -> Key {
        self.tree.keys.first().copied().unwrap_or(Key(0))
    }

    pub(crate) fn current(&self) -> u32 {
        self.stack.last().copied().unwrap_or(0)
    }

    /// The key a child of the current node is derived from: the node's own
    /// key, except inside a slot fill at the depth the fill began, where it
    /// is the fill's namespace (`Core::fill`). One
    /// compare on the auto-key path; `ns_depth` is `usize::MAX` outside a
    /// fill.
    #[inline]
    pub(crate) fn parent_key(&self) -> Key {
        if self.stack.len() == self.ns_depth {
            self.ns_key
        } else {
            // Outside a frame — or in the devtools' own window, where the
            // root is deferred (ADR 0024, decision 6) — there is no node
            // to derive from, and the open that follows is a no-op.
            self.tree
                .keys
                .get(self.current() as usize)
                .copied()
                .unwrap_or(Key::ROOT)
        }
    }

    #[inline]
    pub(crate) fn auto_key(&mut self) -> Key {
        let parent = self.parent_key();
        let i = self.counters.last().copied().unwrap_or(0);
        if let Some(c) = self.counters.last_mut() {
            *c += 1;
        }
        parent.index(i)
    }

    /// The key a child labeled `label` would get — usable before creating it,
    /// e.g. to check hover state for styling.
    pub fn child_key(&self, label: &str) -> Key {
        self.parent_key().str(label)
    }

    /// The key the `i`th child gets from auto-keying — what `open_indexed`
    /// opens with, usable before the node exists.
    pub fn child_key_indexed(&self, i: u64) -> Key {
        self.parent_key().index(i)
    }

    pub fn is_hovered(&self, key: Key) -> bool {
        let v = self.interaction.is_hovered(key);
        self.note_read(|| replay::Read::Hover(key, v));
        v
    }

    /// Whether files dragged in from the OS are over `key`.
    pub fn is_drop_target(&self, key: Key) -> bool {
        let v = self.interaction.is_drop_target(key);
        self.note_read(|| replay::Read::Drop(key, v));
        v
    }

    /// The zone the dragged files are over, if any — what a driver
    /// answers the OS with.
    pub fn drop_target(&self) -> Option<Key> {
        self.interaction.drop_target()
    }

    pub fn is_pressed(&self, key: Key) -> bool {
        let v = self.interaction.is_pressed(key);
        self.note_read(|| replay::Read::Pressed(key, v));
        v
    }

    /// Whether any member of hover group `group` (see
    /// `NodeSpec::hover_group`) is hovered.
    pub fn is_group_hovered(&self, group: u64) -> bool {
        let v = self.interaction.is_group_hovered(group);
        self.note_read(|| replay::Read::GroupHover(group, v));
        v
    }

    /// Whether hover group `group` is pressed (press started on a member,
    /// pointer still over one).
    pub fn is_group_pressed(&self, group: u64) -> bool {
        let v = self.interaction.is_group_pressed(group);
        self.note_read(|| replay::Read::GroupPressed(group, v));
        v
    }

    /// Events raised outside `handle_input`: the `resize` a changed
    /// viewport produced at `begin_frame`, and `on_hover` enter/leave
    /// caused by a finished frame changing what sits under a still cursor.
    /// Frame drivers route these after `finish_frame`; they also ride along
    /// with the next `handle_input` result, so a driver that never calls
    /// this merely sees them a little later.
    pub fn take_pending_events(&mut self) -> Vec<UiEvent> {
        let mut out = std::mem::take(&mut self.pending);
        out.append(&mut self.interaction.take_pending());
        self.devtools_consume(&mut out);
        self.devtools_translate(&mut out);
        self.stamp(&mut out);
        self.devtools_log(&out);
        out
    }

    /// Swaps in the hover / pressed / focus background the spec declares
    /// for the node's (or its group's) current state: pressed wins over
    /// keyboard-visible focus wins over hover. A disabled node keeps its
    /// plain `bg`. Runs before easing so a `transition` tweens between
    /// the states.
    #[inline]
    fn resolve_hover_style(&self, key: Key, spec: &mut NodeSpec) {
        // Runs for every node of every frame, and almost every node declares
        // none of this — so the early-out is one null check on the boxed
        // group rather than three `Option`s read out of the spec, and it is
        // inlined so the check is a branch rather than a call (C15).
        if spec.interact.is_some() {
            self.resolve_declared_hover_style(key, spec);
        }
    }

    #[inline(never)]
    fn resolve_declared_hover_style(&self, key: Key, spec: &mut NodeSpec) {
        let Some(interact) = spec.interact.as_deref() else {
            return;
        };
        let (hover_bg, pressed_bg, focus_bg, drop_bg, group) = (
            interact.hover_bg,
            interact.pressed_bg,
            interact.focus_bg,
            interact.drop_bg,
            interact.hover_group,
        );
        if spec.disabled
            || (hover_bg.is_none()
                && pressed_bg.is_none()
                && focus_bg.is_none()
                && drop_bg.is_none())
        {
            return;
        }
        // Dragged files over the zone win over every pointer state: a
        // press cannot be held while the OS holds a drag (ADR 0031,
        // decision 3).
        if let Some(c) = drop_bg
            && self.interaction.is_drop_target(key)
        {
            spec.style.bg = c;
            return;
        }
        let pressed = self.interaction.is_pressed(key)
            || group.is_some_and(|g| self.interaction.is_group_pressed(g));
        let hovered = pressed
            || self.interaction.is_hovered(key)
            || group.is_some_and(|g| self.interaction.is_group_hovered(g));
        let focused = self.focus_visible && self.focus == Some(key);
        if pressed && let Some(c) = pressed_bg {
            spec.style.bg = c;
        } else if focused && let Some(c) = focus_bg {
            spec.style.bg = c;
        } else if hovered && let Some(c) = hover_bg {
            spec.style.bg = c;
        }
    }

    /// Physical modifier state as of the last `InputEvent::Modifiers`.
    pub fn modifiers(&self) -> crate::input::KeyMods {
        let m = self.interaction.modifiers();
        self.note_read(|| replay::Read::Mods(m));
        m
    }

    /// Where the pointer is, in this window's logical viewport
    /// coordinates, as of the last `CursorMoved` — `None` once it has
    /// left the window. What a view that follows the pointer reads (the
    /// devtools' picker outlines the node under it); a control that wants
    /// to *react* to the pointer declares `hoverable` or `on_hover` and
    /// lets the core do the hit test.
    pub fn cursor(&self) -> Option<Vec2> {
        let p = self.interaction.cursor().map(|p| p.minus(self.dt_shift()));
        self.note_read(|| replay::Read::Cursor(p));
        p
    }

    // The open chain is inlined end to end (`Ui::open` → here →
    // `open_with_key` → `Tree::push`): a `NodeSpec` is 224 bytes and moved
    // by value at every step, and each step that is a real call is a copy
    // of all of them. Inlined, the spec the view built travels by pointer
    // and is copied once, into the tree (C15).
    #[inline]
    pub fn open(&mut self, spec: NodeSpec) -> Key {
        let key = self.auto_key();
        self.open_with_key(key, spec);
        key
    }

    #[inline]
    pub fn open_keyed(&mut self, label: &str, spec: NodeSpec) -> Key {
        let key = self.child_key(label);
        if self.tree.is_empty() {
            // No frame to open into (the same no-op as `open_with_key`),
            // and so no node for the label to name.
            return key;
        }
        self.open_with_key(key, spec);
        self.note_label(key, label);
        key
    }

    /// The inverse of [`Self::key_of`]: the label `key` was opened under
    /// — in the frame being built so far, else in the last one — or
    /// `None` for an auto-keyed node or a key no frame has declared. What
    /// a reader holding a key from an event or from `focus()` turns back
    /// into the name the view gave it.
    pub fn label_of(&self, key: Key) -> Option<&str> {
        self.key_labels
            .label_of(key)
            .or_else(|| self.key_labels_last.label_of(key))
    }

    /// The key of the node opened under the key label `label`
    /// (`open_keyed`; a `key` prop in JSX or a Lua table — not the `label`
    /// row, the accessible name, which [`Self::key_named`] reads) in the
    /// last finished frame — or, while
    /// a frame is being built, in it so far and then in the last one. The
    /// door for a caller that holds only strings: keys are hashes of the
    /// path from the root, and that path runs through auto-keyed
    /// ancestors nothing outside the build can spell, so "focus the node
    /// I just declared" is this and not `child_key`. None when no node
    /// declared the label. Labels are unique among siblings, not across a
    /// tree, so two nodes may share one under different parents. A guest
    /// asking from inside a fill is answered from the nodes that fill
    /// opened and no one else's — it cannot know what the host, another
    /// guest or its own other slots called theirs, and its env is a
    /// reading of its own view (F157); before its first fill has declared
    /// the label, nothing answers. The host, whose frame it is, from its
    /// own first and from everyone's when it opened none. Within that, the
    /// first in tree order wins and an `ambiguous-key` warning says so.
    pub fn key_of(&mut self, label: &str) -> Option<Key> {
        self.find_label(label, true)
    }

    /// The one label lookup: the first node in tree order
    /// opened under `label` in the frame being built, and — with
    /// `fall_back` and a build under way — in the last frame when this
    /// one has not declared it yet; an `ambiguous-key` warning when more
    /// than one did. `key_of` falls back; `resolve_regions` runs at the
    /// frame's end, when this frame's labels are the whole story.
    ///
    /// Asked from inside a fill, only the nodes that fill opened answer
    /// (backlog F157): one extension may fill many slots, each a view of
    /// its own, and a view that asks for its node before declaring it —
    /// at the top of its view, on its first frame — must get nothing, not
    /// the node a sibling fill of its origin declared under the same name.
    /// The host, outside any fill, asks as it always did.
    pub(crate) fn find_label(&mut self, label: &str, fall_back: bool) -> Option<Key> {
        let last_too = fall_back && self.building;
        let guest = self.origin != crate::tree::OriginId::HOST;
        let ask = |labels: &crate::key::LabelIndex| {
            if guest {
                labels.find_in_fill(label, self.origin, self.ns_key)
            } else {
                labels.find_for(label, self.origin)
            }
        };
        let (first, count) = {
            let mut hits = ask(&self.key_labels);
            if hits.0.is_none() && last_too {
                hits = ask(&self.key_labels_last);
            }
            (hits.0?, hits.1)
        };
        if count > 1 {
            self.diag
                .raise(crate::diag::ambiguous_key(label, first, count));
        }
        Some(first)
    }

    /// `open_keyed` in the sibling-index namespace: the key auto-keying
    /// would have given the `i`th child. A list that builds only rows
    /// 900..930 opens each with its *data* index, so row 900 keeps the key
    /// it has when the whole list is built — hover, focus, edit buffers and
    /// tweens follow the row instead of the slot it happens to occupy.
    #[inline]
    pub fn open_indexed(&mut self, i: u64, spec: NodeSpec) -> Key {
        let key = self.child_key_indexed(i);
        let at = self.tree.len() as u32;
        self.open_with_key(key, spec);
        // Remembered for the node that was actually pushed, so a selection
        // inside a virtual row can be ordered by the row's place in the
        // *data* when the row itself is not built (ADR 0017, tier 3).
        if self.tree.len() as u32 > at {
            self.tree.indexed.push((at, i));
            if self.keeping() {
                self.keep_op(replay::Op::Indexed(i));
            }
        }
        key
    }

    /// Declares how many indexed rows the *open* node's virtual list has,
    /// built or not (`rowCount`): what Select All inside a `selectable`
    /// virtual list spans, since the built rows are all the core can see.
    /// `widgets::uniform_list` and `widgets::list`
    /// call it on their container; a list composed by hand calls it
    /// inside the container's `with`. Nothing, outside any node.
    pub fn row_count(&mut self, n: u64) {
        if self.tree.is_empty() || self.stack.is_empty() {
            return;
        }
        let at = self.current();
        self.tree.row_counts.push((at, n));
        if self.keeping() {
            self.keep_op(replay::Op::RowCountOpen(n));
        }
    }

    /// Opens a node under a key the caller built; see `Ui::open_key`.
    #[inline]
    pub fn open_key(&mut self, key: Key, spec: NodeSpec) -> Key {
        self.open_with_key(key, spec);
        key
    }

    #[inline]
    pub(crate) fn open_with_key(&mut self, key: Key, spec: NodeSpec) {
        // The spec as declared, before hover, accent and easing touch
        // it (ADR 0045): a replay resolves those for its own frame.
        if self.keeping() {
            self.keep_op(replay::Op::Open {
                key,
                spec: Box::new(spec.clone()),
            });
        }
        self.open_content(key, spec, NodeContent::Container);
    }

    /// `open_with_key` with the node named `label` for `key_of`, the way
    /// `open_keyed` names its node — for a key the caller fixed rather
    /// than derived (a devtools tab's body).
    pub(crate) fn open_with_key_named(&mut self, key: Key, label: &str, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        self.open_with_key(key, spec);
        self.note_label(key, label);
    }

    /// `open_with_key` for a node that is a box in every way but what it
    /// paints: the caller supplies the content and closes the node. What
    /// the node asks of the frame is noted by `Tree::push`, the same for a
    /// box, a `fragment` and every leaf.
    fn open_content(&mut self, key: Key, mut spec: NodeSpec, content: NodeContent) {
        if self.tree.is_empty() {
            return;
        }
        self.prepare_spec(key, &mut spec);
        // `NodeSpec::tooltip`: the hint floats on this node's `close`, the
        // way a parsed `tooltip` prop's does. One pointer check for a node
        // that declares no access group.
        let tip = match spec.access.as_deref() {
            Some(a) if a.tooltip => a.description.clone(),
            _ => None,
        };
        let parent = self.current();
        let idx = self.tree.push(parent, key, self.origin, spec, content);
        self.stack.push(idx);
        self.counters.push(0);
        if let Some(tip) = tip {
            self.spec_hint(key, &tip);
        }
    }

    /// The hint of a node that declared [`NodeSpec::tooltip`], recorded
    /// only while it is hovered — `close` would drop it otherwise.
    #[cold]
    #[inline(never)]
    fn spec_hint(&mut self, key: Key, tip: &str) {
        if self.is_hovered(key) {
            self.hint(key, tip);
        }
    }

    /// Pushes a leaf — a node that is never left open for children: a
    /// `cells` grid, an editor, an image, a stroke, a fill, a path — under
    /// the current node. The one door every leaf goes through, so a leaf
    /// whose spec asks for its tooltip drawn (`AccessSpec::tooltip`) has it
    /// floated here once rather than by six doors. One pointer check for a
    /// leaf that declares no access group.
    #[inline]
    fn push_leaf(&mut self, key: Key, spec: NodeSpec, content: NodeContent) {
        let parent = self.current();
        let idx = self.tree.push(parent, key, self.origin, spec, content);
        // Read off the pushed spec rather than before the push, so nothing
        // is held across `Tree::push` on the path every leaf takes.
        if self.tree.specs[idx as usize]
            .access
            .as_deref()
            .is_some_and(|a| a.tooltip)
        {
            self.leaf_hint(key, idx);
        }
    }

    /// The hint of the leaf just pushed, floated while it is hovered: a
    /// leaf holds no children, so the hint cannot be its last child the
    /// way `close` floats a box's, and it floats beside the leaf anchored
    /// to it instead (`widgets::leaf_hint`, backlog RG113). The string is
    /// the leaf's description, which is what `apply_tooltip` set it to.
    #[cold]
    #[inline(never)]
    fn leaf_hint(&mut self, key: Key, idx: u32) {
        if !self.is_hovered(key) {
            return;
        }
        let Some(tip) = self
            .tree
            .specs
            .get(idx as usize)
            .and_then(|s| s.access.as_deref())
            .and_then(|a| a.description.clone())
        else {
            return;
        };
        self.pause_keeping();
        crate::widgets::leaf_hint(&mut Ui::wrap(self), key, &tip);
        self.resume_keeping();
    }

    /// What every node's spec goes through between the door and the tree,
    /// in this order — one pipeline for a box, a leaf, a stroke and a
    /// fill alike (AR16: five doors ran five subsets of it, and a wedge's
    /// `hover_bg` never painted). The one paint the environment decides
    /// (`accent`): the theme's accent, which is the OS's where the host
    /// reported one, the app's where it pinned one, and kui's otherwise;
    /// before the hover resolution, so a node that
    /// declares both still hovers to what it declared. Then the hover /
    /// pressed / focus background for the node's state, then the eased
    /// values a transition, entrance or keyframes put over the declared
    /// ones.
    #[inline]
    fn prepare_spec(&mut self, key: Key, spec: &mut NodeSpec) {
        if spec.accent && self.has_accent_raw() {
            spec.style.bg = self.theme.accent;
        }
        self.resolve_hover_style(key, spec);
        self.ease_spec(key, spec);
    }

    /// The layout of a node placed by its own geometry — a stroke, a fill:
    /// never in layout, a float at `rect` in the
    /// parent's box space sized exactly to it, the declared float's
    /// *anchor* kept and every sizing, clamp and scroll row overridden,
    /// since the box is the shape's own and not a size the view chose or
    /// a tween may lag.
    fn float_box_for(spec: &mut NodeSpec, rect: Rect) {
        let anchor = spec
            .layout
            .float
            .map_or(crate::spec::FloatAnchor::Parent, |f| f.anchor);
        spec.layout.float = Some(crate::spec::FloatConfig {
            anchor,
            offset: crate::spec::Vec2Offset {
                x: rect.x,
                y: rect.y,
            },
            // A stroke drawn in its parent's box is the parent's content,
            // so the parent's clip holds it as it holds a child (F78; ADR
            // 0010 decision 5, as amended by F90): the bit a declared float
            // opts into, set here for every stroke. A viewport-anchored
            // one escapes regardless (`FloatConfig::clipped_by_parent`).
            clip: true,
            ..crate::spec::FloatConfig::default()
        });
        spec.layout.width = Sizing::Fixed(rect.w);
        spec.layout.height = Sizing::Fixed(rect.h);
        spec.layout.min_w = crate::spec::Min::AUTO;
        spec.layout.max_w = f32::INFINITY;
        spec.layout.min_h = crate::spec::Min::AUTO;
        spec.layout.max_h = f32::INFINITY;
        spec.layout.clip = false;
        spec.layout.scroll_x = false;
        spec.layout.scroll_y = false;
    }

    #[inline]
    pub fn close(&mut self) {
        // The tooltip prop's third effect, for the node being closed: its
        // hint floats below it as its last child while it is hovered. One
        // length check per close for a frame that declared no hints.
        if let Some((depth, _, _)) = self.hints.last()
            && *depth == self.stack.len()
        {
            let (_, key, hint) = self.hints.pop().unwrap();
            if self.is_hovered(key) {
                // The core's own nodes, not the fill's (ADR 0045).
                self.pause_keeping();
                crate::widgets::hover_hint(&mut Ui::wrap(self), &hint);
                self.resume_keeping();
            }
        }
        if self.stack.len() > 1 {
            if self.keeping() {
                self.keep_op(replay::Op::Close);
            }
            self.stack.pop();
            self.counters.pop();
        }
    }

    /// Records the hover hint of the node just opened (the top of the
    /// stack): `close` floats `widgets::hover_hint` below it while it is
    /// hovered. The one place that decides *when* a tooltip shows, so a
    /// binding that parsed the string cannot show it some other way.
    pub fn hint(&mut self, key: Key, text: impl Into<String>) {
        let text = text.into();
        if self.keeping() {
            self.keep_op(replay::Op::Hint {
                key,
                text: text.as_str().into(),
            });
        }
        self.hints.push((self.stack.len(), key, text));
    }

    /// Names the node under `key` `label` for `key_of`: what every keyed
    /// door does after its push, and what a kept fill journals.
    pub(crate) fn note_label(&mut self, key: Key, label: &str) {
        self.key_labels.push(key, label, self.origin, self.ns_key);
        if self.keeping() {
            self.keep_op(replay::Op::Label {
                key,
                label: label.into(),
            });
        }
    }

    /// Opens a node the way a parsed prop list says — under the data
    /// index, the label or the next auto key; taking keyboard focus when
    /// `keyFocus` asked; floating its `tooltip` on `close` while hovered —
    /// with whatever the node holds. The one door for every binding that
    /// lowers props, so the identity match, the focus edge and the hint
    /// are not re-derived per binding per element (they were, eight, five
    /// and four times). A box or a fragment is left open for its children,
    /// and its hint floats as its last child on `close`; a `cells` grid, a
    /// `line`, a `polygon` and a `path` are leaves, and theirs floats
    /// beside the leaf, anchored to it (`PropsOut::for_leaf`, backlog
    /// RG113). Returns the key.
    pub fn open_from(&mut self, props: PropsOut, content: Content<'_>) -> Key {
        let leaf = !matches!(content, Content::Box | Content::Fragment(..));
        let props = if leaf { props.for_leaf() } else { props };
        let PropsOut {
            spec,
            key: label,
            index,
            row_count,
            key_focus,
            tooltip,
            ..
        } = props;
        let identity = match (index, &label) {
            (Some(i), _) => Identity::Index(i),
            (None, Some(label)) => Identity::Label(label),
            (None, None) => Identity::Auto,
        };
        let key = match identity {
            Identity::Auto => self.auto_key(),
            Identity::Label(l) => self.child_key(l),
            Identity::Index(i) => self.child_key_indexed(i),
        };
        let at = self.tree.len() as u32;
        match content {
            Content::Box => self.open_with_key(key, spec),
            Content::Fragment(frag, params) => self.fragment_with_key(key, frag, params, spec),
            Content::Cells(grid) => self.cells_at(key, grid, spec),
            Content::Line(points, stroke) => self.line_with_key(key, points, &stroke, spec),
            Content::Polygon(points) => self.polygon_with_key(key, points, spec),
            Content::Path(ops, rule, stroke, turn) => {
                self.path_with_key(key, ops, rule, stroke, turn, spec)
            }
            Content::PathD(d, rule, stroke, turn) => {
                self.path_node_d(key, d, rule, stroke, turn, spec)
            }
            Content::PathFlat(floats, rule, stroke, turn) => {
                self.path_node_flat(key, floats, rule, stroke, turn, spec)
            }
        }
        // Bookkeeping for the node that was actually pushed: the label
        // `key_of` resolves through, or the data index a selection inside
        // a virtual row is ordered by when the row is not built (ADR 0017).
        if self.tree.len() as u32 > at {
            match identity {
                Identity::Label(l) => self.note_label(key, l),
                Identity::Index(i) => {
                    self.tree.indexed.push((at, i));
                    if self.keeping() {
                        self.keep_op(replay::Op::Indexed(i));
                    }
                }
                Identity::Auto => {}
            }
            if let Some(n) = row_count {
                self.tree.row_counts.push((at, n));
                if self.keeping() {
                    self.keep_op(replay::Op::RowCount(n));
                }
            }
        }
        if key_focus {
            self.set_key_focus(Some(key));
        }
        // A leaf's hint was asked of its door by `for_leaf`, above.
        if let Some(hint) = tooltip
            && !leaf
        {
            self.hint(key, hint);
        }
        key
    }

    /// The root the way a parsed prop list says: its title, whether it
    /// wants the window on top, its keyboard secure, its Option keys as
    /// Alt or its input method off, the windows it declares, its spec, and
    /// keyboard focus on it when asked — what a binding's root op does,
    /// once.
    pub fn configure_root_from(&mut self, props: PropsOut) {
        if let Some(title) = &props.title {
            self.set_window_title(title);
        }
        if props.always_on_top {
            self.set_always_on_top(true);
        }
        if props.secure_input {
            self.set_secure_input(true);
        }
        if props.option_as_alt != crate::OptionAsAlt::None {
            self.set_option_as_alt(props.option_as_alt);
        }
        if props.ime_off {
            self.set_ime_off(true);
        }
        for (name, cfg) in &props.windows {
            self.declare_window(name, *cfg);
        }
        self.configure_root(props.spec);
        if props.key_focus {
            let root = self.root_key();
            self.set_key_focus(Some(root));
        }
    }

    pub fn text_node(&mut self, content: &str, style: TextStyle) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        if self.keeping() {
            self.keep_op(replay::Op::Text {
                key,
                content: content.into(),
                style,
            });
        }
        self.text_with_key(key, content, style);
    }

    /// [`Self::text_node`] under a key the caller derived.
    pub(crate) fn text_with_key(&mut self, key: Key, content: &str, style: TextStyle) {
        if self.tree.is_empty() {
            return;
        }
        // A style that named no colour takes the theme's foreground here,
        // at the one door text comes through, so the shaping cache, the
        // display list and every binding downstream see a real colour
        // (ADR 0019).
        let style = style.or_fg(self.theme.fg);
        let tid = {
            let sess = &mut *self.session.state();
            self.text
                .add(content, &style, &sess.resources, &mut sess.fonts)
        };
        let parent = self.current();
        self.tree.push(
            parent,
            key,
            self.origin,
            NodeSpec::default(),
            NodeContent::Text(tid),
        );
    }

    /// A cell grid as one leaf node, sized `cols × cell_w` by `rows ×
    /// cell_h`. `spec` is the node's:
    /// an `on_key` makes it the terminal's sink, an `on_click` / `on_drag`
    /// carry `cell: {row, col}` on their events.
    pub fn cells(&mut self, grid: &crate::cells::CellGrid<'_>, spec: NodeSpec) {
        let key = self.auto_key();
        self.cells_at(key, grid, spec);
    }

    /// [`Self::cells`] under a declared key.
    pub fn cells_keyed(&mut self, label: &str, grid: &crate::cells::CellGrid<'_>, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key(label);
        self.cells_at(key, grid, spec);
        // Like every other keyed door: the label after the node, so a
        // frame with no root records no name (AR16).
        self.note_label(key, label);
    }

    /// [`Self::cells`] under a data index; see [`Self::open_indexed`].
    pub fn cells_indexed(&mut self, i: u64, grid: &crate::cells::CellGrid<'_>, spec: NodeSpec) {
        let key = self.child_key_indexed(i);
        self.cells_at(key, grid, spec);
    }

    fn cells_at(&mut self, key: Key, grid: &crate::cells::CellGrid<'_>, mut spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        // The node's box is a box like any leaf's: its `hoverBg` lights
        // and its `transition` tweens the bg, the opacity, the size. The
        // cells inside it are a picture the app redraws, and nothing here
        // touches them (AR5).
        // A grid is a picture the app redraws, not a spec to journal.
        self.taint_kept("it drew a cells grid");
        self.prepare_spec(key, &mut spec);
        let cid = self.cells.add(key, grid);
        self.push_leaf(key, spec, NodeContent::Cells(cid));
    }

    /// An editable text node. State (buffer, cursor, selection) is retained
    /// by key across frames; edits arrive via `handle_input` and come back to
    /// the host as "changed"/"submit" events. Read with `edit_text`.
    pub fn text_edit(
        &mut self,
        label: &str,
        initial: &str,
        opts: &EditOptions,
        mut spec: NodeSpec,
    ) -> Key {
        if self.tree.is_empty() {
            return Key::ROOT;
        }
        let key = self.child_key(label);
        if self.keeping() {
            self.keep_op(replay::Op::Edit {
                label: label.into(),
                initial: initial.into(),
                opts: Box::new(opts.clone()),
                spec: Box::new(spec.clone()),
            });
        }
        self.prepare_spec(key, &mut spec);
        // The same stamp the two text funnels make: an editor that named
        // no text colour and no selection tint takes the theme's, so a
        // field and a label beside it agree on both (ADR 0019).
        let opts = &EditOptions {
            style: opts.style.or_fg(self.theme.fg),
            accent: Some(opts.accent.unwrap_or(self.theme.selection)),
            ..opts.clone()
        };
        let edge = {
            let origin = self.origin;
            let scale = self.scale;
            let sess = &mut *self.session.state();
            // A `set_edit_text` by label, held for the frame that would
            // declare the name (backlog F32): claimed here, where the
            // label and its key are both in hand, and before `declare`,
            // which is what turns it into this key's seed.
            self.edit
                .claim_label(key, label, &mut sess.fonts, &sess.resources);
            self.edit.declare(
                key,
                initial,
                opts,
                origin,
                scale,
                &mut sess.fonts,
                &sess.resources,
            )
        };
        // Autofocus takes the keyboard only while nothing holds it — never
        // from a control Tab landed on — and only on the frame the editor
        // starts being declared (`docs/adr/0022`, decision 9): asked every
        // frame, it would take focus straight back from every blur, and an
        // app with an autofocus field could never have nothing focused.
        if opts.autofocus && edge && self.focus.is_none() && !spec.disabled {
            self.move_focus(Some(key));
        }
        self.push_leaf(key, spec, NodeContent::Edit(key));
        // A leaf keyed by its label, like `open_keyed`: `key_of` must find
        // the editor an app wants to focus by name. Not journaled: the
        // `Edit` op names its label, and a replay comes back through here.
        self.key_labels.push(key, label, self.origin, self.ns_key);
        key
    }

    /// A registered image (see `Resources::add_image`). Fit sizing takes
    /// the image's pixel dimensions as logical px; a Fit height against a
    /// resolved width preserves the aspect ratio. `style.radius` rounds the
    /// corners. Linear sampling, stretched to the box: [`Self::image_node_with`]
    /// takes the two rows that say otherwise.
    pub fn image_node(&mut self, id: crate::resources::ImageId, spec: NodeSpec) {
        self.image_node_with(id, crate::resources::ImageOpts::default(), spec);
    }

    /// [`Self::image_node`] with its `sampling` and `fit` rows: how texels are
    /// read between pixels, and how the pixels
    /// meet a box of another aspect. The box — its layout, hit region and
    /// access rect — is the same in every mode.
    pub fn image_node_with(
        &mut self,
        id: crate::resources::ImageId,
        opts: crate::resources::ImageOpts,
        spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        if self.keeping() {
            self.keep_op(replay::Op::Image {
                key,
                id,
                opts,
                spec: Box::new(spec.clone()),
            });
        }
        self.image_with_key(key, id, opts, spec);
    }

    /// [`Self::image_node_with`] under a key the caller derived.
    pub(crate) fn image_with_key(
        &mut self,
        key: Key,
        id: crate::resources::ImageId,
        opts: crate::resources::ImageOpts,
        mut spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        self.prepare_spec(key, &mut spec);
        self.push_leaf(key, spec, NodeContent::Image(id, opts));
    }

    /// A box a registered WGSL function paints.
    ///
    /// An ordinary node in every other respect: it lays out where it is
    /// declared, sizes from `spec`, rounds by `radius`, clips, fades with
    /// its subtree's opacity, takes input like any box, and may hold
    /// children — which paint over it, so a gradient card is a `fragment`
    /// with a title and buttons inside it.
    ///
    /// It has **no intrinsic size**: unlike an image there is nothing to
    /// measure, so a fragment with no `width` / `height` / `fill` is zero
    /// by zero and draws nothing. Size it.
    ///
    /// `params` is up to sixteen numbers, positional, zero-padded, read by
    /// the shader as four `vec4<f32>`; more than sixteen are dropped with
    /// a `fragment-params-truncated` warning. A handle that is not live in
    /// this session draws nothing, as every resource kind does — and so
    /// does one whose `image` (`FragmentId::with_image`) is not, which is
    /// the removal order: the image goes, the fragment reading it draws
    /// the fallback, and the handle it kept is a `foreign-resource` miss
    /// like any other.
    pub fn fragment_node(
        &mut self,
        frag: impl Into<crate::fragment::FragmentRef>,
        params: &[f32],
        spec: NodeSpec,
    ) -> Key {
        let key = self.open_fragment(frag, params, spec);
        self.close();
        key
    }

    /// Opens a fragment as a parent: its children paint over it, which is
    /// what a gradient card with a title and buttons in it is. Balance it
    /// with [`Self::close`], or use `Ui::fragment_with`.
    pub fn open_fragment(
        &mut self,
        frag: impl Into<crate::fragment::FragmentRef>,
        params: &[f32],
        spec: NodeSpec,
    ) -> Key {
        if self.tree.is_empty() {
            return Key::ROOT;
        }
        let key = self.auto_key();
        self.fragment_with_key(key, frag.into(), params, spec);
        key
    }

    /// [`Self::fragment_node`] under a label key, for a fragment that
    /// transitions or exits and needs a stable identity across frames.
    pub fn fragment_node_keyed(
        &mut self,
        label: &str,
        frag: impl Into<crate::fragment::FragmentRef>,
        params: &[f32],
        spec: NodeSpec,
    ) -> Key {
        let key = self.open_fragment_keyed(label, frag, params, spec);
        self.close();
        key
    }

    /// [`Self::open_fragment`] under a label key.
    pub fn open_fragment_keyed(
        &mut self,
        label: &str,
        frag: impl Into<crate::fragment::FragmentRef>,
        params: &[f32],
        spec: NodeSpec,
    ) -> Key {
        if self.tree.is_empty() {
            return Key::ROOT;
        }
        let key = self.child_key(label);
        self.fragment_with_key(key, frag.into(), params, spec);
        self.note_label(key, label);
        key
    }

    /// [`Self::open_fragment`] under a data index; see [`Self::open_indexed`].
    pub fn open_fragment_indexed(
        &mut self,
        i: u64,
        frag: impl Into<crate::fragment::FragmentRef>,
        params: &[f32],
        spec: NodeSpec,
    ) -> Key {
        if self.tree.is_empty() {
            return Key::ROOT;
        }
        let key = self.child_key_indexed(i);
        self.fragment_with_key(key, frag.into(), params, spec);
        key
    }

    pub(crate) fn fragment_with_key(
        &mut self,
        key: Key,
        frag: crate::fragment::FragmentRef,
        params: &[f32],
        spec: NodeSpec,
    ) {
        if self.keeping() {
            self.keep_op(replay::Op::Fragment {
                key,
                frag,
                params: params.to_vec(),
                spec: Box::new(spec.clone()),
            });
        }
        let (params, dropped) = crate::fragment::params_of(params);
        if dropped > 0 {
            self.diag.raise(Warning {
                code: crate::diag::FRAGMENT_PARAMS_TRUNCATED,
                key,
                message: format!(
                    "a fragment takes sixteen params and {} were declared, so the last {dropped}                      were dropped; pack what the shader needs into the sixteen it has",
                    params.len() + dropped
                ),
            });
        }
        let draw = self.fragments.push(crate::fragment::Draw {
            id: frag.id,
            image: frag.image,
            params,
        });
        self.open_content(key, spec, NodeContent::Fragment(draw));
    }

    /// A stroke through `points` in the parent's box space: one round-capped
    /// segment for two points, a polyline for more, a smooth curve through
    /// them with [`Stroke::curve`].
    ///
    /// Never in layout. The node is a float sized to the stroke's padded
    /// bounding box, so it takes no room in a row or column, and `spec`'s
    /// sizing, clamps, padding, gap and alignment are ignored. What `spec`
    /// carries that matters: `transition` (the colour eases — it rides in
    /// the `bg` slot — and `slide`, `enter` and `exit` offsets move the
    /// float), `opacity`, `on_layout` (reports the bounding box), a
    /// declared `float` whose *anchor* is kept (`FloatAnchor::Viewport`
    /// reads the points in viewport space), and `role` / `label`, which are
    /// honoured like any node's; without them a line has no access row —
    /// unless it takes input, when it derives one as a box would. Input
    /// is hit by *shape*: a press within half the stroke's
    /// width of any piece (at least `MIN_STROKE_GRAB` wide) hits it, and
    /// a press elsewhere in its box falls through to what is under it.
    /// Fewer than two points draw nothing.
    ///
    /// Consecutive segments overlap at their round caps, which is the
    /// join: exact for an opaque stroke, and a translucent one
    /// double-blends there, the way a faded subtree shows its seams.
    pub fn line_node(&mut self, points: &[Vec2], stroke: Stroke, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        self.line_with_key(key, points, &stroke, spec);
    }

    /// [`Self::line_node`] under a label key, for a stroke that transitions
    /// or exits and needs a stable identity across frames.
    pub fn line_node_keyed(
        &mut self,
        label: &str,
        points: &[Vec2],
        stroke: Stroke,
        spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key(label);
        self.line_with_key(key, points, &stroke, spec);
        // Like every other keyed door: the label `key_of` resolves through.
        self.note_label(key, label);
    }

    /// [`Self::line_node`] under a data index; see [`Self::open_indexed`].
    pub fn line_node_indexed(&mut self, i: u64, points: &[Vec2], stroke: Stroke, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key_indexed(i);
        self.line_with_key(key, points, &stroke, spec);
    }

    /// The stroke is lent from here down: at 44 bytes with its dash it
    /// is passed in memory, and a copy at each call of the chain was
    /// most of what a solid line cost over alpha.36's (backlog C52).
    pub(crate) fn line_with_key(
        &mut self,
        key: Key,
        points: &[Vec2],
        stroke: &Stroke,
        mut spec: NodeSpec,
    ) {
        let declared = self.keeping().then(|| spec.clone());
        let Some((id, rect)) = self.lines.push(points, stroke) else {
            return;
        };
        if let Some(spec) = declared {
            self.keep_op(replay::Op::Line {
                key,
                points: points.to_vec(),
                stroke: *stroke,
                spec: Box::new(spec),
            });
        }
        // The stroke colour rides in the slot backgrounds tween through, so
        // `transition`, `enter` and `exit` reach it with no slot of its own;
        // nothing else of the box vocabulary applies to a stroke.
        spec.style.bg = stroke.color;
        spec.style.border_w = 0.0;
        spec.style.border_color = Color::TRANSPARENT;
        spec.style.shadow = crate::spec::Shadow::default();
        // The same pipeline as a box's, so a stroke's `hover_bg` is the
        // colour it takes under the pointer and `accent` is honoured.
        self.prepare_spec(key, &mut spec);
        // The box is the stroke's own, and the points are stored relative
        // to it.
        Self::float_box_for(&mut spec, rect);
        self.push_leaf(key, spec, NodeContent::Line(id));
    }

    /// A filled polygon through `points` in the parent's box space:
    /// up to
    /// eight vertices, the fill in `spec`'s `bg`, painted by the stock
    /// polygon fragment the core registers itself.
    ///
    /// Placed exactly as a line is: never in
    /// layout, a float sized to the points' bounding box inflated by a
    /// logical pixel for the edge ramp, so it takes no room in a row or
    /// column and `spec`'s sizing, clamps, padding, gap and alignment are
    /// ignored. `transition` eases the fill through the `bg` slot, and
    /// `slide`, `enter` and `exit` move the float; a declared `float`
    /// keeps its *anchor*; `role` and `label` are honoured, and without
    /// them a polygon has no access row unless it takes input, when it
    /// derives one as a box would (a clickable wedge is a button). Input
    /// is hit by *shape*: a press inside the outline hits it,
    /// one in its box but outside the outline falls through to what is
    /// under. Fewer than three points draw nothing; a ninth and later are
    /// dropped with `polygon-points-truncated`. The outline may be
    /// concave; a self-intersecting one fills even-odd, its overlaps
    /// unfilled.
    pub fn polygon_node(&mut self, points: &[Vec2], spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        self.polygon_with_key(key, points, spec);
    }

    /// [`Self::polygon_node`] under a label key.
    pub fn polygon_node_keyed(&mut self, label: &str, points: &[Vec2], spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key(label);
        self.polygon_with_key(key, points, spec);
        self.note_label(key, label);
    }

    /// [`Self::polygon_node`] under a data index; see [`Self::open_indexed`].
    pub fn polygon_node_indexed(&mut self, i: u64, points: &[Vec2], spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key_indexed(i);
        self.polygon_with_key(key, points, spec);
    }

    /// The stock polygon fragment's handle, registered on first use and
    /// again after `remove_fragment` forgot it.
    fn stock_polygon(&mut self) -> Option<crate::resources::FragmentId> {
        if let Some(id) = self.stock_polygon {
            return Some(id);
        }
        let id = self.add_fragment(crate::fragment::POLYGON);
        self.stock_polygon = id;
        id
    }

    pub(crate) fn polygon_with_key(&mut self, key: Key, points: &[Vec2], mut spec: NodeSpec) {
        if points.len() < 3 {
            return;
        }
        if self.keeping() {
            self.keep_op(replay::Op::Polygon {
                key,
                points: points.to_vec(),
                spec: Box::new(spec.clone()),
            });
        }
        if points.len() > crate::fragment::POLYGON_MAX_POINTS {
            self.diag.raise(Warning {
                code: crate::diag::POLYGON_POINTS_TRUNCATED,
                key,
                message: format!(
                    "a polygon takes {} points and {} were declared, so the last {} were \
                     dropped; split it in two",
                    crate::fragment::POLYGON_MAX_POINTS,
                    points.len(),
                    points.len() - crate::fragment::POLYGON_MAX_POINTS
                ),
            });
        }
        let points = &points[..points.len().min(crate::fragment::POLYGON_MAX_POINTS)];
        let Some(id) = self.stock_polygon() else {
            return;
        };
        // The box: the points' bounds, a logical pixel out on every side
        // so the one-pixel edge ramp is never cut by the quad's own edge.
        let (mut x0, mut y0, mut x1, mut y1) = (f32::MAX, f32::MAX, f32::MIN, f32::MIN);
        for p in points {
            x0 = x0.min(p.x);
            y0 = y0.min(p.y);
            x1 = x1.max(p.x);
            y1 = y1.max(p.y);
        }
        let rect = Rect::new(x0 - 1.0, y0 - 1.0, x1 - x0 + 2.0, y1 - y0 + 2.0);
        // The vertices, normalised to that box; the last repeated to pad,
        // which the stock source reads as a zero-length edge and skips.
        let mut params = [0.0f32; 16];
        let last = points[points.len() - 1];
        for i in 0..crate::fragment::POLYGON_MAX_POINTS {
            let p = points.get(i).copied().unwrap_or(last);
            params[i * 2] = (p.x - rect.x) / rect.w;
            params[i * 2 + 1] = (p.y - rect.y) / rect.h;
        }
        let draw = self.fragments.push(crate::fragment::Draw {
            id,
            image: None,
            params,
        });
        // The fill rides in `bg`, which `transition`, `enter` and `exit`
        // already ease — and which `hover_bg` and `accent` swap, through
        // the same pipeline as a box's; nothing else of the box vocabulary
        // applies.
        spec.style.border_w = 0.0;
        spec.style.border_color = Color::TRANSPARENT;
        spec.style.shadow = crate::spec::Shadow::default();
        self.prepare_spec(key, &mut spec);
        Self::float_box_for(&mut spec, rect);
        self.push_leaf(key, spec, NodeContent::Polygon(draw));
    }

    /// A path — any outline, SVG's `d` — filled with `spec`'s `bg` by the
    /// path's rule and stroked by its stroke if it has one
    /// (`docs/adr/0040-a-path-is-a-mask-in-the-atlas.md`).
    ///
    /// Placed exactly as a line is: never in layout, a float sized to the
    /// outline's bounding box two logical pixels out (and half the stroke's
    /// width further), so it takes no room in a row or column and
    /// `spec`'s sizing, clamps, padding, gap and alignment are ignored.
    /// `transition` eases the fill through the `bg` slot, and `slide`,
    /// `enter` and `exit` move the float; a declared `float` keeps its
    /// *anchor*; `role` and `label` are honoured, and without them a path
    /// has no access row unless it takes input, when it derives one as a
    /// box would. Input is hit by *shape*: a press inside the outline by
    /// the fill rule hits it, one in its box past the outline falls
    /// through to what is under. A path with no outline draws nothing.
    ///
    /// The outline is rasterized once per shape, scale and quarter-pixel
    /// position into the glyph atlas and drawn as a glyph-mask quad; the
    /// fill bleeds half a pixel so two paths sharing an edge meet without
    /// the background showing through. A path whose ops change twice within
    /// a few frames, or whose mask is a quarter of the biggest atlas page or
    /// more, draws from a texture of its own instead.
    pub fn path_node(&mut self, path: &crate::path::Path, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        self.path_with_key(
            key,
            path.ops(),
            path.rule(),
            path.stroke(),
            path.turn(),
            spec,
        );
    }

    /// [`Self::path_node`] under a label key.
    pub fn path_node_keyed(&mut self, label: &str, path: &crate::path::Path, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key(label);
        self.path_with_key(
            key,
            path.ops(),
            path.rule(),
            path.stroke(),
            path.turn(),
            spec,
        );
        self.note_label(key, label);
    }

    /// [`Self::path_node`] under a data index; see [`Self::open_indexed`].
    pub fn path_node_indexed(&mut self, i: u64, path: &crate::path::Path, spec: NodeSpec) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key_indexed(i);
        self.path_with_key(
            key,
            path.ops(),
            path.rule(),
            path.stroke(),
            path.turn(),
            spec,
        );
    }

    /// SVG path data to a [`crate::path::Path`], through the one parser
    /// every binding's `d` goes through (`Path::parse`, reached here as
    /// the door the C API's `kui_path_parse` is). `Err` names the byte.
    pub fn parse_path(&self, d: &str) -> Result<crate::path::Path, crate::path::PathError> {
        crate::path::Path::parse(d)
    }

    /// [`Self::path_node`] from SVG path data, parsed by the one parser
    /// every binding goes through; data that does not parse raises
    /// `path-malformed` under the node's key and draws nothing.
    pub fn path_d_node(
        &mut self,
        d: &str,
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        self.path_node_d(key, d, rule, stroke, turn, spec);
    }

    /// [`Self::path_d_node`] under a label key.
    pub fn path_d_node_keyed(
        &mut self,
        label: &str,
        d: &str,
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key(label);
        self.path_node_d(key, d, rule, stroke, turn, spec);
        self.note_label(key, label);
    }

    /// [`Self::path_d_node`] under a key the caller derived.
    pub fn path_node_d(
        &mut self,
        key: Key,
        d: &str,
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        spec: NodeSpec,
    ) {
        // The string a key declared last frame is the string it declares
        // this frame, nearly always: its ops are kept, and the parse is
        // paid when the string changes.
        let hash = crate::key::hash_bulk(d.as_bytes());
        let kept = self
            .path_parsed
            .remove(&key)
            .filter(|p| p.hash == hash && p.len == d.len());
        let ops = match kept {
            Some(p) => p.ops,
            None => match crate::path::Path::parse(d) {
                Ok(path) => path.into_ops(),
                Err(e) => {
                    self.diag.raise(Warning {
                        code: crate::diag::PATH_MALFORMED,
                        key,
                        message: format!("the path's `d` did not parse: expected {e}"),
                    });
                    return;
                }
            },
        };
        self.path_with_key(key, &ops, rule, stroke, turn, spec);
        self.path_parsed.insert(
            key,
            crate::path::Parsed {
                hash,
                len: d.len(),
                seen: self.frame_no,
                ops,
            },
        );
    }

    /// [`Self::path_node`] from the flat op form — a code, then its
    /// operands, per op, as `Path::to_floats` writes it and a binding's
    /// wire carries it. Floats that are not the form (a code that is not
    /// one, an op cut short) raise `path-malformed` under the node's key
    /// and draw nothing: one answer in every binding, where it was an
    /// error in one and silence in two (RG112).
    pub fn path_flat_node(
        &mut self,
        floats: &[f32],
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        self.path_node_flat(key, floats, rule, stroke, turn, spec);
    }

    /// [`Self::path_flat_node`] under a label key.
    pub fn path_flat_node_keyed(
        &mut self,
        label: &str,
        floats: &[f32],
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        spec: NodeSpec,
    ) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.child_key(label);
        self.path_node_flat(key, floats, rule, stroke, turn, spec);
        self.note_label(key, label);
    }

    /// [`Self::path_flat_node`] under a key the caller derived.
    pub fn path_node_flat(
        &mut self,
        key: Key,
        floats: &[f32],
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        spec: NodeSpec,
    ) {
        match crate::path::Path::from_floats(floats) {
            Ok(path) => self.path_with_key(key, path.ops(), rule, stroke, turn, spec),
            Err(e) => self.diag.raise(Warning {
                code: crate::diag::PATH_MALFORMED,
                key,
                message: format!(
                    "the path's ops are not the flat form: expected {} at float {}",
                    e.what, e.at
                ),
            }),
        }
    }

    pub(crate) fn path_with_key(
        &mut self,
        key: Key,
        ops: &[crate::path::PathOp],
        rule: crate::path::FillRule,
        stroke: Option<Stroke>,
        turn: Option<crate::path::Turn>,
        mut spec: NodeSpec,
    ) {
        let declared = self.keeping().then(|| spec.clone());
        // A number that is not one - `1e99` in `d` is an infinity, a
        // chart's 0/0 a NaN - has no outline to draw: the bounds would
        // drop it and the rasterizer would not.
        // The same for its turn, which the box does not depend on and so
        // could not catch.
        let turn_ok = turn.is_none_or(|t| {
            t.turns.is_finite() && t.pivot.is_none_or(|p| p.x.is_finite() && p.y.is_finite())
        });
        if !turn_ok || !ops.iter().all(crate::path::PathOp::is_finite) {
            self.diag.raise(Warning {
                code: crate::diag::PATH_MALFORMED,
                key,
                message: "the path holds a number that is not finite (a NaN or an \
                          infinity), among its coordinates or in its turn"
                    .into(),
            });
            return;
        }
        let stroke_w = stroke.map_or(0.0, |s| s.width.max(0.0));
        let dash = stroke.and_then(|s| s.dash.cut(stroke_w));
        let Some((id, rect)) = self.paths.push(ops, rule, stroke_w, dash, turn) else {
            return;
        };
        if let Some(spec) = declared {
            self.keep_op(replay::Op::Path {
                key,
                ops: ops.to_vec(),
                rule,
                stroke,
                turn,
                spec: Box::new(spec),
            });
        }
        // The mask is the box at the frame's scale; past what a texture
        // can hold it draws nothing, and says so once per key. A box
        // that is not finite - a coordinate past what an f32 holds, a NaN
        // among the ops or in the turn - is past it too: `max` drops a
        // NaN, so the side alone would let one through.
        let side = (rect.w.max(rect.h) * self.scale).ceil();
        let finite = [rect.x, rect.y, rect.w, rect.h]
            .iter()
            .all(|v| v.is_finite());
        if !finite || side + 2.0 > crate::path::MAX_MASK_SIDE as f32 {
            self.diag.raise(Warning {
                code: crate::diag::PATH_TOO_LARGE,
                key,
                message: format!(
                    "the path's mask would be {side} px on a side at this scale, and a \
                     texture holds {} at most; draw it smaller, or as several paths",
                    crate::path::MAX_MASK_SIDE
                ),
            });
            return;
        }
        // A key whose ops changed twice within a few frames is animating:
        // its masks go to a texture of their own rather than churning the
        // atlas (ADR 0040, decision 8). One change is a new shape and a
        // new slot.
        // A pattern that moves - a marquee's marching ants - is a shape
        // that moves: each offset is a mask of its own.
        let hash = self.paths.run(id).0.hash ^ dash.map_or(0, |d| d.hash());
        let now = self.frame_no;
        let motion = match self.path_motion.get(&key) {
            Some(&m) if m.hash != hash => crate::path::Motion {
                hash,
                seen: now,
                changed: now,
                animating: m.animating
                    || (m.changed != 0 && now - m.changed <= crate::path::ANIMATING_WINDOW),
            },
            // Still for long enough, it is a shape again and goes back
            // to the atlas: the latch is for what moves, and a key from
            // the tree position whose siblings came and went would
            // otherwise hold a texture of its own for good (RG112).
            Some(&m) => crate::path::Motion {
                seen: now,
                animating: m.animating && now - m.changed <= crate::path::SETTLED_AFTER,
                ..m
            },
            None => crate::path::Motion {
                hash,
                seen: now,
                changed: 0,
                animating: false,
            },
        };
        if motion.animating {
            self.paths.set_animating(id);
        }
        self.path_motion.insert(key, motion);
        // The fill rides in `bg`, which `transition`, `enter` and `exit`
        // ease and `hover_bg` and `accent` swap; the stroke rides in the
        // border slots, which is what a border is to a box.
        spec.style.border_w = stroke_w;
        spec.style.border_color = stroke.map_or(Color::TRANSPARENT, |s| s.color);
        spec.style.shadow = crate::spec::Shadow::default();
        self.prepare_spec(key, &mut spec);
        Self::float_box_for(&mut spec, rect);
        self.push_leaf(key, spec, NodeContent::Path(id));
    }

    /// A paragraph of styled spans, shaped and wrapped as one flow.
    pub fn rich_text_node(&mut self, spans: &[Span<'_>], base: TextStyle) {
        if self.tree.is_empty() {
            return;
        }
        let key = self.auto_key();
        if self.keeping() {
            self.keep_op(replay::Op::Rich {
                key,
                spans: spans
                    .iter()
                    .map(|s| (s.text.into(), Span { text: "", ..*s }))
                    .collect(),
                base,
            });
        }
        self.rich_text_with_key(key, spans, base);
    }

    /// [`Self::rich_text_node`] under a key the caller derived.
    pub(crate) fn rich_text_with_key(&mut self, key: Key, spans: &[Span<'_>], base: TextStyle) {
        if self.tree.is_empty() {
            return;
        }
        // The paragraph's own colour, which each span falls back to.
        let base = base.or_fg(self.theme.fg);
        let tid = {
            let sess = &mut *self.session.state();
            self.text
                .add_rich(spans, &base, &sess.resources, &mut sess.fonts)
        };
        let parent = self.current();
        self.tree.push(
            parent,
            key,
            self.origin,
            NodeSpec::default(),
            NodeContent::Text(tid),
        );
    }
}