This implements the nodesbetween method, and it removes the newer method
and replaces it with calls to nodesbetween.
nodesbetween calculates all the changesets needed to have a complete
revision graph between a given set of base nodes and a given set of
head nodes.
<table class="changelogEntry parity#parity#">
<tr>
<th class="age" width="15%">#date|age# ago:</th>
<th class="firstline">#desc|firstline|escape#</th>
</tr>
<tr>
<th class="changesetRev">changeset #rev#:</th>
<td class="changesetNode"><a href="?cmd=changeset;node=#node#">#node|short#</a></td>
</tr>
#parent#
#changelogtag#
<tr>
<th class="author">author:</th>
<td class="author">#author|obfuscate#</td>
</tr>
<tr>
<th class="date">date:</th>
<td class="date">#date|date#</td>
</tr>
<tr>
<th class="files"><a href="?cmd=manifest;manifest=#manifest#;path=/">files</a>:</th>
<td class="files">#files#</td>
</tr>
</table>