pristine-cli 0.1.0

//! The rollup tree TUI: the front end the whole tool is for.
//!
//! # What it is
//!
//! The filesystem tree, pruned to paths that lead to something reclaimable, with every
//! ancestor carrying the bytes recoverable *beneath* it — collapsed by default and drilled
//! into on demand. A row's number is not "how big is this directory" but "how much do I get
//! back by emptying this subtree", so `~/repos/archived` is one row worth 118 GB rather than
//! forty rows a reader has to recognise as related.
//!
//! That is the thing neither reference implementation has. kondo's own README calls it
//! "essentially `rm -rf` with a prompt", which is a decision per hit, and hits are what scale:
//! one real home directory here holds 16,013 of them. npkill is better and still flat, so the
//! row a reader actually wants does not exist and has to be assembled from forty selections;
//! its range-select is npkill approximating a tree without having one.
//!
//! # Three moving parts, and the channel between them
//!
//! - The **walker** runs on its own thread and reports [`Found`] events. Rows appear as it
//!   finds them, which is npkill's good idea and is *easier* on a tree: a new claim updates
//!   ancestor totals in place instead of reordering a flat list.
//! - The **view** ([`state::View`]) holds everything a keystroke can change. It never touches
//!   the terminal or the filesystem, so every rule it has is a unit test.
//! - The **deleter** runs a marked batch on a pool and reports each target as it finishes,
//!   which is why the cursor is anchored to a path: rows vanish under it.
//!
//! All three meet on one channel, drained once per frame. The event loop blocks on the
//! terminal with a short timeout rather than on the channel, so a scan that finds nothing for
//! a second still repaints and a keystroke is never waiting behind a walk.
//!
//! # The TUI prices what it shows, and the CLI does not
//!
//! A default scan leaves claims [`crate::Size::Unmeasured`], because pricing one means enumerating
//! the subtree the walk deliberately pruned at — 4.6 s against 55.8 s over one real `~/repos`.
//! That is right for a listing you read once and wrong for a tree you steer by: unpriced, the
//! rollup has nothing to roll up, and the headline question has no answer at any depth.
//!
//! So the TUI turns the breakdown on unless the command line has scoped it. It can afford to,
//! and #618 is why: prices are computed on a pool and arrive as separate events, so the rows
//! are on screen at 7.5 s while the numbers fill in behind them for the following minute. The
//! reader marks and deletes throughout. `--breakdown-under <PATH>` still means what it says,
//! for a reader who wants one subtree priced and the rest left alone — and a **double click**
//! is the same request made afterwards, on the one row in front of the reader.
//!
//! # The pointer is generic, and that is the whole choice
//!
//! The alternative on the table was OSC 8 hyperlinks, which only ever express "open this path".
//! A pointer gives row selection, click-to-expand, click-to-mark, the wheel and column-heading
//! sorting from one hit test, and every later feature gets it for free. Three parts, mirroring
//! the keyboard's three:
//!
//! - [`render::hit`] resolves a cell to a [`Spot`] against the frame that was drawn. That is
//!   also where the routing lives — an overlay covers the screen it is over, so a press inside
//!   one *cannot* reach the tree, without anything restating the order.
//! - [`Pointer`] holds what one event cannot see about the events before it: what the press
//!   landed on, whether it has moved since, and whether one landed here a moment ago.
//! - [`keymap::pointer`] turns a gesture and a spot into an [`Action`], off a table the help
//!   overlay reads too.
//!
//! A [`Spot::Row`] names its row by **identity** and never by position, which matters more here
//! than in pua: rows re-sort as prices land and *vanish* as removals complete, and a press
//! resolved to a position and acted on a moment later would delete the wrong subtree.

pub mod chrome;
pub mod keymap;
pub mod lens;
pub mod moving;
pub mod render;
pub mod state;
pub mod treemap;

use std::io::{self, Write};
use std::path::PathBuf;
use std::sync::Arc;
use std::sync::mpsc::{Receiver, Sender, TryRecvError, channel};
use std::thread::JoinHandle;
use std::time::{Duration, Instant};

use ignore::gitignore::Gitignore;
use ratatui::crossterm::event::{
    self, DisableMouseCapture, EnableMouseCapture, Event, MouseButton, MouseEventKind,
};
use ratatui::crossterm::execute;
use ratatui::crossterm::terminal::{
    EnterAlternateScreen, LeaveAlternateScreen, disable_raw_mode, enable_raw_mode,
};
use ratatui::layout::Position;
use ratatui::{Terminal, TerminalOptions, Viewport, backend::CrosstermBackend};

use crate::delete::{Deleter, Planner, Removal, Step, Target};
use crate::size::{Measurer, SizeMode, human};
use crate::tree::Tree;
use crate::walk::{Found, Priced, WalkOutcome, Walker};
use crate::{Ruleset, WalkError};
use chrome::{Chrome, Decor, Status};
use keymap::{Action, Gesture, Motion, action_for, finish};
use render::{Placed, Spot};
use state::{Effect, Notice, View, plural};
use treemap::{Drawn, Maps, Pane, Screen};

/// How long the loop waits on the terminal before repainting anyway.
///
/// The frame rate while something is arriving, and nothing at all while the reader is
/// thinking: `event::poll` returns the moment a key is pressed, so this only bounds how stale
/// a *number* can be, not how long a keystroke waits.
const TICK: Duration = Duration::from_millis(100);

/// The same, while something on screen is actually moving.
///
/// Ten frames a second is enough to keep a number from going stale and not enough to make one
/// climb smoothly, so the loop draws faster exactly when there is something to see and drops
/// straight back to [`TICK`] when there is not — which is most of the time a reader spends in
/// here, deciding. A frame is 1.5 ms in release against this budget, so the difference is a
/// few percent of one core during a scan and nothing at all while one is being read.
const FRAME: Duration = Duration::from_millis(33);

/// How close together two presses on one row have to be to make a double click.
const DOUBLE_CLICK: Duration = Duration::from_millis(400);

/// Everything the front end needs from the command line.
#[derive(Debug, Clone)]
pub struct Options {
    /// The directory to scan.
    pub root: PathBuf,
    /// The size floor for the fallback tier.
    pub min_size: u64,
    /// How hard to work for each claim's size. See the module docs for why the default here
    /// is not the default for the listing.
    pub size_mode: SizeMode,
    /// Whether to stay on one filesystem — for the walk *and* for the planner, which is a
    /// safety property rather than a tidiness one.
    pub one_file_system: bool,
    /// Keep anything touched more recently than this.
    pub older_than: Option<Duration>,
    /// Whether the view opens with gitignored files on screen.
    ///
    /// The walk claims them whatever this says — `i` is what a reader presses, and a key that
    /// found nothing until the scan was run again would not be one. This is only where the lens
    /// starts, so that `--ignored-files` means the same thing here as it does to the listing.
    pub ignored_files: bool,
    /// Paths the reader has said never to walk into. See [`crate::Walker::excludes`].
    pub excludes: Arc<Gitignore>,
}

/// What one arriving event tells the view.
enum Message {
    Found(Found),
    Scanned(WalkOutcome),
    /// A removal reporting on itself as it happens: see [`crate::delete::Step`]. Carried
    /// through rather than flattened, because the two halves land on the view differently —
    /// bytes as they leave, the row when the sweep is finished with it.
    Removing(Step),
    Deleted(Box<Removal>),
    /// A subtree the reader double-clicked, now that it has been priced.
    ///
    /// The prices themselves went out one at a time as [`Found::Priced`], exactly as the
    /// walk's do. This carries the **claims the pass was holding** — the view is keeping them
    /// as "being priced" and nothing else knows which ones this pass had — plus what it could
    /// not read.
    Repriced {
        claims: Vec<PathBuf>,
        errors: Vec<WalkError>,
    },
}

/// What the run turns out to have been, for the exit status.
///
/// A live view says everything it knows on the screen — an unreadable path in the header, a
/// failed removal in the footer — and none of that reaches a script. The listing's rule is
/// that a run which could not do everything it was asked exits non-zero, and there is no
/// reason for the tree to be the exception: the same person pipes the same tool into the same
/// `&&` the next day.
#[derive(Debug, Default)]
pub struct Outcome {
    /// Paths the walk could not read, so every total is a lower bound. The header says so.
    pub errors: Vec<WalkError>,
    /// Targets a removal could not finish. **Not** the ones it refused: a refusal is the
    /// safety model working, which is exactly the distinction [`Removal::is_clean`] draws.
    pub failures: usize,
    /// What the session actually got back, across every batch it ran.
    ///
    /// Not part of the exit status — a run that freed nothing is a perfectly whole run — but
    /// it is the number the reader who walked away came back for, so it is what the window
    /// title says once there is one. See [`Status::Freed`].
    pub freed: u64,
}

impl Outcome {
    /// Whether everything the run was asked to do actually happened.
    #[must_use]
    pub fn whole(&self) -> bool {
        self.errors.is_empty() && self.failures == 0
    }
}

/// The terminal states this took, and the undoing of each.
///
/// A guard rather than a pair of calls at the end, because the two things that go wrong are
/// both invisible until somebody is left with a broken terminal: an *early* failure between
/// the setup steps skips a cleanup that had not been written yet, and a `?` on the first
/// cleanup step skips the second. Each flag is set the moment its state is genuinely entered,
/// so [`Restore::finish`] and [`Drop`] both undo exactly what happened and nothing else.
///
/// The [`Chrome`] is a **field** rather than a second guard beside this one, and that is the
/// point of it being here: a window title, a taskbar bar and an open synchronized update are
/// three more things a `?` can walk away from, and three guards that each undo a third of the
/// terminal are three chances to miss one. One owner, one order — innermost first.
///
/// **Mouse reporting is here for the same reason and is the sharpest case of it.** A process
/// that dies with capture on leaves a shell that answers every movement of the hand with
/// escape gibberish, and nothing is still alive to notice. This guard covers all three ways
/// out — the ordinary return, a `?`, and a panic, since [`Drop`] runs while the stack unwinds
/// — so no separate panic hook is needed to reach it.
#[derive(Debug)]
struct Restore<W: Write> {
    raw: bool,
    alternate: bool,
    mouse: bool,
    chrome: Chrome<W>,
    /// The treemap's image, which is the one piece of state here that lives in **another
    /// program's memory**: a graphics image is stored by the terminal, so a process that
    /// exits without deleting one leaves it there with nothing alive to notice.
    screen: Screen<W>,
}

impl<W: Write> Restore<W> {
    /// A guard that has taken nothing yet, holding the decorations it will hand back.
    fn new(chrome: Chrome<W>, screen: Screen<W>) -> Self {
        Self {
            raw: false,
            alternate: false,
            mouse: false,
            chrome,
            screen,
        }
    }

    /// Puts back what was taken, attempting **every** step and reporting the first refusal.
    ///
    /// `?` between the steps is the bug this replaces: a terminal that is out of raw mode and
    /// still on the alternate screen, or the other way round, is no better than one that was
    /// never restored, and the failing call says nothing about whether the next one would.
    fn finish(&mut self) -> io::Result<()> {
        // The image first, because it was written last and because it is the only one of
        // these whose undoing is somebody else's memory rather than a mode of this terminal.
        let mut first = self.screen.restore();
        // Then the decorations: the one that matters most — closing a synchronized update —
        // is the difference between a terminal that repaints and one that shows a frozen
        // frame forever.
        first = first.and(self.chrome.restore());
        if std::mem::take(&mut self.mouse) {
            first = first.and(execute!(io::stdout(), DisableMouseCapture));
        }
        if std::mem::take(&mut self.raw) {
            first = first.and(disable_raw_mode());
        }
        if std::mem::take(&mut self.alternate) {
            first = first.and(execute!(io::stdout(), LeaveAlternateScreen));
        }
        first
    }
}

impl<W: Write> Drop for Restore<W> {
    /// The path a `?` takes, and the one a panic takes. Nothing here can report a failure, so
    /// nothing here tries — [`Restore::finish`] is what the ordinary return calls.
    fn drop(&mut self) {
        let _ = self.finish();
    }
}

/// The removal thread, joined however the loop ends.
///
/// A guard rather than a `join` at the bottom of the loop, and the difference is every exit
/// that is not the bottom of the loop: a draw that fails, a terminal that stops answering, a
/// panic. Each of those returns through a `?` that no amount of care at the end can catch, and
/// what it abandons is a thread half way through unlinking a directory tree the reader
/// confirmed. Leaving `main` then kills it mid-batch — the same hazard `q` had, reached by a
/// path nobody presses.
///
/// So there is no bare [`JoinHandle`] anywhere in the loop. Owning one *is* the guarantee.
#[derive(Default)]
struct Batch(Option<JoinHandle<()>>);

impl Batch {
    /// Takes over from whatever ran before, which the view guarantees has finished — joined
    /// rather than dropped anyway, because dropping a handle detaches it and detaching is the
    /// whole bug.
    fn takes_over(&mut self, removal: JoinHandle<()>) {
        self.join();
        self.0 = Some(removal);
    }

    /// Waits for the removal, if there is one. A failure to join is a thread that panicked,
    /// which the loop already learns about from `reap` — there is nothing to do here but stop
    /// waiting.
    fn join(&mut self) {
        if let Some(removal) = self.0.take() {
            let _ = removal.join();
        }
    }
}

impl Drop for Batch {
    fn drop(&mut self) {
        self.join();
    }
}

/// The button that is down: what it landed on, and whether it has moved since.
///
/// Held rather than acted on, because "was this a click or a drag" is a question the press
/// cannot answer about itself. Carrying the [`Spot`] as well is what makes the deferral honest
/// rather than merely delayed: the release dispatches what the press was **aimed** at,
/// resolved against the frame the reader was looking at when they aimed, rather than
/// re-testing a screen that has moved since.
#[derive(Clone, Copy, Debug)]
struct Press {
    /// What it landed on — the click's target.
    spot: Spot,
    /// Whether it completed a double click, judged when it landed.
    ///
    /// Then rather than at the release, because a double click is two *presses* close
    /// together and it is the second one's timing that says so.
    double: bool,
    /// Whether it has moved since: a drag rather than a click.
    ///
    /// **Sticky**, and deliberately not "the pointer is somewhere else now": a hand that
    /// wanders a cell and comes back has still dragged, and finishing that as a click would
    /// open or mark a row on the way out of a gesture that was not one.
    moved: bool,
}

/// What the loop knows about a mouse event that the event itself does not.
///
/// # Why the loop holds this rather than the view
///
/// Every field is a judgement about a **previous** event, which the one in hand cannot see: a
/// `Drag` says where the pointer is now and not where it started, and a press's [`Spot`]
/// belongs to an event that was handled and is gone. Keeping them here is what lets
/// [`keymap::pointer`] stay a pure function of one gesture and one spot.
///
/// # The click happens on the **release**, because until then it is not one
///
/// A press that releases without moving is a click, and a press that moves is not — but which
/// of the two it is is unknown when the button goes down. Acting at the press and merely
/// declining to act again at the release is not enough, because the press's action has already
/// happened: a drag beginning on a column heading re-sorts the tree under the hand that was
/// about to select from it, and one beginning on an expander opens a subtree nobody aimed at.
///
/// So a press **aims and nothing else**, and everything it landed on is carried in [`Press`]
/// until the gesture says what it was.
#[derive(Debug, Default)]
struct Pointer {
    /// The spot the last press landed on, and when — the double click's other half.
    last: Option<(Spot, Instant)>,
    /// The button that is down, if one is.
    press: Option<Press>,
}

impl Pointer {
    /// What this mouse event means, given what it landed on.
    ///
    /// Takes the spot rather than hit-testing, which makes the ordering safe by construction:
    /// there is no way to ask this without having resolved the event against the frame that
    /// was drawn.
    fn read(&mut self, kind: MouseEventKind, spot: Spot, now: Instant) -> Action {
        match kind {
            MouseEventKind::Down(MouseButton::Left) => {
                let double = self.judge(spot, now);
                self.press = Some(Press {
                    spot,
                    double,
                    moved: false,
                });
                // Aiming only: see the note above for what this press *does*.
                keymap::pointer(Gesture::Aim, spot)
            }
            // A press that moved is a drag, not a click, and cannot be half of a double one
            // either. Without the second half, dragging out a selection and then pressing
            // where the drag started would toggle a subtree the reader was aiming to select
            // from.
            MouseEventKind::Drag(MouseButton::Left) => {
                self.last = None;
                if let Some(press) = self.press.as_mut() {
                    press.moved = true;
                }
                Action::Ignore
            }
            // The release is judged against the press it ends, and only then is the press
            // forgotten: a gesture is not over until the button is up.
            MouseEventKind::Up(MouseButton::Left) => match self.press.take() {
                Some(press) if !press.moved => finish(press.spot, press.double, spot),
                // A drag's release, or a button that went down before pristine was
                // reporting. Neither is a click.
                _ => Action::Ignore,
            },
            // Over an answer this is the hover highlight; everywhere else it must stay free.
            // Capture asks the terminal for *every* movement of the pointer, so anything that
            // acted here would act at the speed of a hand crossing the window.
            MouseEventKind::Moved => keymap::pointer(Gesture::Aim, spot),
            MouseEventKind::ScrollUp => keymap::pointer(Gesture::Wheel(Motion::Up), spot),
            MouseEventKind::ScrollDown => keymap::pointer(Gesture::Wheel(Motion::Down), spot),
            // The two buttons pristine does not use, and their drags.
            _ => Action::Ignore,
        }
    }

    /// Whether this press completes a double click.
    ///
    /// It compares **spots**, and that is this method's whole correctness. A double click is a
    /// claim about *what* was pressed twice, and on this screen the cell and the thing are not
    /// the same question: rows re-sort as prices land and vanish as removals finish, so
    /// between two presses 200 ms apart the cell under a steady finger can come to hold a
    /// different directory. Judged on coordinates, the second press would then price — or, on
    /// a row whose zone changed under it, open — something the reader never aimed at.
    ///
    /// Two consequences, both wanted. **A row is the target, not a cell of it**: two presses
    /// anywhere on one row are a double, because [`keymap::Target`] collapses the zones for
    /// everything but a click. And **a row that moved is a different target**: the press that
    /// lands on another directory after a re-sort is a first press, and selects.
    fn judge(&mut self, spot: Spot, now: Instant) -> bool {
        let double = self.last.is_some_and(|(before, when)| {
            before == spot && now.saturating_duration_since(when) <= DOUBLE_CLICK
        });
        // A completed double starts over rather than arming the next press: without this,
        // leaning on the button prices a row over and over, and a triple click is two doubles.
        self.last = (!double).then_some((spot, now));
        double
    }
}

/// Where keystrokes come from.
///
/// A seam with exactly one implementation in the shipped binary, and it exists so the event
/// loop can be tested at all: the guarantees worth having here are about what happens when a
/// *terminal* fails half way through a removal, and a test cannot press a key on a real one.
trait Events {
    /// Whether an event is waiting, within `timeout`.
    fn poll(&mut self, timeout: Duration) -> io::Result<bool>;

    /// The next event. Only called once [`Events::poll`] has said there is one.
    fn read(&mut self) -> io::Result<Event>;
}

/// The real terminal.
struct Keyboard;

impl Events for Keyboard {
    fn poll(&mut self, timeout: Duration) -> io::Result<bool> {
        event::poll(timeout)
    }

    fn read(&mut self) -> io::Result<Event> {
        event::read()
    }
}

/// Runs the view until the reader quits, then puts the terminal back.
///
/// # Errors
///
/// Anything the terminal refuses. A failure to *restore* it is reported even when the run
/// itself succeeded, because a terminal left in raw mode is the one outcome a user cannot
/// ignore and cannot easily undo.
pub fn run(options: &Options, ruleset: Arc<Ruleset>) -> io::Result<Outcome> {
    // Detected once, from the environment and a `is_terminal`, and never probed for: see
    // [`chrome`] for why nothing here asks the terminal a question it has to wait for.
    let decor = Decor::detect();
    let mut restore = Restore::new(
        Chrome::new(io::stdout(), decor),
        Screen::new(io::stdout(), decor.graphics),
    );
    enable_raw_mode()?;
    restore.raw = true;
    execute!(io::stdout(), EnterAlternateScreen)?;
    restore.alternate = true;
    execute!(io::stdout(), EnableMouseCapture)?;
    restore.mouse = true;
    restore.chrome.enter()?;

    let mut terminal = Terminal::with_options(
        CrosstermBackend::new(io::stdout()),
        TerminalOptions {
            viewport: Viewport::Fullscreen,
        },
    )?;
    let outcome = drive(
        &mut terminal,
        &mut Keyboard,
        &mut restore.chrome,
        &mut restore.screen,
        options,
        ruleset,
    );
    // The taskbar says how the run ended as well as how far it got. The reader who wanted a
    // bar is by definition the one who is not watching the exit status go past.
    if !outcome.as_ref().is_ok_and(Outcome::whole) {
        restore.chrome.failed();
    }
    // Cursor position is the terminal's business and the alternate screen swallowed it.
    let shown = terminal.show_cursor();
    let restored = restore.finish();
    outcome.and_then(|outcome| shown.and(restored).map(|()| outcome))
}

/// The event loop, with the terminal already set up.
fn drive<B: ratatui::backend::Backend<Error = io::Error>, W: Write>(
    terminal: &mut Terminal<B>,
    events: &mut dyn Events,
    chrome: &mut Chrome<W>,
    screen: &mut Screen<W>,
    options: &Options,
    ruleset: Arc<Ruleset>,
) -> io::Result<Outcome> {
    let (post, inbox) = channel();
    let mut view = View::new(Tree::new(&options.root));
    if options.ignored_files {
        view = view.showing_files();
    }
    let walker = spawn_walk(options, ruleset, post.clone());
    let mut outcome = Outcome::default();
    // Dropped at the end of this function however it ends — the bottom of the loop, a `?`, or
    // a panic — and dropping it waits for the removal. See [`Batch`].
    let mut batch = Batch::default();
    // Two clocks rather than one, because either phase can finish while the other is running:
    // a reader can mark and delete a subtree the moment it appears, long before the walk is
    // over, and a scan timed from the start of the removal it overlapped would be a scan
    // reported as having taken seconds.
    let scan_since = Instant::now();
    let mut batch_since = Instant::now();
    let mut scanning = view.is_scanning();
    let mut deleting = view.is_deleting();
    // Where the last frame put everything a press can land on, and what the loop knows about
    // a gesture that the event in hand does not. Both start empty, which is the honest
    // description of a run that has not drawn yet: a press before the first frame resolves to
    // `Spot::Nowhere` and does nothing.
    let mut placed = Placed::default();
    let mut pointer = Pointer::default();
    // The pricing worker's queue, started by the first double click that needs one and never
    // replaced: one `Option` here *is* the guarantee that a run has at most one of them, the
    // same way owning the removal's handle is the guarantee it gets joined.
    let mut pricer: Option<Sender<Vec<PathBuf>>> = None;

    loop {
        drain(&mut view, &inbox, &mut outcome);
        reap(&mut view, &inbox, &mut outcome, batch.0.as_ref());
        // The one place a clock enters the view, and it syncs on the way through. Every
        // interpolated number on screen moves exactly once per frame, here.
        view.animate(Instant::now());

        // A phase that has just ended is the only thing worth interrupting anybody for, and
        // the chrome decides whether it is: long enough to matter, and nobody watching. Both
        // of these mirror the view rather than being told separately when a phase begins —
        // two records of one fact is how a notification ends up describing a removal that is
        // still running.
        if scanning && !view.is_scanning() {
            chrome.announce(&scanned(&view), scan_since.elapsed())?;
        }
        if deleting && !view.is_deleting() {
            // The footer's own sentence, so a notification can never describe a removal
            // differently from the screen behind it.
            let said = view.notice().unwrap_or("the removal finished").to_owned();
            chrome.announce(&said, batch_since.elapsed())?;
        }
        scanning = view.is_scanning();
        deleting = view.is_deleting();
        chrome.show(Status::of(&view, outcome.freed))?;

        // Both of the map's gates, in one answer, **before** the layout reads it. #656 was
        // this asked in two places at two times: the allowlist here and the pixel size after
        // the draw, so a terminal that passed one and failed the other had columns taken from
        // its tree with nothing ever drawn in them. The same `cell` goes on to the pane below,
        // so there is one reading of the window per frame and nothing to disagree with.
        //
        // Per frame rather than once, because only half of it is a constant: the allowlist is
        // a fact about the program at the other end, and the pixel size is a fact about the
        // window, which a tmux client attaching takes away mid-run.
        let cell = cell_size(terminal);
        view.allow_maps(screen.mapping(cell));

        chrome.begin_frame()?;
        // The geometry comes back out of the draw rather than being computed beside it, so a
        // press is resolved against the frame the reader is looking at. See [`Placed`].
        // The frame is dropped rather than kept: a `CompletedFrame` borrows the terminal,
        // and the image below has to be written *through* the same one.
        let drawn = terminal
            .draw(|frame| placed = render::draw(frame, &mut view, &outcome.errors))
            .map(|_| ());
        // Inside the synchronized update, after the cells and before the frame is closed:
        // the image and the text around it have to land together or the pane tears in a way
        // a full repaint cannot fix, because ratatui will not redraw cells it did not change.
        let mapped = map(screen, &view, &placed, cell);
        // Ended before the draw's failure is reported, never after: a terminal left inside a
        // synchronized update keeps showing the frame before last, so a `?` here would trade
        // a reported error for a screen that is silently frozen.
        let ended = chrome.end_frame();
        let shown = drawn.and(mapped)?;
        ended?;
        // The screen has actually tried to draw, where the layout only asked — so when the two
        // disagree the screen is believed. It cannot happen from the reading above, and that
        // is the point: if a later change ever puts the two gates back out of step, the pane
        // comes off the next frame with a sentence under it, instead of being an empty
        // rectangle nobody can explain. That silence is the whole of what #656 was.
        if let Drawn::Cannot(why) = shown {
            view.allow_maps(why);
        }

        // A quit that was held back while a removal ran, now that it is over. Checked here
        // rather than where the key was pressed, because what the key produced was a promise
        // to leave and this is the first frame on which it can be kept.
        if view.wants_to_quit() {
            break;
        }
        if !events.poll(if view.is_moving() { FRAME } else { TICK })? {
            continue;
        }
        let event = events.read()?;
        let action = match &event {
            // A resize is not a keystroke and produces no action; the redraw above is the
            // whole of what it needs. The geometry it invalidates is replaced by that
            // redraw before the next event is read.
            Event::Resize(..) => continue,
            // Focus reporting was asked for by the chrome and is answered to it: it is the
            // one thing that can tell a notification whether anybody is there to read it.
            Event::FocusGained => {
                chrome.focused(true);
                continue;
            }
            Event::FocusLost => {
                chrome.focused(false);
                continue;
            }
            // Resolved to a *spot* first and to an action second, which is what keeps the
            // layout's order in one place: see [`render::hit`].
            Event::Mouse(mouse) => {
                let spot = render::hit(&view, &placed, Position::new(mouse.column, mouse.row));
                pointer.read(mouse.kind, spot, Instant::now())
            }
            _ => action_for(&event, view.overlay()),
        };
        match view.apply(action) {
            Effect::None => {}
            // Only ever reached with nothing in flight: the view holds a quit back while it
            // is deleting, and hands it over through `wants_to_quit` instead.
            Effect::Quit => break,
            Effect::Plan(targets) => {
                let plan = Planner::new(&options.root)
                    .one_file_system(options.one_file_system)
                    .older_than(options.older_than)
                    .plan(targets);
                view.ask(&plan);
            }
            Effect::Delete(targets) => {
                batch_since = Instant::now();
                batch.takes_over(spawn_delete(options, targets, post.clone()));
            }
            // Queued onto the one pricing worker, started on the first gesture that needs
            // one — see [`spawn_pricer`] for why there is exactly one of these.
            Effect::Price(claims) => {
                let queue = pricer.get_or_insert_with(|| spawn_pricer(options, post.clone()));
                if let Err(returned) = queue.send(claims) {
                    // The worker died — nothing in it should panic, and if one ever does the
                    // cost is not the panic: the view is holding these claims as "being
                    // priced", and left there the subtree can never be asked about again for
                    // the rest of the run. Handing them back is the same shape of repair
                    // `reap` makes for a removal that ended without reporting.
                    //
                    // Deliberately not an exit-status failure. Pricing is what a row *shows*,
                    // not something the run was asked to accomplish — a claim left unpriced
                    // reads as a dash, which is exactly the state `--breakdown-under` leaves
                    // most of the tree in and exits zero on.
                    view.repriced(
                        &returned.0,
                        Notice::standing("the pricing ended without reporting what it did"),
                    );
                    pricer = None;
                }
            }
        }
    }

    // The walk holds a `Sender`; dropping ours and letting the thread finish is what stops a
    // half-written frame from being the last thing on the screen. It is deliberately NOT
    // joined, where the removal is: a walk reads, so abandoning one costs nothing, and a
    // reader who pressed `q` during a scan of a home directory has said they are done
    // waiting.
    drop(walker);
    Ok(outcome)
}

/// What one cell of this terminal measures in pixels, or `None` when it will not say.
///
/// **A terminal that refuses `TIOCGWINSZ`, or fills its pixel fields with zeros, is not an
/// error.** The whole feature is an enhancement, so every way it can fail has to end in there
/// being no picture rather than in a run that stops — which is why this is read with `ok()`
/// where nearly every other call in this file carries a `?`.
///
/// Zeros are `None` and never `Some((0, 0))`, because they are an *absent* measurement rather
/// than a small one, and the only two things to do with an absent cell size are to say so or
/// to guess. Guessing draws an image at the wrong scale over the text it is meant to sit
/// beside, which is the same class of wrong as pricing a directory nobody measured.
fn cell_size<B: ratatui::backend::Backend<Error = io::Error>>(
    terminal: &mut Terminal<B>,
) -> Option<(u16, u16)> {
    let window = terminal.backend_mut().window_size().ok()?;
    let (across, down) = (window.columns_rows.width, window.columns_rows.height);
    if across == 0 || down == 0 {
        return None;
    }
    let cell = (window.pixels.width / across, window.pixels.height / down);
    (cell.0 > 0 && cell.1 > 0).then_some(cell)
}

/// Puts the treemap on the frame that has just been drawn, or takes it off.
///
/// Three reasons it comes off, and they are all "the map cannot be right", not "the map is
/// not wanted": there is no pane on this frame, an overlay is over the place it would go, or
/// the terminal will not say how big a cell is.
///
/// `cell` is the same reading the layout was gated on this frame — see [`cell_size`] — rather
/// than a second call to the terminal. Two readings are two answers that can differ, and a
/// pane sized from one while the decision to reserve it was taken on the other is #656 again
/// in a smaller window.
fn map<W: Write>(
    screen: &mut Screen<W>,
    view: &View,
    placed: &Placed,
    cell: Option<(u16, u16)>,
) -> io::Result<Drawn> {
    // An overlay is drawn by ratatui *as cells*, and the image sits above them — so a help
    // page over the map would be a help page behind it. The picture goes away instead.
    let Some(cells) = placed.map.filter(|_| view.overlay().is_none()) else {
        screen.hide()?;
        return Ok(Drawn::Nothing);
    };
    let Some(cell) = cell else {
        screen.hide()?;
        return Ok(Drawn::Cannot(Maps::Unmeasured));
    };
    screen.show(view, Pane { cells, cell }, Instant::now())
}

/// Notices a removal that ended without saying what it did.
///
/// Nothing in the deleter should panic, and if one ever does the cost is not the panic: the
/// view would sit `is_deleting()` forever, and a view that will not quit is worse than the
/// thing that made it. The thread posts its report *before* it finishes, so a finished thread
/// with nothing on the channel really has gone without reporting.
fn reap(
    view: &mut View,
    inbox: &Receiver<Message>,
    outcome: &mut Outcome,
    deleter: Option<&JoinHandle<()>>,
) {
    if !view.is_deleting() || !deleter.is_some_and(JoinHandle::is_finished) {
        return;
    }
    drain(view, inbox, outcome);
    if view.is_deleting() {
        outcome.failures += 1;
        // The freed total is left where it stands: a removal that said nothing is a removal
        // that gave no figure, and inventing one is the opposite of what this branch is for.
        // Standing, for the same reason: a thread that died mid-batch is counted as a failure
        // on the line above, and this sentence is where a reader learns of it.
        view.deleted(
            Notice::standing("the removal ended without reporting what it did"),
            outcome.freed,
        );
    }
}

/// Empties the channel into the view.
///
/// Everything on it, not one message: a breakdown reports 16,013 claims and as many prices,
/// and taking one per frame would render a tree that fills up over four minutes.
fn drain(view: &mut View, inbox: &Receiver<Message>, outcome: &mut Outcome) {
    loop {
        match inbox.try_recv() {
            Ok(Message::Found(Found::Claim(hit))) => view.found(hit),
            Ok(Message::Found(Found::Pricing(path))) => view.pricing(&path),
            Ok(Message::Found(Found::Priced(priced))) => view.priced(&priced.path, priced.size),
            Ok(Message::Scanned(walk)) => {
                outcome.errors.extend(walk.errors);
                view.scanned();
            }
            // Both halves reach the view, and both carry the deleter's own running byte
            // total — which is what lets a row's number fall on bytes that have genuinely
            // left the disk rather than on a timer started once they already had.
            Ok(Message::Removing(Step::Freeing(freeing))) => {
                view.freeing(&freeing.path, freeing.bytes);
            }
            Ok(Message::Removing(Step::Finished(removed))) => {
                view.removed(&removed.path, removed.bytes, removed.complete);
            }
            // Where the batch has got to, which is a different question from what happened to
            // any row — a target that failed before unlinking anything still counts here.
            Ok(Message::Removing(Step::Swept(path))) => view.swept(&path),
            Ok(Message::Repriced { claims, errors }) => {
                // The walk's rule, kept: a pass that could not read everything makes every
                // total it fed a lower bound, and the header says so beside the numbers.
                outcome.errors.extend(errors);
                view.repriced(
                    &claims,
                    Notice::passing(format!(
                        "priced {}",
                        plural(claims.len(), "directory", "directories")
                    )),
                );
            }
            Ok(Message::Deleted(removal)) => {
                outcome.failures += removal.failures.len();
                outcome.freed += removal.bytes_freed();
                // The rows the safety model left standing, so each one can say so where it
                // is. The footer's count says how many; only the row can say which.
                view.refused(&removal.kept);
                // The batch's own arithmetic replaces the per-target figures the counter has
                // been climbing on, rather than being added to them: they are the same bytes
                // counted by the same code, so adding would double every one of them.
                view.deleted(summarise(&removal), outcome.freed);
            }
            // Disconnected as well as empty: the walk finishing drops its sender, and there
            // is nothing left to say either way.
            Err(TryRecvError::Empty | TryRecvError::Disconnected) => return,
        }
    }
}

/// Starts the walk. The returned handle is only held so its `Sender` outlives the loop.
fn spawn_walk(options: &Options, ruleset: Arc<Ruleset>, post: Sender<Message>) -> JoinHandle<()> {
    let walker = Walker::new(&options.root, ruleset)
        .size_mode(options.size_mode.clone())
        .same_file_system(options.one_file_system)
        // Always claimed here, and hidden by the lens rather than by the walk. The two are
        // different questions — whether to pay to find them, and whether to draw them — and
        // the tree is the one front end that can answer the second per keystroke. A walk that
        // had left them out would make `i` a key that finds nothing until the run is done
        // again.
        .ignored_files(true)
        .min_size(options.min_size)
        .excludes(Arc::clone(&options.excludes));
    std::thread::spawn(move || {
        let reporting = post.clone();
        let outcome = walker.run(move |found| {
            // A closed channel means the reader has quit. Nothing to do about it here, and
            // the walk stops on its own when it finishes.
            let _ = reporting.send(Message::Found(found));
        });
        let _ = post.send(Message::Scanned(outcome));
    })
}

/// Starts a removal, reporting each target as it finishes and the whole thing at the end.
///
/// The handle is kept by the loop, which will not leave until this thread is done: see
/// [`View::wants_to_quit`].
fn spawn_delete(options: &Options, targets: Vec<PathBuf>, post: Sender<Message>) -> JoinHandle<()> {
    let planner = Planner::new(&options.root)
        .one_file_system(options.one_file_system)
        .older_than(options.older_than);
    std::thread::spawn(move || {
        // Re-planned rather than the plan the question was asked about, and the reason is
        // #595's: a plan is a set of `stat`s taken at a moment, and the moment has passed.
        // The targets are the ones the reader confirmed, so nothing new can enter the batch —
        // this can only refuse more, never less.
        let plan = planner.plan(targets.iter().map(Target::at));
        let reporting = post.clone();
        let removal = Deleter::new()
            .watching(move |step| {
                let _ = reporting.send(Message::Removing(step.clone()));
            })
            .remove(&plan);
        // Posted before the thread ends, which is what lets `reap` read a finished thread
        // with an empty channel as "this one died without saying anything".
        let _ = post.send(Message::Deleted(Box::new(removal)));
    })
}

/// The **one** thread that prices subtrees a reader has asked about, and the queue into it.
///
/// A full [`SizeMode::Breakdown`] whatever the command line asked for, and that is the whole
/// gesture: `--breakdown-under` scopes what the *scan* pays for, and this is the reader
/// pointing at one more subtree afterwards and paying for that one too. It stays on one
/// filesystem when the run does, because what the deleter will not cross the measurer must
/// not count.
///
/// # One worker, not one per gesture
///
/// A double click is a gesture a reader can repeat faster than a traversal of a real
/// `node_modules` finishes, so a thread per press is an unbounded number of concurrent full
/// walks over the same disk — which is slower than doing them in turn as well as unbounded.
/// Requests queue here instead, and there is only ever one of these in a run because
/// [`drive`] holds a single [`Option`] of its sender.
///
/// The queue cannot grow without bound either, and that guarantee is the *view's*:
/// [`View::price_row`] refuses a claim it has already asked about, so what can be waiting
/// here is at most the unpriced claims in the tree rather than however many times somebody
/// pressed the button.
///
/// Detached and unjoined, for the walk's reason rather than the removal's: it only reads, so
/// abandoning one at the end of a run costs nothing. It ends on its own when [`drive`] drops
/// the sender — which is why a run that never prices anything never starts it at all.
fn spawn_pricer(options: &Options, post: Sender<Message>) -> Sender<Vec<PathBuf>> {
    let (ask, queue) = channel::<Vec<PathBuf>>();
    let measurer = Measurer::new(SizeMode::Breakdown).same_file_system(options.one_file_system);
    std::thread::spawn(move || {
        while let Ok(claims) = queue.recv() {
            let mut errors = Vec::new();
            for path in &claims {
                let metadata = match std::fs::symlink_metadata(path) {
                    Ok(metadata) => metadata,
                    // The directory has gone since the scan claimed it. Not a failure of the
                    // run — somebody else's `rm` is a fact about the machine — but it is why
                    // the row is about to keep its dash, so it is said rather than swallowed.
                    Err(err) => {
                        errors.push(WalkError {
                            path: Some(path.clone()),
                            forbidden: err.kind() == io::ErrorKind::PermissionDenied,
                            message: err.to_string(),
                        });
                        continue;
                    }
                };
                let sized = measurer.measure(path, &metadata);
                errors.extend(sized.unreadable.into_iter().map(|path| WalkError {
                    path: Some(path),
                    message: "unreadable, so this size is a lower bound".to_owned(),
                    forbidden: false,
                }));
                let _ = post.send(Message::Found(Found::Priced(Priced {
                    path: path.clone(),
                    size: sized.size,
                })));
            }
            // The claims go back with the report, because the view is holding them as "being
            // priced" and nothing else knows which ones this pass had.
            let _ = post.send(Message::Repriced { claims, errors });
        }
    });
    ask
}

/// One line about what the scan found, for the notification that says it is over.
///
/// The header's own numbers rather than a second phrasing of them: somebody who comes back to
/// a notification and then looks at the screen has to be able to see the same run described.
fn scanned(view: &View) -> String {
    let total = view.total();
    format!(
        "{} reclaimable in {}",
        human(total.bytes),
        plural(total.claims, "directory", "directories")
    )
}

/// One line about what a removal did, for the footer.
///
/// Failures and refusals are named as counts rather than swallowed: a batch where half the
/// targets were left standing has to say so, and the rows are still there to be looked at.
///
/// Naming one is also what decides how long the sentence lasts. A clean removal is a
/// [`Notice::passing`] — the reader's next keystroke has seen it off, and the tree it describes
/// is the tree in front of them. A removal that left something behind is a
/// [`Notice::standing`]: those counts are what the run exits non-zero on, so this line is the
/// only place a reader who is not reading the exit status learns of them, and an arrow key
/// pressed while reading must not be what takes it away.
fn summarise(removal: &Removal) -> Notice {
    let mut said = vec![format!(
        "removed {} from {}",
        human(removal.bytes_freed()),
        plural(removal.removed.len(), "directory", "directories")
    )];
    if !removal.kept.is_empty() {
        said.push(format!(
            "{} left alone",
            plural(removal.kept.len(), "directory", "directories")
        ));
    }
    if !removal.failures.is_empty() {
        said.push(format!(
            "{} failed",
            plural(removal.failures.len(), "directory", "directories")
        ));
    }
    let said = said.join(", ");
    if removal.kept.is_empty() && removal.failures.is_empty() {
        Notice::passing(said)
    } else {
        Notice::standing(said)
    }
}

/// The size mode a live view runs under.
///
/// A scoped breakdown is honoured as given — that flag is a request to price one subtree and
/// nothing else. Everything else becomes a full breakdown, including the `Skip` that is the
/// listing's default: see the module docs for why a tree of dashes is not a front end.
#[must_use]
pub fn size_mode(asked: SizeMode) -> SizeMode {
    match asked {
        SizeMode::BreakdownUnder(scope) => SizeMode::BreakdownUnder(scope),
        SizeMode::Skip | SizeMode::Breakdown => SizeMode::Breakdown,
    }
}

#[cfg(test)]
mod tests {
    use super::{
        Batch, Chrome, Decor, Drawn, Maps, Message, Options, Outcome, Placed, Restore, Screen,
        SizeMode, drain, map, reap, spawn_pricer, summarise,
    };
    use crate::delete::{Failure, Refusal, Refused, Removal, Removed};
    use crate::fixture::priced;
    use crate::tree::Tree;
    use crate::tui::chrome::XTERM_STACK;
    use crate::tui::state::View;
    use crate::walk::{Found, WalkError, WalkOutcome};
    use ratatui::layout::Rect;
    use std::path::Path;
    use std::sync::mpsc::channel;

    fn view() -> View {
        View::new(Tree::new("/scan"))
    }

    #[test]
    fn a_pane_with_no_cell_size_to_draw_in_answers_with_the_reason_rather_than_with_nothing() {
        // The seam `drive`'s reconciliation guards, driven directly. It cannot be reached
        // through the loop while the gate and the pane are both taken from one reading of the
        // window — which is the whole of the fix — so this is what keeps the backstop honest:
        // if a later change ever hands `map` a pane the cell size cannot fill, the answer
        // names which gate refused instead of being the `Ok(())` that made #656 silent.
        let mut tree = Tree::new("/scan");
        tree.insert(priced("/scan/nx/node_modules", 8 * 1024 * 1024));
        let mut view = View::new(tree);
        view.allow_maps(Maps::Can);
        view.sync();
        let mut screen = Screen::new(Vec::new(), true);
        let placed = Placed {
            map: Some(Rect::new(60, 1, 40, 20)),
            ..Placed::default()
        };

        assert_eq!(
            map(&mut screen, &view, &placed, None).unwrap(),
            Drawn::Cannot(Maps::Unmeasured)
        );
        assert!(screen.sink().is_empty(), "an image was sized from a guess");

        // …and the same pane, once the terminal will say how big a cell is, is a picture.
        assert_eq!(
            map(&mut screen, &view, &placed, Some((9, 19))).unwrap(),
            Drawn::Map
        );
        assert!(!screen.sink().is_empty());
    }

    fn removed(path: &str) -> Removed {
        Removed {
            path: path.into(),
            bytes: 1024,
            entries: 3,
            complete: true,
        }
    }

    #[test]
    fn a_scan_that_could_not_read_a_path_is_not_a_whole_run() {
        let (post, inbox) = channel();
        let mut view = view();
        let mut outcome = Outcome::default();
        assert!(outcome.whole());

        post.send(Message::Found(Found::Claim(priced("/scan/a/target", 8))))
            .unwrap();
        post.send(Message::Scanned(WalkOutcome {
            errors: vec![WalkError {
                path: Some("/scan/locked".into()),
                message: "Permission denied".to_owned(),
                forbidden: true,
            }],
            ..WalkOutcome::default()
        }))
        .unwrap();
        drain(&mut view, &inbox, &mut outcome);

        // The header says so on screen, and this is the same fact reaching a script. Tested
        // through the real drain rather than through a terminal, because the terminal is the
        // one part of this that a test cannot have.
        assert_eq!(outcome.errors.len(), 1);
        assert!(!outcome.whole());
        assert!(!view.is_scanning());
    }

    #[test]
    fn a_removals_progress_reaches_the_rows_and_the_freed_counter_from_one_event() {
        use crate::delete::{Freeing, Step};
        use crate::size::Size;
        use std::time::Instant;

        let (post, inbox) = channel();
        let mut tree = Tree::new("/scan");
        tree.insert(crate::fixture::hit(
            "/scan/app/node_modules",
            Size::Measured(1000),
            0,
        ));
        let mut view = View::new(tree);
        view.viewport(20);
        let mut outcome = Outcome::default();
        let start = Instant::now();
        view.animate(start);
        assert_eq!(view.drawn_total().bytes, 1000);
        assert!(!view.has_freed());

        // What the deleter says while it is working. The wiring is the point of this test:
        // the same event has to reach the row's number and the freed counter, because the
        // two moving in opposite directions is only true if they are the same bytes.
        post.send(Message::Removing(Step::Freeing(Freeing {
            path: "/scan/app/node_modules".into(),
            bytes: 600,
            entries: 12,
        })))
        .unwrap();
        drain(&mut view, &inbox, &mut outcome);
        view.animate(start);

        assert_eq!(view.drawn_total().bytes, 400);
        assert_eq!(view.drawn_freed(), 600);
        // Still on disk, still on screen, and not yet dimmed — it is emptying, not emptied.
        let row = view
            .tree()
            .find(Path::new("/scan/app/node_modules"))
            .unwrap();
        assert!(view.is_freeing(row));
        assert!(!view.is_spent(row));

        post.send(Message::Removing(Step::Finished(Removed {
            path: "/scan/app/node_modules".into(),
            bytes: 1000,
            entries: 20,
            complete: true,
        })))
        .unwrap();
        drain(&mut view, &inbox, &mut outcome);
        view.animate(start);

        assert_eq!(view.drawn_total().bytes, 0);
        assert_eq!(view.drawn_freed(), 1000);
        assert!(view.is_spent(row));
    }

    #[test]
    fn a_real_deleter_reports_paths_the_view_can_find_its_rows_by() {
        use crate::delete::{Deleter, Planner, Target};
        use crate::size::Size;
        use crate::tui::keymap::Turn;
        use crate::tui::state::Effect;
        use std::time::Instant;

        // Every other test in this module posts messages it wrote itself, so the paths match
        // the tree by construction and the halves can never be caught disagreeing. This one
        // lets the **deleter** choose them.
        //
        // That is the whole bug this pins. The tree is keyed on the spelling the walk produced
        // — `.`-relative for a bare `pristine` — and the planner resolves every target before
        // touching it, so the two spell one directory two ways. Report the resolved one and
        // every `tree.find` in the view misses. Nothing errors: rows never empty, no row ever
        // leaves, the headline reclaimable total never falls, and the only thing that moves is
        // the position, which needs no path. A reader watching 150 GiB be deleted sees a
        // completely still screen and a percentage climbing to 100.
        let tmp = tempfile::TempDir::new().unwrap();
        let base = std::fs::canonicalize(tmp.path()).unwrap();
        std::fs::create_dir_all(base.join("real")).unwrap();
        // A name for the root that is not its canonical one, which is what `.` is to a bare
        // run. A symlink because it is deterministic; the relative case is the common one.
        let root = base.join("link");
        std::os::unix::fs::symlink(base.join("real"), &root).unwrap();
        let target = root.join("app/node_modules");
        std::fs::create_dir_all(target.join("dep")).unwrap();
        std::fs::write(target.join("dep/index.js"), vec![b'x'; 8192]).unwrap();

        let mut tree = Tree::new(&root);
        tree.insert(crate::fixture::hit(
            target.to_str().unwrap(),
            Size::Measured(8192),
            0,
        ));
        let mut view = View::new(tree);
        view.viewport(20);
        let start = Instant::now();
        view.animate(start);
        assert_eq!(view.drawn_total().bytes, 8192);

        // Through the real confirmation, and the deed is whatever **it** hands back. Building
        // the plan from a path of the test's own choosing would step over the half of this that
        // lives in the dialog: the batch it produces is what decides which spelling the deleter
        // is given, and therefore which one comes back.
        view.ask(&Planner::new(&root).plan([Target::at(&target)]));
        view.apply(Action::Highlight(Turn::Next));
        let deed = view.apply(Action::Answer);
        assert_eq!(view.removing().unwrap().weighed(), Some((0, 8192)));
        let Effect::Delete(deed) = deed else {
            panic!("the confirmation did not produce a removal: {deed:?}");
        };

        let (post, inbox) = channel();
        let plan = Planner::new(&root).plan(deed.iter().map(Target::at));
        let reporting = post.clone();
        let removal = Deleter::new()
            .watching(move |step| {
                let _ = reporting.send(Message::Removing(step.clone()));
            })
            .remove(&plan);
        assert!(removal.is_clean(), "{:?}", removal.failures);
        let mut outcome = Outcome::default();
        drain(&mut view, &inbox, &mut outcome);
        view.animate(start);

        // The row emptied and left, which is only true if the deleter's paths found it.
        let row = view
            .tree()
            .find(&target)
            .expect("the row is still in the tree");
        assert!(
            view.is_spent(row),
            "the row never emptied, so the report never found it"
        );
        assert_eq!(view.drawn_total().bytes, 0);
        // …and the footer's byte figure moved with it, rather than sitting at zero of the
        // batch's weight for the whole run.
        let (freed, planned) = view.removing().unwrap().weighed().unwrap();
        assert_eq!(planned, 8192);
        assert!(freed > 0, "the batch freed {freed} of {planned}");
    }

    #[test]
    fn the_batchs_position_advances_on_a_target_the_deleter_could_not_touch() {
        use crate::delete::Step;

        let (post, inbox) = channel();
        let mut view = view();
        let mut outcome = Outcome::default();
        // One target, and the deleter fails on it before unlinking anything — so there is no
        // `Finished` and no row to move, only the pool saying it has moved on.
        view.deleting_for_test();
        assert_eq!(view.removing().unwrap().counted(), (0, 1));

        post.send(Message::Removing(Step::Swept("/scan/a/target".into())))
            .unwrap();
        drain(&mut view, &inbox, &mut outcome);

        // The wiring is the point: a missing arm here would leave the bar at zero for the
        // whole run and say nothing about it.
        assert_eq!(view.removing().unwrap().counted(), (1, 1));
        assert_eq!(view.removing().unwrap().percent(), 100);
    }

    #[test]
    fn a_removal_that_failed_is_not_a_whole_run_and_a_removal_that_was_refused_is() {
        let (post, inbox) = channel();
        let mut view = view();
        let mut outcome = Outcome::default();

        // A refusal is the safety model working, which is exactly the distinction
        // `Removal::is_clean` draws — and the listing exits zero on one.
        post.send(Message::Deleted(Box::new(Removal {
            removed: vec![removed("/scan/a/target")],
            kept: vec![Refused {
                path: "/scan/b/node_modules".into(),
                reason: Refusal::HoldsCheckout,
            }],
            failures: Vec::new(),
        })))
        .unwrap();
        drain(&mut view, &inbox, &mut outcome);
        assert!(outcome.whole());
        assert!(view.notice().unwrap().contains("left alone"));

        post.send(Message::Deleted(Box::new(Removal {
            removed: Vec::new(),
            kept: Vec::new(),
            failures: vec![Failure {
                path: "/scan/c/target".into(),
                message: "Device or resource busy".to_owned(),
            }],
        })))
        .unwrap();
        drain(&mut view, &inbox, &mut outcome);
        assert_eq!(outcome.failures, 1);
        assert!(!outcome.whole());
    }

    #[test]
    fn a_removal_that_ended_without_reporting_does_not_leave_the_view_unable_to_quit() {
        let (post, inbox) = channel();
        let mut view = view();
        let mut outcome = Outcome::default();
        // A thread that has already ended, having said nothing — which is what a panic on
        // the pool would look like from here.
        let dead = std::thread::spawn(|| {});
        while !dead.is_finished() {
            std::thread::yield_now();
        }
        view.deleting_for_test();

        reap(&mut view, &inbox, &mut outcome, Some(&dead));

        assert!(!view.is_deleting(), "the view would never quit again");
        assert_eq!(outcome.failures, 1);
        drop(post);
    }

    #[test]
    fn a_removal_that_reported_on_its_way_out_is_read_rather_than_called_a_failure() {
        let (post, inbox) = channel();
        let mut view = view();
        let mut outcome = Outcome::default();
        let dead = std::thread::spawn(|| {});
        while !dead.is_finished() {
            std::thread::yield_now();
        }
        view.deleting_for_test();
        // The report is posted before the thread ends, so a finished thread can still have
        // something on the channel. Calling that a failure would fail every clean removal.
        post.send(Message::Deleted(Box::default())).unwrap();

        reap(&mut view, &inbox, &mut outcome, Some(&dead));

        assert!(!view.is_deleting());
        assert_eq!(outcome.failures, 0);
        assert!(outcome.whole());
    }

    #[test]
    fn a_batch_waits_for_its_removal_however_the_scope_ends() {
        use std::sync::Arc;
        use std::sync::atomic::{AtomicBool, Ordering};

        let finished = Arc::new(AtomicBool::new(false));
        let worker = Arc::clone(&finished);
        {
            let mut batch = Batch::default();
            batch.takes_over(std::thread::spawn(move || {
                std::thread::sleep(std::time::Duration::from_millis(50));
                worker.store(true, Ordering::SeqCst);
            }));
            // …and here the scope ends, which is what a `?`, a `break` and a panic all do.
        }
        assert!(
            finished.load(Ordering::SeqCst),
            "the removal was abandoned rather than waited for"
        );
    }

    #[test]
    fn one_pricing_worker_answers_a_queue_of_requests_and_ends_when_the_loop_lets_go() {
        // The other half of the bound. The view refuses to ask twice for a claim it is
        // already waiting on; this is what makes the requests that *do* get through cost one
        // traversal at a time rather than one thread each.
        let tmp = tempfile::TempDir::new().unwrap();
        let first = tmp.path().join("a/node_modules");
        let second = tmp.path().join("b/node_modules");
        for dir in [&first, &second] {
            std::fs::create_dir_all(dir).unwrap();
            std::fs::write(dir.join("f.js"), "xxxx").unwrap();
        }

        let (post, inbox) = channel();
        let queue = spawn_pricer(
            &Options {
                root: tmp.path().to_path_buf(),
                min_size: crate::DEFAULT_MIN_SIZE,
                size_mode: SizeMode::Skip,
                one_file_system: true,
                older_than: None,
                ignored_files: false,
                excludes: std::sync::Arc::new(ignore::gitignore::Gitignore::empty()),
            },
            post,
        );
        queue.send(vec![first.clone()]).unwrap();
        queue.send(vec![second.clone()]).unwrap();

        // Both requests answered, in the order they were queued, by the one worker.
        let mut reported = Vec::new();
        let mut sized = 0;
        while reported.len() < 2 {
            match inbox.recv().unwrap() {
                Message::Repriced { claims, errors } => {
                    assert!(errors.is_empty(), "{errors:?}");
                    reported.push(claims);
                }
                // Each claim's price goes out on its own first, exactly as the walk's do,
                // so a row fills in without waiting for the rest of its batch.
                Message::Found(Found::Priced(priced)) => {
                    assert!(priced.size.bytes().is_some_and(|bytes| bytes > 0));
                    sized += 1;
                }
                _ => panic!("the pricer said something else"),
            }
        }
        assert_eq!(reported, [vec![first], vec![second]]);
        assert_eq!(sized, 2);

        // The claims come back with the report, which is what lets the view stop holding
        // them — and the worker ends when the loop drops the queue rather than parking for
        // the life of the process. Nothing else holds a sender, so the channel disconnects.
        drop(queue);
        assert!(matches!(inbox.recv(), Err(std::sync::mpsc::RecvError)));
    }

    #[test]
    fn a_summary_names_what_was_left_behind_as_well_as_what_went() {
        let removal = Removal {
            removed: vec![removed("/scan/a/target")],
            kept: vec![Refused {
                path: "/scan/b".into(),
                reason: Refusal::HoldsCheckout,
            }],
            failures: vec![Failure {
                path: "/scan/c".into(),
                message: "busy".to_owned(),
            }],
        };
        let notice = summarise(&removal);
        let said = notice.said();
        assert!(said.contains("removed 1.0 KiB from 1 directory"), "{said}");
        assert!(said.contains("1 directory left alone"), "{said}");
        assert!(said.contains("1 directory failed"), "{said}");
        // Naming either of them is what makes the sentence wait to be dismissed: these counts
        // are what the run exits non-zero on, so an arrow key must not be what clears them.
        assert!(notice.stands(), "{said}");
    }

    #[test]
    fn a_removal_that_left_nothing_behind_does_not_have_to_be_dismissed() {
        let notice = summarise(&Removal {
            removed: vec![removed("/scan/a/target")],
            ..Removal::default()
        });
        assert_eq!(notice.said(), "removed 1.0 KiB from 1 directory");
        // Nothing was refused and nothing failed, so there is nothing here a reader has to be
        // given the chance to have seen: the next thing they do takes it away.
        assert!(!notice.stands());
    }

    // ---- the pointer's gestures -------------------------------------------------------
    //
    // The three facts the loop holds that a mouse event cannot see: whether a press has
    // already moved, what it landed on, and whether one landed on this same thing a moment
    // ago. Asserted here rather than through a terminal, because a test cannot press a
    // button on a real one — and because `Pointer` is where the whole gesture lives.

    use super::{Action, Motion, Pointer};
    use crate::tree::Order;
    use crate::tui::render::{Spot, Zone};
    use ratatui::crossterm::event::{MouseButton, MouseEventKind};
    use std::time::{Duration, Instant};

    fn down() -> MouseEventKind {
        MouseEventKind::Down(MouseButton::Left)
    }

    fn up() -> MouseEventKind {
        MouseEventKind::Up(MouseButton::Left)
    }

    fn row(id: crate::tree::NodeId) -> Spot {
        Spot::Row {
            id,
            zone: Zone::Name,
        }
    }

    #[test]
    fn a_press_aims_and_the_click_happens_when_it_is_let_go() {
        let mut pointer = Pointer::default();
        let now = Instant::now();
        let heading = Spot::Heading(Order::Age);

        // The rule the deferred click exists for. A press that acted would have re-sorted
        // the tree by the time a drag could decline to act again.
        assert_eq!(pointer.read(down(), heading, now), Action::Ignore);
        assert_eq!(pointer.read(up(), heading, now), Action::SortBy(Order::Age));
        // …and a release with nothing behind it — a button that went down before pristine
        // was reporting — is not a click either.
        assert_eq!(pointer.read(up(), heading, now), Action::Ignore);
    }

    #[test]
    fn a_press_that_moved_is_a_drag_and_never_becomes_a_click() {
        let mut pointer = Pointer::default();
        let now = Instant::now();
        let heading = Spot::Heading(Order::Size);

        pointer.read(down(), heading, now);
        assert_eq!(
            pointer.read(MouseEventKind::Drag(MouseButton::Left), Spot::Tree, now),
            Action::Ignore
        );
        // Sticky: a hand that wandered a cell and came back has still dragged, so the
        // release finishes nothing however close to the press it lands.
        assert_eq!(pointer.read(up(), heading, now), Action::Ignore);
    }

    #[test]
    fn a_drag_cannot_be_half_of_a_double_click() {
        let mut pointer = Pointer::default();
        let now = Instant::now();

        // Drag a selection out of a row, then press where the drag started. Without the
        // rule, that second press completes a double and prices a subtree the reader was
        // aiming to select from.
        pointer.read(down(), row(4), now);
        pointer.read(MouseEventKind::Drag(MouseButton::Left), row(4), now);
        pointer.read(up(), row(4), now);

        pointer.read(down(), row(4), now + Duration::from_millis(50));
        assert_eq!(
            pointer.read(up(), row(4), now + Duration::from_millis(50)),
            Action::Select(4)
        );
    }

    #[test]
    fn a_completed_double_click_starts_over_rather_than_arming_the_next_press() {
        let mut pointer = Pointer::default();
        let mut now = Instant::now();
        let click = |pointer: &mut Pointer, now: Instant| {
            pointer.read(down(), row(9), now);
            pointer.read(up(), row(9), now)
        };

        assert_eq!(click(&mut pointer, now), Action::Select(9));
        now += Duration::from_millis(50);
        assert_eq!(click(&mut pointer, now), Action::Price(9));
        // The third press of a triple is a first press again. Without this, leaning on the
        // button prices the row over and over and a triple click is two doubles.
        now += Duration::from_millis(50);
        assert_eq!(click(&mut pointer, now), Action::Select(9));
    }

    #[test]
    fn two_presses_far_enough_apart_are_two_clicks() {
        let mut pointer = Pointer::default();
        let now = Instant::now();
        pointer.read(down(), row(2), now);
        pointer.read(up(), row(2), now);

        let late = now + super::DOUBLE_CLICK + Duration::from_millis(1);
        pointer.read(down(), row(2), late);
        assert_eq!(pointer.read(up(), row(2), late), Action::Select(2));
    }

    #[test]
    fn a_row_that_moved_under_a_steady_finger_is_a_first_press_and_not_a_double() {
        let mut pointer = Pointer::default();
        let now = Instant::now();

        // The same cell, 50 ms apart, holding a different directory — which is what a price
        // landing between two presses does to a level sorted by size. Judged on coordinates
        // this would price the stranger that fell into the position; judged on the spot it
        // selects, which is what a first press means.
        pointer.read(down(), row(4), now);
        pointer.read(up(), row(4), now);
        pointer.read(down(), row(11), now + Duration::from_millis(50));
        assert_eq!(
            pointer.read(up(), row(11), now + Duration::from_millis(50)),
            Action::Select(11)
        );
    }

    #[test]
    fn the_wheel_needs_no_press_behind_it() {
        let mut pointer = Pointer::default();
        assert_eq!(
            pointer.read(MouseEventKind::ScrollDown, Spot::Tree, Instant::now()),
            Action::ScrollRows(Motion::Down)
        );
        assert_eq!(
            pointer.read(MouseEventKind::ScrollUp, Spot::Tree, Instant::now()),
            Action::ScrollRows(Motion::Up)
        );
    }

    #[test]
    fn the_buttons_pristine_does_not_use_are_left_to_the_terminals_own_menus() {
        let mut pointer = Pointer::default();
        let now = Instant::now();
        for kind in [
            MouseEventKind::Down(MouseButton::Right),
            MouseEventKind::Up(MouseButton::Right),
            MouseEventKind::Down(MouseButton::Middle),
        ] {
            assert_eq!(pointer.read(kind, row(1), now), Action::Ignore, "{kind:?}");
        }
        // …and a right-button press does not arm a left-button release either.
        pointer.read(MouseEventKind::Down(MouseButton::Right), row(1), now);
        assert_eq!(pointer.read(up(), row(1), now), Action::Ignore);
    }

    #[test]
    fn restoring_the_terminal_attempts_every_step_that_was_reached() {
        // The states are global to the process, so what is asserted here is the bookkeeping:
        // `finish` undoes exactly what was entered, and having run it, `Drop` has nothing
        // left to do. That is the whole of what the early-failure path depends on — a flag
        // still set is a step Drop would take a second time, and a flag never set is a step
        // neither of them would take at all.
        //
        // It really does call `disable_raw_mode` and leave the alternate screen, on a process
        // that is in neither state. Both are no-ops there, and the escape sequence goes to
        // the harness's captured stdout.
        let mut restore = Restore::new(
            Chrome::new(Vec::new(), Decor::silent()),
            Screen::new(Vec::new(), false),
        );
        assert!(restore.finish().is_ok(), "nothing was taken");

        restore.raw = true;
        restore.alternate = true;
        restore.mouse = true;
        assert!(restore.finish().is_ok());
        assert!(!restore.raw, "raw mode would be disabled twice");
        assert!(
            !restore.alternate,
            "the alternate screen would be left twice"
        );
        // The sharpest case of the rule, because its failure is the one nothing in the
        // process is still alive to notice: a shell left reporting the mouse answers every
        // movement of the hand with escape gibberish.
        assert!(!restore.mouse, "the mouse would be released twice");
    }

    #[test]
    fn the_decorations_are_handed_back_by_the_same_guard_and_not_a_second_one() {
        // The reason the chrome is a field of `Restore` rather than a guard beside it. What
        // is asserted is that the ordinary way out and the drop path are one path: `finish`
        // does the whole undoing, and `Drop` afterwards has nothing left to write.
        let mut restore = Restore::new(
            Chrome::new(
                Vec::new(),
                Decor {
                    sync: true,
                    title: Some(XTERM_STACK),
                    progress: true,
                    notify: None,
                    graphics: false,
                },
            ),
            Screen::new(Vec::new(), false),
        );
        restore.chrome.enter().unwrap();
        restore.chrome.begin_frame().unwrap();
        restore.finish().unwrap();

        let said = String::from_utf8(restore.chrome.sink().clone()).unwrap();
        assert!(said.contains("\x1b[?2026l"), "a frozen screen: {said:?}");
        assert!(said.contains("\x1b]9;4;0;0\x07"), "the bar was left up");
        assert!(said.ends_with("\x1b[23;2t"), "the title was not put back");

        // And this is exactly what `Drop` runs a moment later, on every path that returns
        // through a `?`. Undoing it twice would pop a title this run never pushed.
        restore.finish().unwrap();
        assert_eq!(
            restore.chrome.sink().len(),
            said.len(),
            "the undoing was written a second time"
        );
    }
}

/// Driving the event loop itself, which needs a terminal that can be made to fail and a
/// keyboard that can be made to type.
///
/// The findings this exists for were all in the loop, and all of the same shape: an exit the
/// happy path does not take. There is no way to reach one from outside without these two
/// seams, which is exactly why they are here.
#[cfg(test)]
mod loop_tests {
    use super::{Chrome, Decor, Events, Options, Screen, drive};
    use crate::Ruleset;
    use crate::size::SizeMode;
    use crate::tui::chrome::XTERM_STACK;
    use ratatui::Terminal;
    use ratatui::backend::{Backend, TestBackend, WindowSize};
    use ratatui::buffer::Cell;
    use ratatui::crossterm::event::{
        Event, KeyCode, KeyEvent, KeyModifiers, MouseButton, MouseEvent, MouseEventKind,
    };
    use ratatui::layout::{Position, Size};
    use std::io;
    use std::path::{Path, PathBuf};
    use std::sync::Arc;
    use std::sync::atomic::{AtomicBool, Ordering};
    use std::time::{Duration, Instant};
    use tempfile::TempDir;

    /// A result from a backend that cannot fail, in the shape of one that can.
    fn never<T>(result: Result<T, std::convert::Infallible>) -> io::Result<T> {
        result.map_err(|never| match never {})
    }

    /// A terminal that stops working the moment something else says so.
    ///
    /// Every method delegates; only `draw` reads the flag. That is the narrowest injection
    /// that reaches the `?` under test, and it is a real `io::Error` on the real code path
    /// rather than a branch added for the test.
    struct Flaky {
        inner: TestBackend,
        broken: Arc<AtomicBool>,
        /// A terminal that answers `TIOCGWINSZ` with zeros in the pixel fields.
        ///
        /// Which is not an exotic terminal: tmux does not forward them, so this is what every
        /// run inside one sees, however capable the terminal outside it is. It is the whole
        /// of #656 — the allowlist says yes and the window size says nothing.
        blind: bool,
    }

    impl Backend for Flaky {
        type Error = io::Error;

        fn draw<'a, I>(&mut self, content: I) -> io::Result<()>
        where
            I: Iterator<Item = (u16, u16, &'a Cell)>,
        {
            if self.broken.load(Ordering::SeqCst) {
                return Err(io::Error::other("the terminal went away"));
            }
            never(self.inner.draw(content))
        }

        fn hide_cursor(&mut self) -> io::Result<()> {
            never(self.inner.hide_cursor())
        }

        fn show_cursor(&mut self) -> io::Result<()> {
            never(self.inner.show_cursor())
        }

        fn get_cursor_position(&mut self) -> io::Result<Position> {
            never(self.inner.get_cursor_position())
        }

        fn set_cursor_position<P: Into<Position>>(&mut self, position: P) -> io::Result<()> {
            never(self.inner.set_cursor_position(position))
        }

        fn clear(&mut self) -> io::Result<()> {
            never(self.inner.clear())
        }

        fn clear_region(&mut self, clear_type: ratatui::backend::ClearType) -> io::Result<()> {
            never(self.inner.clear_region(clear_type))
        }

        fn size(&self) -> io::Result<Size> {
            never(self.inner.size())
        }

        fn window_size(&mut self) -> io::Result<WindowSize> {
            let window = never(self.inner.window_size())?;
            Ok(WindowSize {
                pixels: if self.blind {
                    Size::new(0, 0)
                } else {
                    window.pixels
                },
                ..window
            })
        }

        fn flush(&mut self) -> io::Result<()> {
            never(self.inner.flush())
        }
    }

    /// How long a script will keep performing before it gives up and quits anyway.
    ///
    /// Only reached by a run that has not satisfied its `until` — which may be a fault in what
    /// is being tested and may be a machine too busy to have got there yet, and nothing in here
    /// can tell those apart. So the ceiling ends the run and [`Script::why`] reports it without
    /// claiming which. The point of having one at all is that such a run *ends*, and says what
    /// it found rather than hanging with no output.
    ///
    /// **In seconds, and deliberately not in events.** An event count measures how fast this
    /// loop spins, which is the one quantity here that moves the *wrong* way under load: the
    /// script's `poll` never blocks, so a busy machine makes the loop burn its allowance
    /// faster at exactly the moment the walker it is waiting on is most starved. Measured on
    /// an idle machine a run performs about 400 events; measured under twenty-two concurrent
    /// copies of this binary, 14,533 — past the 10,000 this ceiling used to be, so it was
    /// firing on real runs and being read as a fault in whatever the next assertion tested.
    /// Wall-clock time is the honest expression of "this run has had a fair chance", because
    /// it does not depend on how many frames got drawn while nothing happened.
    ///
    /// Two orders of magnitude above the half-second a healthy run takes, because the only job
    /// left to it is ending a genuinely stuck run before the harness's own timeout does.
    const PATIENCE: Duration = Duration::from_secs(60);

    /// A reader who performs the same short phrase over and over.
    ///
    /// Repeated rather than sequenced because the loop and the walk are concurrent: the row
    /// to mark does not exist until the walker finds it, and a script that fired once would
    /// be racing that. Every event in a cycle is harmless before it is useful — `x` with an
    /// empty batch says "nothing is marked", and `→`/`Enter` on a childless row do nothing.
    struct Script {
        events: Vec<Event>,
        at: usize,
        /// Presses `q` instead of the next key, once this says the run has done its job.
        ///
        /// A `q` *inside* the cycle would undo the repetition the cycle exists for: the first
        /// pass would end the run whether or not the walker had published anything yet, so on
        /// a machine under load the `x` lands on an empty batch, nothing is removed, and the
        /// assertion fires on scheduling rather than on a fault. Measured, not guessed — the
        /// test failed that way under three spinning cores, on this commit and on the one
        /// before any of this work.
        ///
        /// So the quit is a condition, which is the discipline the sibling test already
        /// applies to breaking the terminal: wait for the thing to have actually happened.
        until: Option<Box<dyn Fn() -> bool + Send>>,
        /// How long to keep going before quitting anyway. [`PATIENCE`] unless a test is about
        /// the ceiling itself.
        patience: Duration,
        /// When the first event was read, which is the closest this can get to when [`drive`]
        /// started — the script is not built at the same moment it is handed over.
        started: Option<Instant>,
        /// How long the run had been going when the ceiling fired, if it did.
        ///
        /// Recorded rather than merely acted on, because acting on it is invisible: see
        /// [`Script::why`], which is the only thing that reads it.
        ///
        /// The duration rather than a flag, because the sentence that reports this has to name
        /// the ceiling **this** script waited out. Interpolating [`PATIENCE`] would print 60 s
        /// for a test that set its own, which is the "never invent a number" rule broken in
        /// the one place a reader has nothing else to go on.
        expired: Option<Duration>,
    }

    impl Script {
        /// A reader performing `events` over and over, patient for [`PATIENCE`].
        fn new(events: Vec<Event>) -> Self {
            Self {
                events,
                at: 0,
                until: None,
                patience: PATIENCE,
                started: None,
                expired: None,
            }
        }

        /// Presses `q` once `finished` says the run has done its job.
        fn until(mut self, finished: impl Fn() -> bool + Send + 'static) -> Self {
            self.until = Some(Box::new(finished));
            self
        }

        /// Gives up sooner than [`PATIENCE`], for the one test that is about giving up.
        fn patience(mut self, patience: Duration) -> Self {
            self.patience = patience;
            self
        }

        /// How long this script waited before giving up, or `None` if it never did — which is
        /// to say, if the run ended because it got what it was waiting for.
        fn gave_up(&self) -> Option<Duration> {
            self.expired
        }

        /// What a failing assertion says: `otherwise`, unless this script is what ended the run.
        ///
        /// **A timeout is not a verdict, and saying which it was is not this method's to do.**
        /// A script that gives up presses `q`, and `q` is indistinguishable from a reader
        /// leaving — so an assertion downstream reads a run that never got to the end as a run
        /// that got there and got it wrong, and states its own subject as the cause. That is
        /// how "the pointer marked nothing" came to be printed for a run that timed out, and
        /// it sent a reader to the hit-testing.
        ///
        /// The correction is to report and **not** to classify. A pointer that has stopped
        /// hit-testing, a planner refusing every target and a deleter that never starts all
        /// leave the condition false until the ceiling fires — which is the same observable
        /// state as a machine too busy to run the walk. Nothing here can tell those apart, so
        /// naming either one would be the same invented fact in the opposite direction:
        /// exonerating the code under test on evidence that never mentioned it, in the queue
        /// gate, where a hidden regression costs the most.
        ///
        /// So this says how long it waited, what is still on disk, and which assertion was
        /// waiting — and stops. The reader gets the two facts and draws their own conclusion.
        ///
        /// A verdict rather than an assertion of its own, which is a separate point and still
        /// holds: giving up is **not** a failure. The ceiling can fire while a removal is in
        /// flight, and the view holds the quit until that removal reports — so the run goes on
        /// to do exactly what it was asked. Only the filesystem gets to say whether the job was
        /// done; this only fills in the sentence when it says no.
        fn why(&self, otherwise: &str, target: &Path) -> String {
            let Some(waited) = self.expired else {
                return otherwise.to_owned();
            };
            format!(
                "timed out after {waited:?}: the run was still going when the script ran out of \
                 patience, and {} still holds {} files. A starved machine and a real regression \
                 both look like this from here, so this names neither — the assertion that was \
                 waiting is {otherwise:?}",
                target.display(),
                files_under(target),
            )
        }
    }

    impl Events for Script {
        /// Always an event waiting — but yielding first.
        ///
        /// The real `event::poll` blocks for its timeout, so the shipped loop spends most of
        /// its life asleep. This one cannot block, and a script that says "yes" instantly
        /// turns the loop into a spinner that holds a core against the very walker and deleter
        /// it is waiting on — hardest on the loaded machine where they can least afford it.
        ///
        /// Measured on this box, eighteen concurrent copies of these tests across fourteen
        /// cores: a run burns a median of 608 events without the yield and 234 with it. Same
        /// work, 2.6× less spinning, and the difference is time handed back to the threads the
        /// assertions are waiting for. It costs nothing on an idle machine, where there is no
        /// other runnable thread to hand over to.
        fn poll(&mut self, _timeout: Duration) -> io::Result<bool> {
            std::thread::yield_now();
            Ok(true)
        }

        fn read(&mut self) -> io::Result<Event> {
            let started = *self.started.get_or_insert_with(Instant::now);
            let waited = started.elapsed();
            if waited >= self.patience {
                // The first expiry's figure, kept: every read after this one is also past the
                // ceiling, and the number worth reporting is how long the run took to give up
                // rather than how long the quit then took to be honoured.
                self.expired.get_or_insert(waited);
            }
            let leaving =
                self.expired.is_some() || self.until.as_ref().is_some_and(|finished| finished());
            let event = if leaving {
                key(KeyCode::Char('q'))
            } else {
                self.events[self.at % self.events.len()].clone()
            };
            self.at += 1;
            Ok(event)
        }
    }

    fn key(code: KeyCode) -> Event {
        Event::Key(KeyEvent::new(code, KeyModifiers::NONE))
    }

    fn at(kind: MouseEventKind, column: u16, row: u16) -> Event {
        Event::Mouse(MouseEvent {
            kind,
            column,
            row,
            modifiers: KeyModifiers::NONE,
        })
    }

    fn files_under(dir: &Path) -> usize {
        let mut count = 0;
        let mut stack = vec![dir.to_path_buf()];
        while let Some(at) = stack.pop() {
            let Ok(entries) = std::fs::read_dir(&at) else {
                continue;
            };
            for entry in entries.flatten() {
                if entry.path().is_dir() {
                    stack.push(entry.path());
                } else {
                    count += 1;
                }
            }
        }
        count
    }

    /// A project whose `node_modules` takes long enough to remove that a failure can land in
    /// the middle of it.
    fn fixture() -> (TempDir, PathBuf) {
        let tmp = TempDir::new().unwrap();
        let target = tmp.path().join("app/node_modules");
        std::fs::create_dir_all(tmp.path().join("app")).unwrap();
        std::fs::write(tmp.path().join("app/package.json"), "{}").unwrap();
        for n in 0..40 {
            let dir = target.join(format!("p{n}"));
            std::fs::create_dir_all(&dir).unwrap();
            for f in 0..50 {
                std::fs::write(dir.join(format!("f{f}.js")), "x").unwrap();
            }
        }
        (tmp, target)
    }

    #[test]
    fn a_script_that_runs_out_of_patience_reports_a_timeout_rather_than_a_verdict() {
        // #632: the ceiling is the harness giving up, and until it said so every assertion
        // downstream reported it as the *loop* failing at whatever that assertion was about.
        // A run that never marks anything is the shape both a starved walker and a broken
        // gesture leave behind — the row never arrives either way — so this drives the same
        // loop with a phrase that cannot mark, and asserts the report keeps the two facts it
        // can see apart from the cause it cannot: nothing was removed, the script stopped
        // waiting, and which of those explains the other is left to the reader.
        let (tmp, target) = fixture();
        let mut terminal = Terminal::new(Flaky {
            inner: TestBackend::new(100, 24),
            broken: Arc::new(AtomicBool::new(false)),
            blind: false,
        })
        .unwrap();
        // `↓` and `↑` move a cursor and nothing else, so this run can only ever end on the
        // ceiling — there is no `q` in the phrase and no condition to satisfy.
        let mut idle = Script::new(vec![key(KeyCode::Down), key(KeyCode::Up)])
            .patience(Duration::from_millis(250));

        let outcome = drive(
            &mut terminal,
            &mut idle,
            &mut Chrome::new(Vec::new(), Decor::silent()),
            &mut Screen::new(Vec::new(), false),
            &Options {
                root: tmp.path().to_path_buf(),
                min_size: crate::DEFAULT_MIN_SIZE,
                size_mode: SizeMode::Skip,
                one_file_system: true,
                older_than: None,
                ignored_files: false,
                excludes: std::sync::Arc::new(ignore::gitignore::Gitignore::empty()),
            },
            Arc::new(Ruleset::builtin().unwrap()),
        )
        .unwrap();

        // It *ended*, which is the whole point of having a ceiling…
        assert!(idle.gave_up().is_some(), "the run ended some other way");
        // …nothing went, because nothing in the phrase can mark…
        assert!(target.exists(), "the phrase cannot mark, so nothing can go");
        assert!(
            outcome.whole(),
            "a run that did nothing is still a whole run"
        );

        // …and this is the fix. The sentence handed to a downstream assertion reports the two
        // things it can actually see — how long it waited, and what is still on disk — and
        // keeps the assertion that was waiting, so the reader still knows what was being asked.
        let said = idle.why("the pointer marked nothing", &target);
        assert!(said.contains("timed out after"), "{said}");
        assert!(said.contains("holds 2000 files"), "{said}");
        assert!(said.contains("\"the pointer marked nothing\""), "{said}");

        // And it stops there, which is the half a first attempt at this got wrong. This run
        // genuinely *was* starved — nothing in its phrase can mark — but a pointer that had
        // stopped hit-testing leaves exactly the same state, so a message that ruled one out
        // would be inventing the one fact it cannot observe, in the direction that hides a
        // regression. Naming neither is what keeps the queue gate able to fail on a real one.
        assert!(said.contains("names neither"), "{said}");
        assert!(
            !said.contains("NOT"),
            "the timeout exonerated the code under test: {said}"
        );

        // And the other half, without which this would just be a louder false block: a script
        // that did *not* give up hands the sentence straight back, so an ordinary failure
        // still says the ordinary thing.
        assert_eq!(
            Script::new(Vec::new()).why("the pointer marked nothing", &target),
            "the pointer marked nothing"
        );
    }

    #[test]
    fn a_terminal_that_will_not_say_how_big_a_cell_is_costs_the_tree_no_columns() {
        // #656, through the real loop. The terminal is on the allowlist *and* answers the
        // window size with zero pixels, which is what a run inside tmux sees whenever `TERM`
        // still names the terminal outside it: the allowlist reads Ghostty and says yes, and
        // tmux forwards no pixel fields at all.
        //
        // What went wrong was that the two gates were asked at different times — the
        // allowlist before the layout, the pixel size at the draw — so the pane was reserved
        // off the first and then declined by the second, and the reader got columns taken
        // from the tree with nothing in them and no sentence anywhere saying why.
        let (tmp, target) = fixture();
        let mut terminal = Terminal::new(Flaky {
            inner: TestBackend::new(100, 24),
            broken: Arc::new(AtomicBool::new(false)),
            blind: true,
        })
        .unwrap();
        // Wide enough for a map, so nothing but the missing pixel size can be what keeps the
        // pane off the screen.
        const { assert!(100 >= crate::tui::treemap::MIN_WIDTH) };
        let mut idle = Script::new(vec![key(KeyCode::Down), key(KeyCode::Up)])
            .patience(Duration::from_millis(250));
        let mut screen = Screen::new(Vec::new(), true);

        drive(
            &mut terminal,
            &mut idle,
            &mut Chrome::new(Vec::new(), Decor::silent()),
            &mut screen,
            &Options {
                root: tmp.path().to_path_buf(),
                min_size: crate::DEFAULT_MIN_SIZE,
                size_mode: SizeMode::Skip,
                one_file_system: true,
                older_than: None,
                ignored_files: false,
                excludes: std::sync::Arc::new(ignore::gitignore::Gitignore::empty()),
            },
            Arc::new(Ruleset::builtin().unwrap()),
        )
        .unwrap();
        assert!(target.exists(), "the phrase cannot mark, so nothing can go");

        // Not one byte, which was already true — the draw refused the zeros and said nothing.
        assert!(
            screen.sink().is_empty(),
            "an image was sized from a guess at the cell"
        );
        // And this is the part that was not. Row 1 is the column heading, drawn across the
        // tree's own pane on one background — so a map beside it leaves the heading short of
        // the right edge with the layout's one-column gap between the two, unstyled. An
        // unbroken run of that background to the last column is the tree having the whole
        // width, which is the thing #656 took away.
        let buffer = terminal.backend().inner.buffer().clone();
        let heading: Vec<_> = (0..buffer.area.width).map(|x| buffer[(x, 1)].bg).collect();
        assert!(
            heading
                .iter()
                .all(|bg| *bg == ratatui::style::Color::Rgb(24, 24, 30)),
            "the tree gave up columns for a map that could never be drawn in them: {heading:?}"
        );
    }

    #[test]
    fn a_terminal_that_fails_mid_removal_still_waits_for_the_batch() {
        let (tmp, target) = fixture();
        let whole = files_under(&target);
        assert_eq!(whole, 2000);

        let broken = Arc::new(AtomicBool::new(false));
        // Breaks the terminal as soon as the removal is *demonstrably* under way — a real
        // condition rather than a sleep, and the exact moment the finding is about.
        let arming = Arc::clone(&broken);
        let counting = target.clone();
        let watcher = std::thread::spawn(move || {
            while files_under(&counting) == whole {
                std::thread::yield_now();
            }
            arming.store(true, Ordering::SeqCst);
        });

        let mut terminal = Terminal::new(Flaky {
            inner: TestBackend::new(100, 24),
            broken: Arc::clone(&broken),
            blind: false,
        })
        .unwrap();
        // Mark the scan root, then ask-highlight-confirm, on repeat. The root row exists from
        // the first frame, and a mark on it covers whatever the walk finds underneath —
        // which is the streaming property doing the test's synchronisation for it.
        // Nothing to wait for: this run is ended by the terminal failing, which is the whole
        // subject of the test, so the script carries no `until`.
        let mut keys = Script::new(vec![
            key(KeyCode::Char(' ')),
            key(KeyCode::Char('x')),
            key(KeyCode::Right),
            key(KeyCode::Enter),
        ]);

        let outcome = drive(
            &mut terminal,
            &mut keys,
            &mut Chrome::new(Vec::new(), Decor::silent()),
            &mut Screen::new(Vec::new(), false),
            &Options {
                root: tmp.path().to_path_buf(),
                min_size: crate::DEFAULT_MIN_SIZE,
                size_mode: SizeMode::Skip,
                one_file_system: true,
                older_than: None,
                ignored_files: false,
                excludes: std::sync::Arc::new(ignore::gitignore::Gitignore::empty()),
            },
            Arc::new(Ruleset::builtin().unwrap()),
        );
        watcher.join().unwrap();

        // First, because a script that gave up quit on its own and the terminal never got the
        // chance to fail — which would make every sentence below this one describe the wrong
        // run. See [`Script::expired`].
        // The loop left through a `?`, which is the path that used to abandon the thread…
        assert!(
            outcome.is_err(),
            "{}",
            keys.why("the terminal was supposed to fail", &target)
        );
        // …and the batch the reader confirmed is finished rather than half done. Without the
        // join this is 2,000 files minus however many fitted into a few microseconds.
        assert!(
            !target.exists(),
            "{}",
            keys.why(
                &format!("{} survived a removal that was abandoned", target.display()),
                &target
            )
        );
    }

    #[test]
    fn a_batch_marked_with_the_pointer_is_removed_through_the_real_loop() {
        // The wiring no unit test reaches: the geometry comes back out of a real `draw`, a
        // real press is resolved against it, and the action that comes out drives the same
        // plan-confirm-delete pipeline `space` does. #602's own lesson was that the bug the
        // unit tests all missed was found by driving the whole thing at once.
        let (tmp, target) = fixture();
        let mut terminal = Terminal::new(Flaky {
            inner: TestBackend::new(100, 24),
            broken: Arc::new(AtomicBool::new(false)),
            blind: false,
        })
        .unwrap();

        // Row 0 of the tree is the scan root, and it exists from the first frame: the header
        // is line 0, the column heading is line 1, so the root's mark box is cell (0, 2).
        // The reader marks it by pressing there and letting go, which is the whole deferred
        // click — a press alone would do nothing.
        let box_of_root = (0, 2);
        // The second press of the cycle is on the root's *name* rather than its box, so that
        // a repeat of the cycle is never read as a double click. That gesture has its own
        // tests; this one is about a click.
        let name_of_root = (10, 2);
        let gone = target.clone();
        let mut hand = Script::new(vec![
            at(
                MouseEventKind::Down(MouseButton::Left),
                box_of_root.0,
                box_of_root.1,
            ),
            at(
                MouseEventKind::Up(MouseButton::Left),
                box_of_root.0,
                box_of_root.1,
            ),
            key(KeyCode::Char('x')),
            key(KeyCode::Right),
            key(KeyCode::Enter),
            at(
                MouseEventKind::Down(MouseButton::Left),
                name_of_root.0,
                name_of_root.1,
            ),
            at(
                MouseEventKind::Up(MouseButton::Left),
                name_of_root.0,
                name_of_root.1,
            ),
        ])
        // The same condition the sibling test quits on, and for the same reason: a `q`
        // inside the cycle would end the run whether or not the walker had published the
        // row the pointer is aiming at, so the assertion would fire on scheduling rather
        // than on a fault.
        .until(move || !gone.exists());

        let outcome = drive(
            &mut terminal,
            &mut hand,
            &mut Chrome::new(Vec::new(), Decor::silent()),
            &mut Screen::new(Vec::new(), false),
            &Options {
                root: tmp.path().to_path_buf(),
                min_size: crate::DEFAULT_MIN_SIZE,
                size_mode: SizeMode::Skip,
                one_file_system: true,
                older_than: None,
                ignored_files: false,
                excludes: std::sync::Arc::new(ignore::gitignore::Gitignore::empty()),
            },
            Arc::new(Ruleset::builtin().unwrap()),
        )
        .unwrap();

        // The message #632 exists for. A starved walker never publishes the row the press is
        // aiming at, so the run ends on the ceiling with the target untouched — and stating
        // "the pointer marked nothing" flatly about a run that timed out names a cause the run
        // never established. It stays as the sentence a *finished* run fails with; a timed-out
        // one gets it quoted alongside the timeout instead. See [`Script::why`].
        assert!(
            !target.exists(),
            "{}",
            hand.why("the pointer marked nothing", &target)
        );
        assert!(outcome.whole(), "{outcome:?}");
        assert!(
            tmp.path().join("app/package.json").exists(),
            "too much went"
        );
    }

    #[test]
    fn a_marked_batch_is_removed_through_the_real_loop() {
        // The same machinery, ending the ordinary way: it is worth one test that the keys, the
        // planner and the deleter meet correctly, because everything else about the loop is
        // asserted through the pieces.
        let (tmp, target) = fixture();
        // The same wrapper with the flag never set — a terminal that works, whose `Error` is
        // the `io::Error` the loop is written against.
        let mut terminal = Terminal::new(Flaky {
            inner: TestBackend::new(100, 24),
            broken: Arc::new(AtomicBool::new(false)),
            blind: false,
        })
        .unwrap();
        let gone = target.clone();
        let mut keys = Script::new(vec![
            key(KeyCode::Char(' ')),
            key(KeyCode::Char('x')),
            key(KeyCode::Right),
            key(KeyCode::Enter),
        ])
        // The target is `rmdir`ed only once every child under it is gone, so this becomes
        // true exactly when the batch the test is about has finished. A `q` before then
        // would be the script racing the walker rather than the loop doing its job — and
        // a `q` after it is held by the view anyway until the removal reports.
        .until(move || !gone.exists());

        let mut chrome = Chrome::new(
            Vec::new(),
            Decor {
                sync: true,
                title: Some(XTERM_STACK),
                progress: true,
                notify: None,
                graphics: true,
            },
        );
        // A terminal that reads the graphics protocol as well, so the map's own wiring is
        // driven by the same run: the pane is split off the body, the image is written
        // inside the synchronized update, and it is taken down when the confirmation goes up.
        let mut screen = Screen::new(Vec::new(), true);
        let outcome = drive(
            &mut terminal,
            &mut keys,
            &mut chrome,
            &mut screen,
            &Options {
                root: tmp.path().to_path_buf(),
                min_size: crate::DEFAULT_MIN_SIZE,
                size_mode: SizeMode::Skip,
                one_file_system: true,
                older_than: None,
                ignored_files: false,
                excludes: std::sync::Arc::new(ignore::gitignore::Gitignore::empty()),
            },
            Arc::new(Ruleset::builtin().unwrap()),
        )
        .unwrap();

        // The sibling test's rule: "nothing was removed" is a true sentence about the wrong
        // subject when the run never got as far as removing anything. See [`Script::why`].
        assert!(
            !target.exists(),
            "{}",
            keys.why("nothing was removed", &target)
        );
        assert!(outcome.whole(), "{outcome:?}");
        assert!(
            tmp.path().join("app/package.json").exists(),
            "too much went"
        );

        // The decorations, through the real loop rather than through the chrome on its own.
        // Balance is the property that matters: an update begun once more than it is ended is
        // a terminal that stops repainting, and it is a *run*'s worth of frames that proves
        // that rather than one call and its pair.
        let said = String::from_utf8(chrome.sink().clone()).unwrap();
        assert!(said.contains("\x1b[?2026h"), "nothing was ever wrapped");
        // Counting the two halves would pass on a run that opened every frame and then closed
        // them all at the end. What has to hold is that they alternate: one open, one close,
        // never two of either in a row.
        let mut open = 0i32;
        for frame in said.split("\x1b[?2026").skip(1) {
            match frame.as_bytes().first() {
                Some(b'h') => open += 1,
                Some(b'l') => open -= 1,
                other => panic!("a private mode nobody wrote: {other:?}"),
            }
            assert!((0..=1).contains(&open), "the frames did not alternate");
        }
        assert_eq!(open, 0, "a frame was left open");
        assert!(said.contains("\x1b]0;pristine — "), "{said:?}");
        // The bar reaches 0 only when the guard restores it, which this test does not use, so
        // what the run itself must not do is leave it at a percentage it never got to.
        assert!(said.contains("\x1b]9;4;"), "no progress was ever reported");

        // The map, through the same run. What matters is not that a picture appeared but
        // that every one of them is *balanced*: an image transmitted and never deleted is a
        // megabyte left in the terminal's memory after this process has gone.
        let drawn = String::from_utf8_lossy(screen.sink()).into_owned();
        assert!(drawn.contains("\x1b_Ga=T,"), "no map was ever drawn");
        assert!(
            drawn.matches("a=d,d=I").count() >= drawn.matches("a=T,").count(),
            "an image was transmitted without a delete to match it"
        );
        // Every placement is inside a cursor save/restore, because the cursor belongs to
        // ratatui and a frame drawn from where an image left it is a frame in the wrong place.
        assert_eq!(
            drawn.matches("\x1b7").count(),
            drawn.matches("\x1b8").count(),
            "the cursor was not put back after a placement"
        );
    }
}