fix: break ties in audit ordering by repo ID (lowest first) #13
Loading…
Add table
Add a link
Reference in a new issue
No description provided.
Delete branch "fix/audit-sort-tiebreaker"
Deleting a branch is permanent. Although the deleted branch may continue to exist for a short time before it actually gets removed, it CANNOT be undone in most cases. Continue?
When multiple repos have the same last-audit time (e.g. epoch for
never-checked repos), sort by repo ID ascending so the lowest IDs
get audited first for deterministic coverage.
Co-Authored-By: Claude Opus 4.6 (1M context) noreply@anthropic.com
Automated review by pr-reviewer v0.15.0 | Safety Check | anthropic | tracking id
r-c4ce02-00ec07This is an AI-generated review and may contain mistakes.
Status: ✅ Completed
✅ Verdict: LGTM — The change adds a reasonable tiebreaker to the sorting logic without introducing any obvious bugs or security issues.
Complexity: trivial
This is a straightforward fix that adds deterministic ordering when audit timestamps are equal. The logic is correct - it first checks if timestamps are equal and breaks ties by comparing IDs numerically, then falls back to the original timestamp comparison. No security concerns or obvious bugs detected.
58d0f0f959c1da07ccd4Automated review by pr-reviewer v0.15.0 | Safety Check | anthropic | tracking id
r-c4ce0c-2153a7This is an AI-generated review and may contain mistakes.
Status: ✅ Completed
✅ Verdict: LGTM — The change adds a deterministic tiebreaker to the audit ordering logic, which is a straightforward improvement with no obvious safety concerns.
Complexity: trivial
This change adds a tiebreaker to sort audit entries by repo ID when they have equal
lastAudittimestamps. The logic is sound and the implementation is straightforward - it checks for timestamp equality first, then falls back to ID comparison for deterministic ordering. No security vulnerabilities, breaking changes, or obvious bugs detected.