diskwatch 0.5.10

Single-host, read-only disk diagnostics TUI. Eight tabs across devices, volumes, filesystems, IO, SMART, hot files, and insights. Sibling to netwatch and syswatch.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
//! btop-grade drawing primitives for the dense view.
//!
//! A port of the design handoff's `nb-braille.jsx` onto a ratatui `Buffer`.
//! Three things separate btop's graphs from a bar chart, and all three are
//! here:
//!
//! 1. **Braille cells** — 2 wide × 4 tall subpixels per character cell, so a
//!    120-column graph carries 240 samples at 4× the vertical resolution of
//!    block glyphs.
//! 2. **Vertical gradient fill** — a cell is coloured by its HEIGHT in the
//!    graph, not by the series it belongs to, so a spike's severity is
//!    readable without measuring it against the axis.
//! 3. **Derived axis ceilings** on a tight ladder, with the scale printed.
//!
//! The existing [`crate::ui::graph`] `dots` style is a different thing: one
//! sample per *cell* column, coloured by horizontal position for the fade.
//! This module's braille renderer is two samples per cell column, coloured
//! by height, with a mirrored mode for the downward-growing write graph —
//! none of which the shared module needs, and adding them there would
//! complicate every caller.
//!
//! What this module *does* share with [`crate::ui::graph`] is the style
//! choice itself: [`graph`] dispatches on the same global `GraphStyle`
//! everything else reads, drawing its own bars variant (see
//! [`graph_bars`]) rather than braille when the setting is `bars`. Without
//! that, the settings overlay's Graph style row would be a dead control
//! whenever the dense view is on screen.

#![allow(dead_code)]

use ratatui::buffer::Buffer;
use ratatui::layout::Rect;
use ratatui::style::{Color, Modifier, Style};

use crate::ui::palette;
use crate::ui::theme;

// ── braille ────────────────────────────────────────────────────────────────

/// Bit position for each (sub-column, sub-row). Braille dots are numbered 1–8
/// onto bits 0–7, and the fourth row uses dots 7 and 8 — which is why this is
/// not `row + col * 4`.
const BR_BIT: [[u8; 4]; 2] = [
    [0, 1, 2, 6], // left column,  top → bottom
    [3, 4, 5, 7], // right column, top → bottom
];
const BR_BASE: u32 = 0x2800;

// ── ramps ──────────────────────────────────────────────────────────────────

/// Which colour vocabulary a graph speaks.
///
/// **Magnitude** ramps run cool → bright, because high throughput is *busy*,
/// not *bad*: a saturated device during a restore is working. **Bounded-bad**
/// runs green → red, and is used only where the value has a ceiling that means
/// something — utilisation, capacity, wear, latency bucket.
#[derive(Debug, Clone, Copy, PartialEq, Eq)]
pub enum Ramp {
    /// Read / inbound. Green, matching the Lite family.
    Read,
    /// Write / outbound. Cyan.
    Write,
    /// Bounded-bad. Green → amber → red.
    Load,
}

// Stops are spaced by CONTRAST against the terminal background — 4.5, 6.5, 9,
// 11.5 and 14 to 1 — not by even steps through RGB.
//
// The design handoff's ramps started at #134f42 and #103f52, which measure
// 2.0:1 and 1.6:1 against #0c1418. That is below the 3:1 floor for non-text
// UI, and it lands on exactly the wrong rows: an area graph puts almost all of
// its ink near the baseline, so the fill a normal workload draws was the part
// nobody could see, while the bright end was reserved for spikes that happen
// rarely. Lifting the dark end is a deviation from the handoff and a
// deliberate one; `ramps_stay_legible_against_the_background` holds the floor.
const RAMP_READ: [(u8, u8, u8); 5] = [
    (0x22, 0x8d, 0x75),
    (0x2b, 0xad, 0x79),
    (0x5a, 0xc9, 0x8c),
    (0x7a, 0xe0, 0x9e),
    (0xa1, 0xf1, 0xbc),
];
const RAMP_WRITE: [(u8, u8, u8); 5] = [
    (0x22, 0x86, 0xae),
    (0x29, 0xa5, 0xcf),
    (0x6e, 0xc0, 0xd7),
    (0x58, 0xdb, 0xff),
    (0xa8, 0xea, 0xff),
];
const RAMP_LOAD: [(u8, u8, u8); 5] = [
    (0x5c, 0xd9, 0x89),
    (0x9f, 0xd0, 0x7a),
    (0xf0, 0xc0, 0x60),
    (0xf3, 0x9a, 0x6a),
    (0xff, 0x78, 0x78),
];

impl Ramp {
    fn stops(self) -> &'static [(u8, u8, u8); 5] {
        match self {
            Ramp::Read => &RAMP_READ,
            Ramp::Write => &RAMP_WRITE,
            Ramp::Load => &RAMP_LOAD,
        }
    }

    /// The colour at `f` ∈ 0..1 along the ramp.
    ///
    /// Under the `terminal` theme this degrades to a themed ANSI slot rather
    /// than interpolating RGB. A gradient has no 16-colour equivalent, and the
    /// whole point of that theme is that diskwatch pins no colours of its own —
    /// so magnitude ramps collapse to their base hue and the bounded-bad ramp
    /// keeps its meaning through green / yellow / red thresholds.
    pub fn at(self, f: f64) -> Color {
        let f = f.clamp(0.0, 1.0);
        if theme::active().name == "terminal" {
            return match self {
                Ramp::Read => palette::green(),
                Ramp::Write => palette::cyan(),
                Ramp::Load => {
                    if f < 0.5 {
                        palette::green()
                    } else if f < 0.8 {
                        palette::yellow()
                    } else {
                        palette::red()
                    }
                }
            };
        }
        let stops = self.stops();
        let t = f * (stops.len() - 1) as f64;
        let i = t.floor() as usize;
        if i >= stops.len() - 1 {
            let (r, g, b) = stops[stops.len() - 1];
            return Color::Rgb(r, g, b);
        }
        let frac = t - i as f64;
        let (ar, ag, ab) = stops[i];
        let (br, bg, bb) = stops[i + 1];
        let lerp = |a: u8, b: u8| (a as f64 + (b as f64 - a as f64) * frac).round() as u8;
        Color::Rgb(lerp(ar, br), lerp(ag, bg), lerp(ab, bb))
    }
}

// ── text ───────────────────────────────────────────────────────────────────

/// Draw `s` at (`x`, `y`), one cell per char, clipped to `buf`. Returns the
/// column after the string.
///
/// Clipping matters: every right-aligned label in the 2.0 layout is positioned
/// by subtracting its own length, so a fixture or a hostname one character
/// longer than expected would otherwise write outside the buffer.
pub fn text(buf: &mut Buffer, x: u16, y: u16, s: &str, fg: Color, bold: bool) -> u16 {
    let area = buf.area;
    let mut cx = x;
    for ch in s.chars() {
        if cx >= area.right() || y >= area.bottom() {
            break;
        }
        if cx >= area.x && y >= area.y {
            if let Some(cell) = buf.cell_mut((cx, y)) {
                cell.set_char(ch).set_fg(fg);
                if bold {
                    cell.set_style(Style::default().add_modifier(Modifier::BOLD));
                }
            }
        }
        cx = cx.saturating_add(1);
    }
    cx
}

/// Draw `s` so that it ENDS at column `x_end`.
pub fn text_right(buf: &mut Buffer, x_end: u16, y: u16, s: &str, fg: Color, bold: bool) {
    let w = s.chars().count() as u16;
    let x = x_end.saturating_sub(w.saturating_sub(1));
    text(buf, x, y, s, fg, bold);
}

/// Set the background of a rect without touching its glyphs.
pub fn tint(buf: &mut Buffer, x: u16, y: u16, w: u16, h: u16, bg: Color) {
    for dy in 0..h {
        for dx in 0..w {
            if let Some(cell) = buf.cell_mut((x + dx, y + dy)) {
                cell.set_bg(bg);
            }
        }
    }
}

// ── graph ──────────────────────────────────────────────────────────────────

/// Braille area graph. `vals` are 0..1 and up to `2 × area.width` long.
///
/// `flip` grows the fill DOWNWARD from the top edge, which is what mirrors the
/// write graph about the shared time axis. The gradient always runs low → high
/// along the direction of growth, so both halves brighten as traffic climbs.
///
/// `band` describes the range the caller's values occupy, and only matters for
/// a single-row graph — see the note on colouring below.
/// Entry point every dense-view graph draws through. Dispatches on the same
/// global [`crate::ui::graph::GraphStyle`] the rest of the app reads, so the
/// settings overlay's Graph style row controls Dense too instead of being a
/// dead control there.
pub fn graph(
    buf: &mut Buffer,
    area: Rect,
    vals: &[f64],
    ramp: Ramp,
    flip: bool,
    band: Option<(f64, f64)>,
) {
    if area.width == 0 || area.height == 0 {
        return;
    }
    match crate::ui::graph::active() {
        crate::ui::graph::GraphStyle::Bars => graph_bars(buf, area, vals, ramp, flip, band),
        crate::ui::graph::GraphStyle::Dots => graph_braille(buf, area, vals, ramp, flip, band),
    }
}

/// Stacked eighth-block bars — one sample per column, coloured by
/// magnitude via `ramp`, using the same glyph ladder as
/// [`crate::ui::graph`]'s `bars` style.
///
/// Two samples come in per character column (see [`graph_braille`]), and
/// bars draws at half that density; rather than average them away, the
/// louder of the pair wins, so a one-tick spike still shows at the same
/// data rate the dots style renders it at.
///
/// The downward-growing (`flip`) side — the write half of the mirrored io
/// graph — quantizes to whole rows instead of eighths: Unicode's block
/// elements have all eight lower-N-eighths glyphs (▁▂▃▄▅▆▇█) but only two
/// upper ones (▀ half, ▔ one eighth), so a smooth top-anchored ladder the
/// same resolution as the bottom-anchored one doesn't exist as single
/// glyphs.
fn graph_bars(
    buf: &mut Buffer,
    area: Rect,
    vals: &[f64],
    ramp: Ramp,
    flip: bool,
    band: Option<(f64, f64)>,
) {
    let (b_lo, b_hi) = band.unwrap_or((0.0, 1.0));
    let h = area.height as usize;
    let sub_h = h * 8;

    for cx in 0..area.width as usize {
        let lv = vals.get(cx * 2).copied().unwrap_or(0.0).max(0.0);
        let rv = vals.get(cx * 2 + 1).copied().unwrap_or(0.0).max(0.0);
        let v = lv.max(rv);
        if v <= 0.0 {
            continue;
        }
        let f = ((v - b_lo) / (b_hi - b_lo).max(f64::EPSILON)).clamp(0.0, 1.0);
        let color = ramp.at(f);
        // Floored to at least one eighth, matching graph_braille's "any
        // non-zero sample is visible" rule.
        let filled = ((v.min(1.0) * sub_h as f64).round() as usize).max(1);

        if flip {
            let rows = (filled / 8).min(h);
            for cy in 0..rows {
                if let Some(cell) = buf.cell_mut((area.x + cx as u16, area.y + cy as u16)) {
                    cell.set_char('█').set_fg(color);
                }
            }
        } else {
            for cy in 0..h {
                let from_bottom = h - 1 - cy;
                let eighths = filled.saturating_sub(from_bottom * 8).min(8);
                if eighths == 0 {
                    continue;
                }
                if let Some(cell) = buf.cell_mut((area.x + cx as u16, area.y + cy as u16)) {
                    cell.set_char(crate::ui::graph::BAR_GLYPHS[eighths])
                        .set_fg(color);
                }
            }
        }
    }
}

/// btop-style braille area plot: the dense view's original graph
/// rendering, now one of two styles [`graph`] dispatches to.
fn graph_braille(
    buf: &mut Buffer,
    area: Rect,
    vals: &[f64],
    ramp: Ramp,
    flip: bool,
    band: Option<(f64, f64)>,
) {
    let (b_lo, b_hi) = band.unwrap_or((0.0, 1.0));
    let h = area.height as usize;
    let sub_h = h * 4;

    for cx in 0..area.width as usize {
        let lv = vals.get(cx * 2).copied().unwrap_or(0.0).max(0.0);
        let rv = vals.get(cx * 2 + 1).copied().unwrap_or(0.0).max(0.0);
        // Floor any non-zero sample to at least one dot. Without this, a value
        // below 1/(2·sub_h) rounds to zero and the column is skipped — so on a
        // single-row sparkline everything under 12.5% renders blank, and a
        // quiet-but-active series reads as no data at all.
        let lh = if lv > 0.0 {
            ((lv * sub_h as f64).round() as usize).max(1)
        } else {
            0
        };
        let rh = if rv > 0.0 {
            ((rv * sub_h as f64).round() as usize).max(1)
        } else {
            0
        };
        if lh == 0 && rh == 0 {
            continue;
        }
        for cy in 0..h {
            let mut bits: u8 = 0;
            for (s, (&left, &right)) in BR_BIT[0].iter().zip(BR_BIT[1].iter()).enumerate() {
                let from_top = cy * 4 + s;
                let d = if flip { from_top + 1 } else { sub_h - from_top };
                if lh >= d {
                    bits |= 1 << left;
                }
                if rh >= d {
                    bits |= 1 << right;
                }
            }
            if bits == 0 {
                continue;
            }
            // Ramp position is normally the cell's HEIGHT in the graph, which
            // is what makes a spike's severity pre-attentive. A single-row
            // graph has one cell row, so height is constant and every cell
            // would take the same mid-ramp colour — throwing away the
            // magnitude channel exactly where it is needed most, since one
            // braille row resolves only four levels and adjacent series
            // collide in glyph space. There, sample by VALUE instead, so
            // colour separates what shape cannot.
            let f = if h == 1 {
                (((lv + rv) / 2.0 - b_lo) / (b_hi - b_lo).max(f64::EPSILON)).clamp(0.0, 1.0)
            } else {
                let mid = (cy * 4 + 2) as f64;
                if flip {
                    mid / sub_h as f64
                } else {
                    (sub_h as f64 - mid) / sub_h as f64
                }
            };
            let ch = char::from_u32(BR_BASE | bits as u32).unwrap_or(' ');
            if let Some(cell) = buf.cell_mut((area.x + cx as u16, area.y + cy as u16)) {
                cell.set_char(ch).set_fg(ramp.at(f));
            }
        }
    }
}

/// Single-row braille sparkline: four levels of subpixel, two samples per cell.
pub fn spark(
    buf: &mut Buffer,
    x: u16,
    y: u16,
    w: u16,
    vals: &[f64],
    ramp: Ramp,
    band: Option<(f64, f64)>,
) {
    graph(
        buf,
        Rect {
            x,
            y,
            width: w,
            height: 1,
        },
        vals,
        ramp,
        false,
        band,
    );
}

/// Horizontal gradient meter — btop's bounded-value idiom.
///
/// The ramp is sampled by POSITION along the bar, so the far end is always the
/// "bad" colour even when the value never reaches it. That is the whole point:
/// you can see where the danger is before you're in it.
pub fn meter(buf: &mut Buffer, x: u16, y: u16, w: u16, frac: f64, ramp: Ramp) {
    if w == 0 {
        return;
    }
    let f = if frac.is_finite() {
        frac.clamp(0.0, 1.0)
    } else {
        0.0
    };
    let filled = (f * w as f64).round() as u16;
    for i in 0..w {
        let on = i < filled;
        // A one-cell meter has no position to sample along: i/(w-1) divides by
        // zero. Narrow layouts are exactly where a panic is least acceptable.
        let pos = if w > 1 { i as f64 / (w - 1) as f64 } else { f };
        let (ch, fg) = if on {
            ('■', ramp.at(pos))
        } else {
            ('·', palette::faint())
        };
        if let Some(cell) = buf.cell_mut((x + i, y)) {
            cell.set_char(ch).set_fg(fg);
        }
    }
}

/// A meter that renders "unavailable" without changing its footprint.
///
/// `labelled` writes `--` into the empty track, because an empty track alone is
/// what a zero reading looks like and "the platform can't measure this" is a
/// different claim. Pass `false` where a `--` already sits beside the meter —
/// two of them read as a value.
pub fn meter_unavailable(buf: &mut Buffer, x: u16, y: u16, w: u16, labelled: bool) {
    for i in 0..w {
        if let Some(cell) = buf.cell_mut((x + i, y)) {
            cell.set_char('·').set_fg(palette::faint());
        }
    }
    if labelled && w >= 2 {
        text(buf, x, y, "--", palette::dim(), false);
    }
}

// ── box ────────────────────────────────────────────────────────────────────

/// A btop box: rounded corners, title embedded in the border, bracketed hotkey,
/// and information hung off both ends of both borders.
///
/// ```text
/// ╭┤1├─┤ io ├─┤ 4 physical ├──────────────┤ diskwatch 2.0 ├─╮
/// ╰─┤ ↹ device ├──────────────────┤ 52% util ├──────────────╯
/// ```
///
/// This is where the 2.0 layout wins its rows back: there is no header bar, no
/// menu bar and no status bar, because identity, hotkeys, sort state and paging
/// all live in border space that a box already spends.
#[derive(Default)]
pub struct BoxOpts<'a> {
    pub key: Option<&'a str>,
    pub title: Option<&'a str>,
    pub title_fg: Option<Color>,
    pub sub: Option<&'a str>,
    pub right: Option<&'a str>,
    pub right_fg: Option<Color>,
    /// `(key, label)` pairs for the bottom-left border.
    pub foot_l: &'a [(&'a str, &'a str)],
    pub foot_r: Option<&'a str>,
    /// Draw the border in an alert colour without moving anything.
    pub border_fg: Option<Color>,
}

/// Draws the box and returns its interior rect.
pub fn draw_box(buf: &mut Buffer, area: Rect, o: &BoxOpts) -> Rect {
    if area.width < 2 || area.height < 2 {
        return area;
    }
    let border = o.border_fg.unwrap_or_else(palette::faint);
    let (x, y, w, h) = (area.x, area.y, area.width, area.height);
    for i in 1..w - 1 {
        set(buf, x + i, y, '─', border);
        set(buf, x + i, y + h - 1, '─', border);
    }
    for j in 1..h - 1 {
        set(buf, x, y + j, '│', border);
        set(buf, x + w - 1, y + j, '│', border);
    }
    set(buf, x, y, '╭', border);
    set(buf, x + w - 1, y, '╮', border);
    set(buf, x, y + h - 1, '╰', border);
    set(buf, x + w - 1, y + h - 1, '╯', border);

    // Both border rows carry two writers, one from each end, and a narrow box
    // is exactly where they meet. Everything below is measured BEFORE anything
    // is drawn: the left side keeps its space, the right side is dropped if it
    // would reach into it, and the optional `sub` is given up first — losing a
    // device count is cheaper than losing a hotkey or overwriting a title.
    let key_w = o.key.map_or(0, |k| chars(k) + 3);
    let title_w = o.title.map_or(0, |t| chars(t) + 4);
    let sub_w = o.sub.map_or(0, |s| chars(s) + 5);
    let right_w = o.right.map_or(0, |r| chars(r) + 4);
    let border_w = w.saturating_sub(2);
    // One column of border must survive between the two, or they are touching.
    let show_sub = o.sub.is_some() && key_w + title_w + sub_w + right_w < border_w;
    let left_w = key_w + title_w + if show_sub { sub_w } else { 0 };
    let show_right = o.right.is_some() && left_w + right_w < border_w;

    let mut cx = x + 1;
    if let Some(k) = o.key {
        cx = text(buf, cx, y, "┤", border, false);
        cx = text(buf, cx, y, k, palette::yellow(), true);
        cx = text(buf, cx, y, "├─", border, false);
    }
    if let Some(t) = o.title {
        cx = text(buf, cx, y, "┤ ", border, false);
        cx = text(
            buf,
            cx,
            y,
            t,
            o.title_fg.unwrap_or_else(palette::cyan),
            true,
        );
        cx = text(buf, cx, y, " ├", border, false);
    }
    if show_sub {
        if let Some(s) = o.sub {
            cx = text(buf, cx, y, "─┤ ", border, false);
            cx = text(buf, cx, y, s, palette::dim(), false);
            text(buf, cx, y, " ├", border, false);
        }
    }
    if show_right {
        if let Some(r) = o.right {
            bracket_right(
                buf,
                area,
                y,
                r,
                o.right_fg.unwrap_or_else(palette::dim),
                border,
            );
        }
    }

    let foot_l_w: u16 = if o.foot_l.is_empty() {
        0
    } else {
        3 + o
            .foot_l
            .iter()
            .map(|(k, l)| chars(k) + chars(l))
            .sum::<u16>()
            + 2 * (o.foot_l.len() as u16 - 1)
            + 2
    };
    let foot_r_w = o.foot_r.map_or(0, |r| chars(r) + 4);
    let show_foot_r = o.foot_r.is_some() && foot_l_w + foot_r_w < border_w;

    if !o.foot_l.is_empty() {
        let fy = y + h - 1;
        let mut fx = x + 2;
        fx = text(buf, fx, fy, "┤ ", border, false);
        for (i, (k, label)) in o.foot_l.iter().enumerate() {
            if i > 0 {
                fx = text(buf, fx, fy, "  ", border, false);
            }
            fx = text(buf, fx, fy, k, palette::yellow(), true);
            fx = text(buf, fx, fy, label, palette::dim(), false);
        }
        text(buf, fx, fy, " ├", border, false);
    }
    if show_foot_r {
        if let Some(r) = o.foot_r {
            bracket_right(buf, area, y + h - 1, r, palette::dim(), border);
        }
    }

    Rect {
        x: x + 1,
        y: y + 1,
        width: w - 2,
        height: h - 2,
    }
}

/// `┤ text ├` hung off the right end of a border row, clamped so it can never
/// reach past the box's own corner.
fn bracket_right(buf: &mut Buffer, area: Rect, y: u16, s: &str, fg: Color, border: Color) {
    let inner = format!(" {s} ");
    let len = inner.chars().count() as u16;
    let avail = area.width.saturating_sub(4);
    if len + 2 > avail {
        return;
    }
    let rx = area.x + area.width - 2 - (len + 2);
    text(buf, rx, y, "┤", border, false);
    text(buf, rx + 1, y, &inner, fg, false);
    text(buf, rx + 1 + len, y, "├", border, false);
}

fn chars(s: &str) -> u16 {
    s.chars().count() as u16
}

fn set(buf: &mut Buffer, x: u16, y: u16, ch: char, fg: Color) {
    if let Some(cell) = buf.cell_mut((x, y)) {
        cell.set_char(ch).set_fg(fg);
    }
}

/// Draw a horizontal rule across `w` cells.
pub fn rule(buf: &mut Buffer, x: u16, y: u16, w: u16) {
    for i in 0..w {
        set(buf, x + i, y, '─', palette::faint());
    }
}

// ── axis ───────────────────────────────────────────────────────────────────

/// Mantissas of the axis ladder, at most 25% apart.
///
/// A sparse ladder (128 → 192) leaves the top braille row entirely unused,
/// costing a quarter of a four-row graph. At ≤25% spacing a peak always lands
/// in the top fifth of the axis — worst case exactly 1/1.25 = 80%.
const MANTISSA: [f64; 13] = [
    1.0, 1.25, 1.5, 1.8, 2.0, 2.5, 3.0, 3.5, 4.0, 5.0, 6.0, 7.0, 8.0,
];

/// Smallest ladder value at or above `v`, in whatever unit `v` is in.
///
/// There is deliberately no headroom fudge factor: multiplying the peak by a
/// few percent before the lookup pushes it back down the axis, which is the
/// one thing a tight ladder exists to prevent.
pub fn nice_ceil(v: f64) -> f64 {
    if !v.is_finite() || v <= 0.0 {
        return MANTISSA[0];
    }
    // Decades from 1e-3 to 1e6 of the caller's unit. Called with MiB/s that is
    // 1 KiB/s to 1 PiB/s — the ceiling has to be out of reach of real hardware,
    // not of the fixtures. A ladder stopping at 2 GiB/s renders every drive
    // faster than a single Gen4 NVMe as the same clipped slab.
    let mut decade = 1e-3_f64;
    while decade <= 1e6 {
        for m in MANTISSA {
            let c = m * decade;
            if c >= v {
                return c;
            }
        }
        decade *= 10.0;
    }
    8e6
}

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

    #[test]
    fn ladder_rungs_are_at_most_25_percent_apart() {
        // The property the whole auto-scale rests on. A 28% rung — which the
        // 1/1.25/1.6/2 ladder has at every third step — leaves part of the top
        // braille row permanently unused.
        let mut prev = MANTISSA[0];
        for m in MANTISSA.iter().skip(1) {
            assert!(
                m / prev <= 1.2501,
                "rung {prev} → {m} is {:.1}% apart",
                (m / prev - 1.0) * 100.0
            );
            prev = *m;
        }
        // And across the decade boundary: 8 → 10.
        assert!(10.0 / MANTISSA[MANTISSA.len() - 1] <= 1.2501);
    }

    #[test]
    fn peak_always_lands_in_the_top_fifth_of_the_axis() {
        let mut v = 0.01_f64;
        while v < 1e5 {
            let top = nice_ceil(v);
            assert!(top >= v, "ceiling {top} below peak {v}");
            assert!(
                v / top >= 0.7999,
                "peak {v} only reaches {:.1}% of a {top} axis",
                v / top * 100.0
            );
            v *= 1.017;
        }
    }

    #[test]
    fn ladder_reaches_past_real_hardware() {
        // A Gen5 NVMe pair sustains ~14 GiB/s. In MiB/s that is ~14336.
        assert!(nice_ceil(14336.0) >= 14336.0);
        assert!(nice_ceil(14336.0) < 20000.0, "and without wasting the axis");
    }

    #[test]
    fn nice_ceil_survives_garbage() {
        assert_eq!(nice_ceil(0.0), 1.0);
        assert_eq!(nice_ceil(-5.0), 1.0);
        assert_eq!(nice_ceil(f64::NAN), 1.0);
    }

    fn buffer(w: u16, h: u16) -> Buffer {
        Buffer::empty(Rect::new(0, 0, w, h))
    }

    #[test]
    fn a_non_zero_sample_always_lights_at_least_one_dot() {
        // Anything under 1/(2·sub_h) rounds to zero. On a one-row sparkline
        // that is everything below 12.5%, and a quiet-but-active series would
        // read as no data at all.
        let mut buf = buffer(4, 1);
        spark(&mut buf, 0, 0, 4, &[0.001; 8], Ramp::Write, None);
        for x in 0..4 {
            assert_ne!(buf.cell((x, 0)).unwrap().symbol(), " ", "column {x} blank");
        }
    }

    #[test]
    fn zero_stays_blank() {
        let mut buf = buffer(4, 1);
        spark(&mut buf, 0, 0, 4, &[0.0; 8], Ramp::Write, None);
        for x in 0..4 {
            assert_eq!(buf.cell((x, 0)).unwrap().symbol(), " ");
        }
    }

    #[test]
    fn flip_mirrors_the_fill_about_the_axis() {
        // The mirrored write graph is the identity of the tool: a restore is a
        // cliff above the axis, a backup a cliff below it.
        // Exercises the braille bit-pattern directly — the mirroring math is
        // the same regardless of the active graph style, and calling the
        // dispatcher here would make this test depend on global state.
        let mut up = buffer(1, 2);
        graph_braille(
            &mut up,
            Rect::new(0, 0, 1, 2),
            &[0.5, 0.5],
            Ramp::Read,
            false,
            None,
        );
        let mut down = buffer(1, 2);
        graph_braille(
            &mut down,
            Rect::new(0, 0, 1, 2),
            &[0.5, 0.5],
            Ramp::Write,
            true,
            None,
        );
        // Growing up fills the BOTTOM row; growing down fills the TOP row.
        assert_eq!(up.cell((0, 1)).unwrap().symbol(), "⣿");
        assert_eq!(up.cell((0, 0)).unwrap().symbol(), " ");
        assert_eq!(down.cell((0, 0)).unwrap().symbol(), "⣿");
        assert_eq!(down.cell((0, 1)).unwrap().symbol(), " ");
    }

    #[test]
    fn both_sub_columns_are_filled() {
        // Lighting only the left sub-column reads as a sparse dot matrix
        // rather than an area fill — the bug netwatch shipped and fixed.
        // Calls the braille implementation directly for the same reason as
        // `flip_mirrors_the_fill_about_the_axis` above.
        let mut buf = buffer(1, 1);
        graph_braille(
            &mut buf,
            Rect::new(0, 0, 1, 1),
            &[1.0, 1.0],
            Ramp::Read,
            false,
            None,
        );
        assert_eq!(buf.cell((0, 0)).unwrap().symbol(), "⣿");
    }

    #[test]
    fn the_public_entry_point_switches_style_with_the_global_setting() {
        // Pins the actual fix: before this, the dense view always drew
        // braille no matter what the settings overlay's Graph style row
        // said, because `graph()`/`spark()` never looked at it.
        use crate::ui::graph::{with_style, GraphStyle};

        let bars = with_style(GraphStyle::Bars, || {
            let mut buf = buffer(1, 1);
            spark(&mut buf, 0, 0, 1, &[1.0, 1.0], Ramp::Read, None);
            buf.cell((0, 0)).unwrap().symbol().to_string()
        });
        assert_eq!(bars, "█", "bars style should draw a block, not braille");

        let dots = with_style(GraphStyle::Dots, || {
            let mut buf = buffer(1, 1);
            spark(&mut buf, 0, 0, 1, &[1.0, 1.0], Ramp::Read, None);
            buf.cell((0, 0)).unwrap().symbol().to_string()
        });
        assert_eq!(dots, "⣿", "dots style should draw braille");
    }

    #[test]
    fn bars_style_mirrors_about_the_axis_at_whole_row_resolution() {
        // Unicode has no upper-N-eighths ladder to match the lower one, so
        // the downward-growing (flip) side quantizes to whole rows — see
        // `graph_bars`'s doc comment. Pin that it still grows the right
        // direction rather than silently rendering nothing.
        use crate::ui::graph::{with_style, GraphStyle};

        with_style(GraphStyle::Bars, || {
            let mut up = buffer(1, 2);
            graph(
                &mut up,
                Rect::new(0, 0, 1, 2),
                &[1.0, 1.0],
                Ramp::Read,
                false,
                None,
            );
            assert_eq!(
                up.cell((0, 1)).unwrap().symbol(),
                "█",
                "fills the bottom row"
            );
            assert_eq!(up.cell((0, 0)).unwrap().symbol(), "█");

            let mut down = buffer(1, 2);
            graph(
                &mut down,
                Rect::new(0, 0, 1, 2),
                &[0.5, 0.5],
                Ramp::Write,
                true,
                None,
            );
            assert_ne!(
                down.cell((0, 0)).unwrap().symbol(),
                " ",
                "half-fill should light the top row growing down"
            );
            assert_eq!(
                down.cell((0, 1)).unwrap().symbol(),
                " ",
                "and stop before the bottom row"
            );
        });
    }

    #[test]
    fn a_one_cell_meter_does_not_divide_by_zero() {
        let mut buf = buffer(1, 1);
        meter(&mut buf, 0, 0, 1, 0.5, Ramp::Load);
        assert_eq!(buf.cell((0, 0)).unwrap().symbol(), "■");
    }

    #[test]
    fn a_meter_handles_a_nan_fraction() {
        let mut buf = buffer(4, 1);
        meter(&mut buf, 0, 0, 4, f64::NAN, Ramp::Load);
        assert_eq!(buf.cell((0, 0)).unwrap().symbol(), "·");
    }

    #[test]
    fn text_clips_instead_of_writing_off_the_buffer() {
        let mut buf = buffer(4, 1);
        text(&mut buf, 2, 0, "abcdef", palette::fg(), false);
        assert_eq!(buf.cell((3, 0)).unwrap().symbol(), "b");
    }

    #[test]
    fn single_row_graphs_colour_by_value() {
        // Height is constant on a one-row graph, so without the band every
        // cell takes the same mid-ramp colour and two very different series
        // render identically.
        //
        // Pins `dark`: the band is expressed as a colour gradient, and the
        // default `terminal` theme has no intermediate shades to show it in.
        let _g = theme::exclusive_theme("dark");
        let mut lo = buffer(1, 1);
        spark(
            &mut lo,
            0,
            0,
            1,
            &[0.31, 0.31],
            Ramp::Write,
            Some((0.30, 0.68)),
        );
        let mut hi = buffer(1, 1);
        spark(
            &mut hi,
            0,
            0,
            1,
            &[0.67, 0.67],
            Ramp::Write,
            Some((0.30, 0.68)),
        );
        assert_ne!(lo.cell((0, 0)).unwrap().fg, hi.cell((0, 0)).unwrap().fg);
    }

    /// Relative luminance, WCAG 2.x.
    fn luminance(c: Color) -> f64 {
        match c {
            Color::Rgb(r, g, b) => {
                let ch = |v: u8| {
                    let s = v as f64 / 255.0;
                    if s <= 0.03928 {
                        s / 12.92
                    } else {
                        ((s + 0.055) / 1.055).powf(2.4)
                    }
                };
                0.2126 * ch(r) + 0.7152 * ch(g) + 0.0722 * ch(b)
            }
            _ => 0.0,
        }
    }

    fn contrast(a: Color, b: Color) -> f64 {
        let (x, y) = (luminance(a), luminance(b));
        let (hi, lo) = if x > y { (x, y) } else { (y, x) };
        (hi + 0.05) / (lo + 0.05)
    }

    #[test]
    fn ramps_stay_legible_against_the_background() {
        // An area graph puts most of its ink near the baseline, which is the
        // DARK end of a magnitude ramp — so the dark end is what has to be
        // readable, not just the peaks. The handoff's ramps bottomed out at
        // 2.0:1 and 1.6:1, under the 3:1 WCAG floor for non-text UI, and the
        // fill a normal workload draws was invisible.
        // Both the ramp and the bg have to come from the same theme, and
        // luminance is only defined for RGB — so pin `dark` rather than
        // inherit the default, which is `terminal`.
        let _g = theme::exclusive_theme("dark");
        let bg = crate::ui::theme::by_name("dark").bg;
        for ramp in [Ramp::Read, Ramp::Write, Ramp::Load] {
            for i in 0..=20 {
                let f = i as f64 / 20.0;
                let c = contrast(ramp.at(f), bg);
                assert!(
                    c >= 4.0,
                    "{ramp:?} at {f:.2} is only {c:.1}:1 on the background"
                );
            }
        }
    }

    #[test]
    fn magnitude_ramps_still_climb() {
        // Legibility must not flatten the gradient: height is the channel that
        // makes a spike's severity pre-attentive.
        let _g = theme::exclusive_theme("dark");
        let bg = crate::ui::theme::by_name("dark").bg;
        for ramp in [Ramp::Read, Ramp::Write] {
            let lo = contrast(ramp.at(0.0), bg);
            let hi = contrast(ramp.at(1.0), bg);
            assert!(hi > lo * 2.5, "{ramp:?} spans only {lo:.1}:1 to {hi:.1}:1");
            for i in 1..=4 {
                let a = contrast(ramp.at((i - 1) as f64 / 4.0), bg);
                let b = contrast(ramp.at(i as f64 / 4.0), bg);
                assert!(b > a, "{ramp:?} stop {i} does not brighten");
            }
        }
    }

    #[test]
    fn terminal_theme_pins_no_rgb() {
        // The `terminal` theme's whole promise is that diskwatch defines no
        // colours of its own. A gradient has no 16-colour equivalent, so it
        // has to degrade rather than leak RGB.
        let _g = theme::exclusive_theme("terminal");
        for f in [0.0, 0.4, 0.9, 1.0] {
            for r in [Ramp::Read, Ramp::Write, Ramp::Load] {
                assert!(
                    !matches!(r.at(f), Color::Rgb(..)),
                    "{r:?} at {f} pinned RGB under the terminal theme"
                );
            }
        }
        // ...and the converse: an RGB theme still gets a real gradient.
        theme::set_by_name("dark");
        assert!(matches!(Ramp::Read.at(0.5), Color::Rgb(..)));
    }
}