Context
From PR #324 review feedback (non-blocking suggestion).
Problem
The current vibe jump search logic performs multiple passes over the worktree list:
- Exact match (case-sensitive)
- Exact match (case-insensitive)
- Word boundary match (case-sensitive)
- Word boundary match (case-insensitive)
- Substring match (case-sensitive)
- Substring match (case-insensitive)
Proposal
Optimize with a single pass that categorizes matches into buckets, then selects the highest-priority non-empty bucket.
Priority
Low — typical repositories have <10 worktrees, making the current multi-pass approach negligible in practice. This becomes relevant only for repositories with hundreds of worktrees.
Related
Context
From PR #324 review feedback (non-blocking suggestion).
Problem
The current
vibe jumpsearch logic performs multiple passes over the worktree list:Proposal
Optimize with a single pass that categorizes matches into buckets, then selects the highest-priority non-empty bucket.
Priority
Low — typical repositories have <10 worktrees, making the current multi-pass approach negligible in practice. This becomes relevant only for repositories with hundreds of worktrees.
Related