~bzr-pqm/bzr/bzr.dev

(jam) refactor find_unique_ancestors for clarity,
and collapse searchers for performance

added added

removed removed

283

# |/

284

# j

285

286

# y is found to be common right away, but is the start of a long series of

286

# x is found to be common right away, but is the start of a long series of

287

# common commits.

288

# o is actually common, but the i-j shortcut makes it look like it is actually

289

# unique to j at first, you have to traverse all of y->o to find it.

290

# q,n give the walker from j a common point to stop searching, as does p,f.

289

# unique to j at first, you have to traverse all of x->o to find it.

290

# q,m gives the walker from j a common point to stop searching, as does p,f.

291

# k-n exists so that the second pass still has nodes that are worth searching,

292

# rather than instantly cancelling the extra walker.

293