Understand the failure.
Verify the repair.
Small, reproducible software failures. The broken implementation, the fix that didn’t work, and the one that passed—preserved together.
Explore the cases ↓How results are verified ↗WHAT THE ARCHIVE CONTAINS
100840 executable cases. 20168 are open.
Every case records the implementation that fails, the fix that did not work, and the repair that passed its checks—with recorded outputs and source hashes. This release adds 100840 cases across 20168 failure mechanisms and 254 domains.
The open tier gives you the failure and the unsuccessful fix for one case in every mechanism. The remaining 80672 cases, 5 variants per mechanism, are member-only: the verified repair, its recorded checks, and the full fixture suite are held in the member archive. Read the methodology ↗
A RECORD OF WHAT WENT WRONG
Browse the archive / 100840
Deque retirement reports free capacity before returning its slot · case 01
Deque retirement reports free capacity before returning its slot.
Deque retirement reports free capacity before returning its slot · case 02
Deque retirement reports free capacity before returning its slot.
Deque retirement reports free capacity before returning its slot · case 03
Deque retirement reports free capacity before returning its slot.
Deque retirement reports free capacity before returning its slot · case 04
Deque retirement reports free capacity before returning its slot.
Deque retirement reports free capacity before returning its slot · case 05
Deque retirement reports free capacity before returning its slot.
Deque borrow validates against allocation capacity instead of live extent · case 01
Deque borrow validates against allocation capacity instead of live extent.
Deque borrow validates against allocation capacity instead of live extent · case 02
Deque borrow validates against allocation capacity instead of live extent.
Deque borrow validates against allocation capacity instead of live extent · case 03
Deque borrow validates against allocation capacity instead of live extent.
Deque borrow validates against allocation capacity instead of live extent · case 04
Deque borrow validates against allocation capacity instead of live extent.
Deque borrow validates against allocation capacity instead of live extent · case 05
Deque borrow validates against allocation capacity instead of live extent.
Deque borrow accepts a negative logical start · case 01
Deque borrow accepts a negative logical start.
Deque borrow accepts a negative logical start · case 02
Deque borrow accepts a negative logical start.
Deque borrow accepts a negative logical start · case 03
Deque borrow accepts a negative logical start.
Deque borrow accepts a negative logical start · case 04
Deque borrow accepts a negative logical start.
Deque borrow accepts a negative logical start · case 05
Deque borrow accepts a negative logical start.
Deque borrow forgets the requested logical displacement · case 01
Deque borrow forgets the requested logical displacement.
Deque borrow forgets the requested logical displacement · case 02
Deque borrow forgets the requested logical displacement.
Deque borrow forgets the requested logical displacement · case 03
Deque borrow forgets the requested logical displacement.
Deque borrow forgets the requested logical displacement · case 04
Deque borrow forgets the requested logical displacement.
Deque borrow forgets the requested logical displacement · case 05
Deque borrow forgets the requested logical displacement.
Deque borrow uses the live count as its physical contiguous span · case 01
Deque borrow uses the live count as its physical contiguous span.
Deque borrow uses the live count as its physical contiguous span · case 02
Deque borrow uses the live count as its physical contiguous span.
Deque borrow uses the live count as its physical contiguous span · case 03
Deque borrow uses the live count as its physical contiguous span.
Deque borrow uses the live count as its physical contiguous span · case 04
Deque borrow uses the live count as its physical contiguous span.
Deque borrow uses the live count as its physical contiguous span · case 05
Deque borrow uses the live count as its physical contiguous span.
Wrapped borrow resumes after slot zero · case 01
Wrapped borrow resumes after slot zero.
Wrapped borrow resumes after slot zero · case 02
Wrapped borrow resumes after slot zero.
Wrapped borrow resumes after slot zero · case 03
Wrapped borrow resumes after slot zero.
Wrapped borrow resumes after slot zero · case 04
Wrapped borrow resumes after slot zero.
Wrapped borrow resumes after slot zero · case 05
Wrapped borrow resumes after slot zero.
Deque borrow captures a future storage generation · case 01
Deque borrow captures a future storage generation.
Deque borrow captures a future storage generation · case 02
Deque borrow captures a future storage generation.
Deque borrow captures a future storage generation · case 03
Deque borrow captures a future storage generation.
Deque borrow captures a future storage generation · case 04
Deque borrow captures a future storage generation.
Deque borrow captures a future storage generation · case 05
Deque borrow captures a future storage generation.
Empty deque borrow unnecessarily pins backing storage · case 01
Empty deque borrow unnecessarily pins backing storage.
Empty deque borrow unnecessarily pins backing storage · case 02
Empty deque borrow unnecessarily pins backing storage.
Empty deque borrow unnecessarily pins backing storage · case 03
Empty deque borrow unnecessarily pins backing storage.
Empty deque borrow unnecessarily pins backing storage · case 04
Empty deque borrow unnecessarily pins backing storage.
Empty deque borrow unnecessarily pins backing storage · case 05
Empty deque borrow unnecessarily pins backing storage.
Deque iterator detects only increasing generation changes · case 01
Deque iterator detects only increasing generation changes.
Deque iterator detects only increasing generation changes · case 02
Deque iterator detects only increasing generation changes.
Deque iterator detects only increasing generation changes · case 03
Deque iterator detects only increasing generation changes.
Deque iterator detects only increasing generation changes · case 04
Deque iterator detects only increasing generation changes.
Deque iterator detects only increasing generation changes · case 05
Deque iterator detects only increasing generation changes.
Stale deque iterator advances before reporting invalidation · case 01
Stale deque iterator advances before reporting invalidation.
Stale deque iterator advances before reporting invalidation · case 02
Stale deque iterator advances before reporting invalidation.
Stale deque iterator advances before reporting invalidation · case 03
Stale deque iterator advances before reporting invalidation.
Stale deque iterator advances before reporting invalidation · case 04
Stale deque iterator advances before reporting invalidation.
Stale deque iterator advances before reporting invalidation · case 05
Stale deque iterator advances before reporting invalidation.
Deque iterator batch counts entries before its cursor as remaining · case 01
Deque iterator batch counts entries before its cursor as remaining.
Deque iterator batch counts entries before its cursor as remaining · case 02
Deque iterator batch counts entries before its cursor as remaining.
Deque iterator batch counts entries before its cursor as remaining · case 03
Deque iterator batch counts entries before its cursor as remaining.
Deque iterator batch counts entries before its cursor as remaining · case 04
Deque iterator batch counts entries before its cursor as remaining.
Deque iterator batch counts entries before its cursor as remaining · case 05
Deque iterator batch counts entries before its cursor as remaining.
Deque iterator ignores the requested batch ceiling · case 01
Deque iterator ignores the requested batch ceiling.
Deque iterator ignores the requested batch ceiling · case 02
Deque iterator ignores the requested batch ceiling.
Deque iterator ignores the requested batch ceiling · case 03
Deque iterator ignores the requested batch ceiling.
Deque iterator ignores the requested batch ceiling · case 04
Deque iterator ignores the requested batch ceiling.
Deque iterator ignores the requested batch ceiling · case 05
Deque iterator ignores the requested batch ceiling.
Reverse deque iterator reads the forward storage sequence · case 01
Reverse deque iterator reads the forward storage sequence.
Reverse deque iterator reads the forward storage sequence · case 02
Reverse deque iterator reads the forward storage sequence.
Reverse deque iterator reads the forward storage sequence · case 03
Reverse deque iterator reads the forward storage sequence.
Reverse deque iterator reads the forward storage sequence · case 04
Reverse deque iterator reads the forward storage sequence.
Reverse deque iterator reads the forward storage sequence · case 05
Reverse deque iterator reads the forward storage sequence.
Deque iterator rereads the beginning on subsequent batches · case 01
Deque iterator rereads the beginning on subsequent batches.
Deque iterator rereads the beginning on subsequent batches · case 02
Deque iterator rereads the beginning on subsequent batches.
Deque iterator rereads the beginning on subsequent batches · case 03
Deque iterator rereads the beginning on subsequent batches.
Deque iterator rereads the beginning on subsequent batches · case 04
Deque iterator rereads the beginning on subsequent batches.
Deque iterator rereads the beginning on subsequent batches · case 05
Deque iterator rereads the beginning on subsequent batches.
Deque iterator advances by request rather than actual delivery · case 01
Deque iterator advances by request rather than actual delivery.
Deque iterator advances by request rather than actual delivery · case 02
Deque iterator advances by request rather than actual delivery.
Deque iterator advances by request rather than actual delivery · case 03
Deque iterator advances by request rather than actual delivery.
Deque iterator advances by request rather than actual delivery · case 04
Deque iterator advances by request rather than actual delivery.
Deque iterator advances by request rather than actual delivery · case 05
Deque iterator advances by request rather than actual delivery.
Deque iterator split measures absolute stop as range length · case 01
Deque iterator split measures absolute stop as range length.
Deque iterator split measures absolute stop as range length · case 02
Deque iterator split measures absolute stop as range length.
Deque iterator split measures absolute stop as range length · case 03
Deque iterator split measures absolute stop as range length.
Deque iterator split measures absolute stop as range length · case 04
Deque iterator split measures absolute stop as range length.
Deque iterator split measures absolute stop as range length · case 05
Deque iterator split measures absolute stop as range length.
Deque iterator refuses ranges at the minimum split length · case 01
Deque iterator refuses ranges at the minimum split length.
Deque iterator refuses ranges at the minimum split length · case 02
Deque iterator refuses ranges at the minimum split length.
Deque iterator refuses ranges at the minimum split length · case 03
Deque iterator refuses ranges at the minimum split length.
Deque iterator refuses ranges at the minimum split length · case 04
Deque iterator refuses ranges at the minimum split length.
Deque iterator refuses ranges at the minimum split length · case 05
Deque iterator refuses ranges at the minimum split length.
Deque iterator split places midpoint relative to zero · case 01
Deque iterator split places midpoint relative to zero.
Deque iterator split places midpoint relative to zero · case 02
Deque iterator split places midpoint relative to zero.
Deque iterator split places midpoint relative to zero · case 03
Deque iterator split places midpoint relative to zero.
Deque iterator split places midpoint relative to zero · case 04
Deque iterator split places midpoint relative to zero.
Deque iterator split places midpoint relative to zero · case 05
Deque iterator split places midpoint relative to zero.
Split prefix captures a new rather than original deque epoch · case 01
Split prefix captures a new rather than original deque epoch.
Split prefix captures a new rather than original deque epoch · case 02
Split prefix captures a new rather than original deque epoch.
Split prefix captures a new rather than original deque epoch · case 03
Split prefix captures a new rather than original deque epoch.
Split prefix captures a new rather than original deque epoch · case 04
Split prefix captures a new rather than original deque epoch.
Split prefix captures a new rather than original deque epoch · case 05
Split prefix captures a new rather than original deque epoch.
Iterator split leaves an overlap at its midpoint · case 01
Iterator split leaves an overlap at its midpoint.
Iterator split leaves an overlap at its midpoint · case 02
Iterator split leaves an overlap at its midpoint.
Iterator split leaves an overlap at its midpoint · case 03
Iterator split leaves an overlap at its midpoint.
Iterator split leaves an overlap at its midpoint · case 04
Iterator split leaves an overlap at its midpoint.
Iterator split leaves an overlap at its midpoint · case 05
Iterator split leaves an overlap at its midpoint.
INSPECTABLE BY DESIGN
Every result has a runnable source.
Runnable implementations with recorded outputs, source hashes, and explicit contracts. Related variants share a failure mechanism and belong together in evaluation splits.
Read the methodology ↗