dirstate-tree: Add tree traversal/iteration
Like Python’s, Rust’s iterators are "external" in that they are driven
by a caller who calls a `next` method. This is as opposed to "internal"
iterators who drive themselves and call a callback for each item.
Writing an internal iterator traversing a tree is easy with recursion,
but internal iterators cannot rely on the call stack in that way,
they must save in an explicit object all state that they need to be
preserved across two `next` calls.
This algorithm uses a `Vec` as a stack that contains what would be
local variables on the call stack if we could use recursion.
Differential Revision: https://phab.mercurial-scm.org/D10370
# tiny extension to report phase changes during transaction
from __future__ import absolute_import
def reposetup(ui, repo):
def reportphasemove(tr):
for revs, move in sorted(tr.changes[b"phases"], key=lambda r: r[0][0]):
for rev in revs:
if move[0] is None:
ui.write(
(
b'test-debug-phase: new rev %d: x -> %d\n'
% (rev, move[1])
)
)
else:
ui.write(
(
b'test-debug-phase: move rev %d: %d -> %d\n'
% (rev, move[0], move[1])
)
)
class reportphaserepo(repo.__class__):
def transaction(self, *args, **kwargs):
tr = super(reportphaserepo, self).transaction(*args, **kwargs)
tr.addpostclose(b'report-phase', reportphasemove)
return tr
repo.__class__ = reportphaserepo