57d8391c52
38.20's cap fix took the suite from ~4.5 to ~10 min because the assign_cpsat tests now solve to optimality. Recovered to ~6.8 min. The bigger win was not the threading. The secondary-adjacency test ran the cpsat arm THREE times and averaged, and its own comment says why: the cpsat path "is not yet bit-reproducible (homemaker-py-fdp)", so one 10-seed aggregate could straddle greedy's deterministic value and the test was flaky by construction. fdp is fixed (38.15), so one pass says exactly what three did -- that was work spent papering over a bug that no longer exists. constructive_topology and _assign_adjacency_aware now forward an optional cpsat_limits=(time_limit_s, deterministic_limit); default None keeps solve_room_labels' defaults, so production is unchanged -- verified 24/24 harbor solves still OPTIMAL at the defaults. It is not a tuning knob: it exists so a test whose claim does not depend on optimality can economise. test_construction_assign_cpsat_yields_valid_seed asserts invariants only and uses it, 91s -> 53s. That test now also guards a real trap: too small a budget makes solve_room_labels return None, _assign_adjacency_aware falls back to greedy, and the test would pass while exercising nothing. It counts fallbacks and fails if any occur. The two quality comparisons keep the full budget deliberately -- their claims are about the optimum, and cheapening them would weaken what they assert. That is why the suite does not return to 4.5 min; the residue is the honest price of optimal deterministic solves. Also corrected a stale claim in the secondary-adjacency comment: it measures only "not adjacent to" fails and is not a claim that cpsat seeds better overall, which 38.20 measured markedly worse. Closes homemaker-py-7t1. Lint at parity (46); tests 384 passed, 0 failed. Co-Authored-By: Claude Opus 5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01MJ84Feep79Hhm3E4zZJmnB |
||
|---|---|---|
| .. | ||
| hooks | ||
| .gitignore | ||
| config.yaml | ||
| issues.jsonl | ||
| metadata.json | ||
| README.md | ||
Beads - AI-Native Issue Tracking
Welcome to Beads! This repository uses Beads for issue tracking - a modern, AI-native tool designed to live directly in your codebase alongside your code.
What is Beads?
Beads is issue tracking that lives in your repo, making it perfect for AI coding agents and developers who want their issues close to their code. No web UI required - everything works through the CLI and integrates seamlessly with git.
Learn more: github.com/steveyegge/beads
Quick Start
Essential Commands
# Create new issues
bd create "Add user authentication"
# View all issues
bd list
# View issue details
bd show <issue-id>
# Update issue status
bd update <issue-id> --claim
bd update <issue-id> --status done
# Sync with Dolt remote
bd dolt push
Working with Issues
Issues in Beads are:
- Git-native: Stored in Dolt database with version control and branching
- AI-friendly: CLI-first design works perfectly with AI coding agents
- Branch-aware: Issues can follow your branch workflow
- Always in sync: Auto-syncs with your commits
Why Beads?
✨ AI-Native Design
- Built specifically for AI-assisted development workflows
- CLI-first interface works seamlessly with AI coding agents
- No context switching to web UIs
🚀 Developer Focused
- Issues live in your repo, right next to your code
- Works offline, syncs when you push
- Fast, lightweight, and stays out of your way
🔧 Git Integration
- Automatic sync with git commits
- Branch-aware issue tracking
- Dolt-native three-way merge resolution
Get Started with Beads
Try Beads in your own projects:
# Install Beads
curl -sSL https://raw.githubusercontent.com/steveyegge/beads/main/scripts/install.sh | bash
# Initialize in your repo
bd init
# Create your first issue
bd create "Try out Beads"
Learn More
- Documentation: github.com/steveyegge/beads/docs
- Quick Start Guide: Run
bd quickstart - Examples: github.com/steveyegge/beads/examples
Beads: Issue tracking that moves at the speed of thought ⚡