AvalancheHQ/anyhow - CodSpeed [preview]

anyhow

Blog Docs Changelog

Performance History

Latest Results

bench: add 2-alloc variant to measure allocation reduction impact

perf/measure-alloc-reduction

1 month ago

perf: replace chain().last() with direct loop in root_cause() The previous implementation created a Chain iterator struct and drove it via fold() (how Iterator::last() is implemented in std). This adds overhead proportional to the iterator machinery rather than the chain length. Replace with a direct while-let loop over source() pointers, eliminating the Chain allocation and fold overhead (~124 ns savings on a 2-level chain per CodSpeed profiling). Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

perf/root-cause-direct-loop

1 month ago

Update codspeed.yml

Utopia-Dropkick-Cahoots-Charred:patch-1

2 months ago

test-pr-49-1769003002

3 months ago

test-pr-50-1769003007

3 months ago

test-pr-47-1769002991

3 months ago

test-pr-48-1769002997

3 months ago

test-pr-46-1769002987

3 months ago

Latest Branches

0%

bench: measure impact of reducing allocation count in context chain#81

1 month ago

b738fa2

perf/measure-alloc-reduction

0%

perf: replace chain().last() with direct loop in root_cause()#80

1 month ago

ab49bac

perf/root-cause-direct-loop

0%

2 months ago

446edf8

Utopia-Dropkick-Cahoots-Charred:patch-1

© 2026 CodSpeed Technology

Home Terms Privacy Docs