phases: avoid N² behavior in `advanceboundary` We allowed duplicated entries in the deque, which each entry could potentially insert all its ancestors. So advancing boundary for the full repository would mean each revision would walk all its ancestors, resulting in O(N²) iteration. For repository of any decent size, N² is quickly insane. We introduce a simple set to avoid this and get back to reasonable performance.

     1

  $ hg init repo

     2

  $ cd repo

     3

  $ echo This is file a1 > a

     4

  $ hg add a

     5

  $ hg commit -m "commit #0"

     6

  $ ls -A

     7

  .hg

     8

  a

     9

  $ echo This is file b1 > b

    10

  $ hg add b

    11

  $ hg commit -m "commit #1"

    12

  $ hg co 0

    13

  0 files updated, 0 files merged, 1 files removed, 0 files unresolved

    14

    15

B should disappear

    16

    17

  $ ls -A

    18

  .hg

    19

  a