phases: large rewrite on retract boundary The new code is still pure Python, so we still have room to going significantly faster. However its complexity of the complex part is `O(|[min_new_draft, tip]|)` instead of `O(|[min_draft, tip]|` which should help tremendously one repository with old draft (like mercurial-devel or mozilla-try). This is especially useful as the most common "retract boundary" operation happens when we commit/rewrite new drafts or when we push new draft to a non-publishing server. In this case, the smallest new_revs is very close to the tip and there is very few work to do. A few smaller optimisation could be done for these cases and will be introduced in later changesets. We still have iterate over large sets of roots, but this is already a great improvement for a very small amount of work. We gather information on the affected changeset as we go as we can put it to use in the next changesets. This extra data collection might slowdown the `register_new` case a bit, however for register_new, it should not really matters. The set of new nodes is either small, so the impact is negligible, or the set of new nodes is large, and the amount of work to do to had them will dominate the overhead the collecting information in `changed_revs`. As this new code compute the changes on the fly, it unlock other interesting improvement to be done in later changeset.

     1

BasedOnStyle: LLVM

     2

IndentWidth: 8

     3

UseTab: ForIndentation

     4

BreakBeforeBraces: Linux

     5

AllowShortIfStatementsOnASingleLine: false

     6

IndentCaseLabels: false

     7

AllowShortBlocksOnASingleLine: false

     8

AllowShortFunctionsOnASingleLine: false

     9

IncludeCategories:

    10

  - Regex:           '^<'

    11

    Priority:        1

    12

  - Regex:           '^"'

    13

    Priority:        2