mirror of
https://github.com/block/buzz.git
synced 2026-08-18 06:50:31 +02:00
docs(terminal): repoint the links the slice_bytes deletion broke
Two intra-doc links still resolved to the deleted function, so `cargo doc` emitted unresolved-link warnings. Neither `cargo test` nor clippy sees those, which is why they survived a green gate -- the deletion was verified by the checks that run in CI and not by the one that reads the docs. The single remaining mention is deliberate: the paragraph in `fences.rs` explaining why the old function existed and why it is gone. Co-authored-by: tlongwell-block <109685178+tlongwell-block@users.noreply.github.com> Signed-off-by: tlongwell-block <109685178+tlongwell-block@users.noreply.github.com>
This commit is contained in:
co-authored by
tlongwell-block
parent
d67b99a3dd
commit
651ef710b4
@@ -130,7 +130,7 @@ pub fn max_atom_work(columns: usize, lines: usize, scrollback: usize) -> u64 {
|
||||
/// fixtures caught it:
|
||||
///
|
||||
/// * The budget is checked *between* slices, so a drain overshoots by up to
|
||||
/// one whole slice -- not one atom. [`slice_bytes`] keeps that under one
|
||||
/// one whole slice -- not one atom. [`slice_bytes_remaining`] keeps that under one
|
||||
/// budget wherever its derivation is unclamped.
|
||||
/// * A callback already running cannot be preempted. RIS at the default 10k
|
||||
/// scrollback is worth 16x the whole budget on its own, so on such a grid
|
||||
|
||||
@@ -172,7 +172,7 @@ impl Feeder {
|
||||
/// per count when it finds no stop.
|
||||
///
|
||||
/// What *is* bounded is the number of atoms per slice, and that bound
|
||||
/// holds from the first byte of a cold feeder: [`slice_bytes`] is derived
|
||||
/// holds from the first byte of a cold feeder: [`slice_bytes_remaining`] is derived
|
||||
/// from the densest work-per-byte upstream can produce on this grid, so
|
||||
/// no slice can contain more than one budget's worth of callbacks no
|
||||
/// matter what the payload is or what the feeder has seen before.
|
||||
|
||||
@@ -333,7 +333,7 @@ fn a_resize_mid_tail_reprices_the_remainder() {
|
||||
/// byte count cannot bound a lock hold: `ESC c` is two bytes and resets both
|
||||
/// grids plus scrollback.
|
||||
///
|
||||
/// Kills: replacing `slice_bytes` with a constant, or deriving it from
|
||||
/// Kills: replacing `slice_bytes_remaining` with a constant, or deriving it from
|
||||
/// `cells` while the worst atom is larger than `cells`. Measured: 256 bytes
|
||||
/// of DECALN is 1.6 ms at 200x50 and ~14 ms at 1600x50, so no one constant
|
||||
/// serves both.
|
||||
@@ -1152,7 +1152,7 @@ fn extreme_dimensions_saturate_instead_of_wrapping() {
|
||||
|
||||
// The *direction* is the assertion, not merely the absence of a panic.
|
||||
// A wrapping build does not produce a slightly-wrong bound, it produces a
|
||||
// tiny one -- and `slice_bytes` divides the budget by it, so an
|
||||
// tiny one -- and `slice_bytes_remaining` divides the budget by it, so an
|
||||
// undercharged atom yields an *oversized* slice exactly when the atom is
|
||||
// most expensive. Wrapping inverts the fence. So: the widest possible
|
||||
// atom must give the narrowest possible slice.
|
||||
|
||||
Reference in New Issue
Block a user