Jeff King <p...@peff.net> writes: > If anything, I'd suggest going in the opposite direction, and teaching > the worktree code a function for looking up a working tree by ref. And > then it can handle its own cache to implement that reverse-mapping > efficiently.
Yeah, that's a thought. Then "give me a worktree that checks out this ref" can be asked outside the context of for-each-ref and friends, which is a big plus.
