kui-core 0.1.0-alpha.45

//! A held drag following its scroller.
//!
//! Two things a caret drag or a drag-select needs beyond the press, the
//! motion and the release, both of them about the frame moving under a
//! pointer that did not: when the layout under the held pointer changes
//! — a wheel notch, a scroller nudged, a virtual list re-sliced — the
//! live end is placed again where the pointer is; and when
//! the pointer is held past the scroller's edge, the core is what changes
//! the layout, at a rate from how far past. Both run at the
//! start of every frame against the frame that finished, so the frame
//! being built paints the result.
//!
//! The scroller is found once, at the press: the nearest ancestor-or-self
//! of the pressed node that scrolls, or that declared `on_scroll` — the
//! second kind is nudged as an event, since the core holds nothing of
//! what it scrolls (a `cells` grid is one screenful of the app's history;
//! decision 4).

use super::*;

/// Past this many logical px beyond the edge the step stops speeding up.
pub const AUTOSCROLL_REACH: f32 = 100.0;
/// Logical px per second of scrolling, per logical px past the edge: 60
/// px past is 600 px/s, the reach is 1000 px/s.
pub const AUTOSCROLL_RATE: f32 = 10.0;
/// The frame a core with no clock takes, in seconds — a sixtieth, so a
/// headless drive steps by a knowable amount. A clockless core does not
/// snap here: there is no end state to snap to.
pub const CLOCKLESS_FRAME: f64 = 1.0 / 60.0;
/// The longest frame the rate is applied over: a window that sat hidden
/// for a second must not scroll a second's worth when it comes back.
const MAX_FRAME: f64 = 0.1;

/// What a held drag scrolls, and what its live end was last placed
/// against.
#[derive(Clone, Copy, Debug, PartialEq)]
pub(crate) enum Scroller {
    /// A scroll container: the nudge is an offset the layout clamps, and
    /// the gate is the offset the last layout placed the content at.
    Container { key: Key, seen: Vec2 },
    /// An `on_scroll` node: the nudge is a `scroll` event the app answers
    /// by re-declaring. For a `cells` grid the gate is the `origin_line`
    /// it declared; any other handler moves what it likes, so the gate
    /// is every frame while the drag is held.
    Handler { key: Key, seen: Option<u64> },
}

impl Scroller {
    fn key(self) -> Key {
        match self {
            Scroller::Container { key, .. } | Scroller::Handler { key, .. } => key,
        }
    }
}

/// A held drag and what it follows: the pointer's last position, kept
/// across a `CursorLeft` (a press dragged out of the window gets one on
/// some platforms, and the drag is still held); the scroller; and
/// whether the last frame stepped it, which is what asks for the next
/// frame (`Core::animating`).
#[derive(Clone, Copy, Debug, PartialEq)]
pub(crate) struct DragFollow {
    pub point: Vec2,
    pub scroller: Option<Scroller>,
    pub stepped: bool,
}

impl Core {
    /// Arms the follow for a drag a press just started on `node` at
    /// `point`: finds the scroller and records where it is now.
    pub(crate) fn arm_follow(&mut self, node: Key, point: Vec2) {
        let scroller = self.scroller_of(node);
        self.drag_follow = Some(DragFollow {
            point,
            scroller,
            stepped: false,
        });
    }

    /// The pointer moved and the caller placed the live end there against
    /// the finished frame: the scroller's reading is taken again, so the
    /// next frame does not place the end a second time for a move the
    /// frame already answered.
    pub(crate) fn follow_point(&mut self, point: Vec2) {
        let Some(mut f) = self.drag_follow else {
            return;
        };
        f.point = point;
        f.scroller = f.scroller.map(|s| self.reading_of(s.key(), s));
        self.drag_follow = Some(f);
    }

    /// The drag ended: the live end is placed once more where the pointer
    /// is, against the finished frame — a release right after a nudge
    /// lands where the pointer is, not a frame behind — and the follow
    /// is dropped. The drags themselves are the caller's to clear.
    pub(crate) fn end_follow(&mut self) {
        if let Some(f) = self.drag_follow.take() {
            self.rehit(f.point);
        }
    }

    /// Whether a held drag stepped its scroller this frame — one more
    /// frame is wanted with nothing in the queue.
    pub(crate) fn autoscrolling(&self) -> bool {
        self.drag_follow.is_some_and(|f| f.stepped)
    }

    /// The scroller a held drag stepped this frame, when it did: who
    /// [`Self::autoscrolling`] names in a trace.
    pub(crate) fn autoscroller(&self) -> Option<Key> {
        self.drag_follow
            .filter(|f| f.stepped)
            .and_then(|f| f.scroller)
            .map(Scroller::key)
    }

    /// The nearest ancestor-or-self of `node` that a held drag scrolls,
    /// with its current reading. Self first, because a `uniform_list`
    /// is both the selection's scope and its scroller. A handler beats
    /// a container on the same node: the app asked to hear the wheel
    /// (`ScrollRegion::handler`). Read off the finished frame's tree,
    /// which is what a press between two frames sees; a press during a
    /// build has no scroller.
    fn scroller_of(&self, node: Key) -> Option<Scroller> {
        if self.building {
            return None;
        }
        let mut i = self.tree.index_of(node)?;
        loop {
            let key = self.tree.keys[i];
            let spec = &self.tree.specs[i];
            if spec.events().on_scroll.is_some() {
                return Some(self.reading_of(key, Scroller::Handler { key, seen: None }));
            }
            if spec.layout.scroll_x || spec.layout.scroll_y {
                return Some(self.reading_of(
                    key,
                    Scroller::Container {
                        key,
                        seen: Vec2::ZERO,
                    },
                ));
            }
            match self.tree.parent[i] {
                NIL => return None,
                p => i = p as usize,
            }
        }
    }

    /// The scroller `key`, of `kind`'s kind, at what the finished frame
    /// placed it: the one reading `scroller_of` takes, the gate compares
    /// against, and a placement refreshes.
    fn reading_of(&self, key: Key, kind: Scroller) -> Scroller {
        match kind {
            Scroller::Container { .. } => Scroller::Container {
                key,
                seen: self.scroll.laid_offset(key).unwrap_or(Vec2::ZERO),
            },
            Scroller::Handler { .. } => Scroller::Handler {
                key,
                seen: self.grid_line(key),
            },
        }
    }

    /// The `origin_line` the finished frame's grid `key` declared, if the
    /// key is a grid.
    fn grid_line(&self, key: Key) -> Option<u64> {
        self.cells_id_of_ref(key)
            .map(|id| self.cells.origin_line(id, self.building))
    }

    /// The row height of the grid `key`, logical px — what a wheel delta
    /// or an edge step is divided by to become lines.
    fn grid_line_height(&mut self, key: Key) -> Option<f32> {
        let id = self.cells_id_of_ref(key)?;
        let sess = &mut *self.session.state();
        let cell = self
            .cells
            .cell_size(id, self.building, &sess.resources, &mut sess.fonts);
        (cell.h > 0.0).then_some(cell.h)
    }

    /// Places the held drag's live end at `p` against the finished frame,
    /// exactly as a `CursorMoved` there would: the caret for a caret
    /// drag, the selection's focus for a drag-select, in whichever
    /// geometry its scope has.
    pub(crate) fn rehit(&mut self, p: Vec2) {
        if let Some((key, _)) = self.edit.dragging {
            self.edit_drag_to(key, p);
        }
        if let Some(drag) = self.select_dragging {
            self.extend_select_drag(drag, p);
        }
    }

    /// Moves the caret drag in editor `key` to the viewport point `p`,
    /// against the origin the editor was drawn at this frame — not the
    /// press's, which a nudge has moved.
    pub(crate) fn edit_drag_to(&mut self, key: Key, p: Vec2) {
        let origin = self
            .interaction
            .edit_origin_of(key)
            .or_else(|| self.edit.dragging.map(|(_, o)| o));
        if let Some(origin) = origin {
            let local = Vec2::new(p.x - origin.x, p.y - origin.y);
            self.edit_with_fonts(|edit, fs| edit.drag(key, local, fs));
        }
    }

    /// At the start of a frame, against the one that finished: re-places
    /// the live end if the scroller moved since it was last placed, then
    /// steps the scroller if the pointer is held past its edge. Nothing
    /// while no drag is held.
    pub(crate) fn follow_drag(&mut self) {
        let now = self.anim.time();
        let dt = match (now, self.last_frame_time) {
            (Some(n), Some(l)) => (n - l).clamp(0.0, MAX_FRAME),
            (Some(_), None) | (None, _) => CLOCKLESS_FRAME,
        } as f32;
        self.last_frame_time = now;
        let Some(mut f) = self.drag_follow else {
            return;
        };
        f.stepped = false;
        if let Some(scroller) = f.scroller {
            // 1. The frame under the pointer moved: place the end again.
            let key = scroller.key();
            let now = self.reading_of(key, scroller);
            let moved = match scroller {
                Scroller::Container { .. } => now != scroller,
                Scroller::Handler { seen, .. } => seen.is_none() || now != scroller,
            };
            if moved {
                self.rehit(f.point);
                f.scroller = Some(now);
            }
            // 2. The pointer is past the edge: step the scroller.
            if let Some(i) = self.tree.index_of(key) {
                let rect = Rect::from_pos_size(self.tree.pos[i], self.tree.size[i]);
                f.stepped = match scroller {
                    Scroller::Container { .. } => {
                        let spec = self.tree.specs[i].layout;
                        let delta = edge_step(rect, f.point, spec.scroll_x, spec.scroll_y, dt);
                        // A step the clamp would undo is no step: a
                        // scroller at its end under a held pointer is
                        // idle, not asking for frames until the release.
                        let moves = self.scroll.geometry(key).is_some_and(|g| {
                            let can =
                                |o: f32, d: f32, m: f32| (o + d).clamp(0.0, m) != o.clamp(0.0, m);
                            can(g.offset.x, delta.x, g.max_offset.x)
                                || can(g.offset.y, delta.y, g.max_offset.y)
                        });
                        if moves {
                            self.scroll.scroll_by(key, delta);
                        }
                        moves
                    }
                    Scroller::Handler { .. } => {
                        // A grid scrolls lines and has no columns to
                        // scroll to; any other handler hears both axes.
                        let grid = self.grid_line(key).is_some();
                        let delta = edge_step(rect, f.point, !grid, true, dt);
                        if delta != Vec2::ZERO {
                            // The event's delta is the wheel's: positive
                            // `dy` is earlier content, so a step toward
                            // later content — the pointer below — is
                            // negative.
                            let wheel = Vec2::new(-delta.x, -delta.y);
                            if let Some(ev) = self.scroll_event(key, f.point, wheel) {
                                self.pending.push(ev);
                            }
                            true
                        } else {
                            false
                        }
                    }
                };
            }
        }
        self.drag_follow = Some(f);
    }

    /// The `scroll` event a delta over the `on_scroll` node `key` makes —
    /// the wheel's, or an edge step's — with the whole lines it covers
    /// on a grid. The fraction left over is carried to the next delta on
    /// the same grid, whichever of the two made it (`line_carry`): a
    /// notch's half line and an edge step's add up. `None` when the node
    /// is not in the finished frame or declared no tag.
    pub(crate) fn scroll_event(&mut self, key: Key, p: Vec2, delta: Vec2) -> Option<UiEvent> {
        let i = self.tree.index_of(key)?;
        self.tree.specs[i].events().on_scroll.as_ref()?;
        let lines = match self.grid_line_height(key) {
            Some(h) => {
                let carry = match self.line_carry {
                    Some((k, c)) if k == key => c,
                    _ => 0.0,
                };
                // Later history is the wheel rolling down: negative `dy`.
                let total = carry - delta.y / h;
                let whole = total.trunc();
                self.line_carry = Some((key, total - whole));
                Value::Int(whole as i64)
            }
            None => Value::Null,
        };
        let origin = self.tree.origins[i];
        let tag = self.tree.specs[i].events().on_scroll.as_ref();
        let payload = Value::map([
            ("kind", Value::str("scroll")),
            ("x", Value::Float(p.x as f64)),
            ("y", Value::Float(p.y as f64)),
            ("dx", Value::Float(delta.x as f64)),
            ("dy", Value::Float(delta.y as f64)),
            ("lines", lines),
        ]);
        Some(UiEvent::on(origin, key, payload).tagged(tag))
    }
}

/// How far a scroller steps this frame for a pointer at `p` against its
/// `rect`: on each axis it scrolls, the distance past that edge (zero
/// inside), capped at the reach, times the rate, times the frame. A
/// positive step is toward later content, the sign `ScrollStore::scroll_by`
/// takes.
pub(crate) fn edge_step(rect: Rect, p: Vec2, x: bool, y: bool, dt: f32) -> Vec2 {
    let past = |lo: f32, hi: f32, v: f32| -> f32 {
        if v < lo {
            -(lo - v).min(AUTOSCROLL_REACH)
        } else if v > hi {
            (v - hi).min(AUTOSCROLL_REACH)
        } else {
            0.0
        }
    };
    let k = AUTOSCROLL_RATE * dt;
    Vec2::new(
        if x {
            past(rect.x, rect.x + rect.w, p.x) * k
        } else {
            0.0
        },
        if y {
            past(rect.y, rect.y + rect.h, p.y) * k
        } else {
            0.0
        },
    )
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn a_pointer_inside_steps_nothing() {
        let r = Rect::new(10.0, 10.0, 100.0, 50.0);
        assert_eq!(
            edge_step(r, Vec2::new(50.0, 30.0), true, true, 1.0 / 60.0),
            Vec2::ZERO
        );
    }

    #[test]
    fn the_step_is_proportional_capped_and_per_frame() {
        let r = Rect::new(0.0, 0.0, 100.0, 100.0);
        // 60 px below at a clockless frame: 600 px/s, 10 px a frame.
        let s = edge_step(r, Vec2::new(50.0, 160.0), false, true, 1.0 / 60.0);
        assert!((s.y - 10.0).abs() < 1e-4, "{s:?}");
        assert_eq!(s.x, 0.0);
        // 300 px above: capped at the reach, and toward earlier content.
        let s = edge_step(r, Vec2::new(50.0, -300.0), false, true, 1.0 / 60.0);
        assert!((s.y + AUTOSCROLL_REACH / 6.0).abs() < 1e-3, "{s:?}");
        // An axis the scroller does not have steps nothing.
        let s = edge_step(r, Vec2::new(160.0, 50.0), false, true, 1.0 / 60.0);
        assert_eq!(s, Vec2::ZERO);
        let s = edge_step(r, Vec2::new(160.0, 50.0), true, true, 1.0 / 60.0);
        assert!((s.x - 10.0).abs() < 1e-4, "{s:?}");
    }
}