merge: fix --preview to show all nodes that will be merged (
issue2043).
Formerly, it omitted nodes that were not descendants of the least
common ancestor of the two merge parents, even though those nodes
contribute to the merge. The new algorithm uses revlog.findmissing()
instead of ancestor() + nodesbetween().
#!/bin/sh
# Some tests for hgweb in an empty repository
hg init test
cd test
hg serve -n test -p $HGPORT -d --pid-file=hg.pid -A access.log -E errors.log
cat hg.pid >> $DAEMON_PIDS
("$TESTDIR/get-with-headers.py" localhost:$HGPORT '/shortlog')
("$TESTDIR/get-with-headers.py" localhost:$HGPORT '/log')
("$TESTDIR/get-with-headers.py" localhost:$HGPORT '/graph')
("$TESTDIR/get-with-headers.py" localhost:$HGPORT '/file')