stablesort: record, cache and reuse jump Iterating below a merge means two things: 1) iterate over the part exclusive to the higher parents, 2) iterate from the lower parents. While iterating on the exclusive part, there will be case were we just go the next natural parent, and case were we'll have to "jump" to another revision. If we record all point this "jump" happens and their target, we can easily reproduce the iteration in the future. With that information we can iterate over the exclusive part of the merge without having to compute it entirely. In addition we store the reason of the jump. This will help the stable range processing later.

     1

  $ cat >> $HGRCPATH <<EOF

     2

  > [ui]

     3

  > logtemplate={rev}:{node|short}[{bookmarks}] ({obsolete}/{phase}) {desc|firstline}\n

     4

  > [extensions]

     5

  > EOF

     6

  $ echo "evolve=$(echo $(dirname $TESTDIR))/hgext3rd/evolve/" >> $HGRCPATH

     7

     8

  $ mkcommit() {

     9

  >    echo "$1" > "$1"

    10

  >    hg add "$1"

    11

  >    hg ci -m "add $1"

    12

  > }

    13

    14

  $ hg init repo

    15

  $ cd repo

    16

  $ mkcommit a

    17

  $ mkcommit b

    18

    19

test disabling commands

    20

    21

  $ cat >> .hg/hgrc <<EOF

    22

  > [experimental]

    23

  > evolution=createmarkers

    24

  >   allowunstable

    25

  >   exchange

    26

  > EOF

    27

  $ hg prune | head -n 2

    28

  hg: unknown command 'prune'

    29

  Mercurial Distributed SCM

    30