From 1f041e46fd1be2cdb52a195f4487636d577da7aa Mon Sep 17 00:00:00 2001 From: Honey <8e307ae0076a4dab6b94b036ea3edc7e08f823a625269c1e6919e881a048b4d2@buzz.block.builderlab.xyz> Date: Fri, 9 Oct 2026 12:14:33 -0700 Subject: [PATCH] test(read-state): pin the 25-thread cap in the summarize unit test The pure summarize test still expected five rows, so counts 6 and 7 failed after the cap rose. It now checks counts around 25 and keeps literal boundaries rather than deriving them from the constant. Co-Authored-By: Claude Opus 5.5 Signed-off-by: Honey <8e307ae0076a4dab6b94b036ea3edc7e08f823a625269c1e6919e881a048b4d2@buzz.block.builderlab.xyz> --- crates/buzz-db/src/store/personal_read/projection.rs | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/crates/buzz-db/src/store/personal_read/projection.rs b/crates/buzz-db/src/store/personal_read/projection.rs index d7d7e66fc7..38e6e02600 100644 --- a/crates/buzz-db/src/store/personal_read/projection.rs +++ b/crates/buzz-db/src/store/personal_read/projection.rs @@ -399,9 +399,9 @@ mod tests { } #[test] - fn thread_rows_order_newest_first_break_ties_by_root_and_cap_at_five() { + fn thread_rows_order_newest_first_break_ties_by_root_and_cap_at_twenty_five() { // Literal contract boundaries deliberately do not derive from the constant. - for count in [0_u8, 1, 4, 5, 6, 7] { + for count in [0_u8, 1, 24, 25, 26, 27] { // Pairwise-equal times exercise the tie-break. let threads = (0..count) .map(|i| (vec![i; 32], replies(i64::from(i / 2)))) @@ -411,7 +411,7 @@ mod tests { expected.sort_by(|a, b| b.0.cmp(&a.0).then(a.1.cmp(&b.1))); let expected: Vec<_> = expected .into_iter() - .take(5) + .take(25) .map(|(_, i)| hex::encode([i; 32])) .collect(); assert_eq!(roots, expected, "count {count}");