view templates/filerevision.tmpl @ 147:b6d8ed7aeba0

A new ancestor algorithm The old ancestor algorithm could get fooled into returning ancestors closer to root than it ought to. Hopefully this one, which strictly orders its search by distance from room, will be foolproof.
author mpm@selenic.com
date Tue, 24 May 2005 23:11:44 -0800
parents 529bf610092e
children e8a360cd5a9f 083c38bdfa64
line wrap: on
line source

#header#
<title>#repo#:#file#</title>
</head>
<body>

<div class=buttons>
<a href="?cmd=changelog&rev=#rev#">changelog</a>
<a href="?cmd=changeset&node=#node#">changeset</a>
<a href="?cmd=manifest&manifest=#manifest#;path=#path#">manifest</a>
<a href="?cmd=filelog&file=#file#;filenode=#filenode#">revisions</a>
<a href="?cmd=annotate&file=#file#&filenode=#filenode#">annotate</a>
</div>

<h2>#file# (revision #filenode#)</h2>

<table>
<tr>
 <td class=metatag>changeset:</td>
 <td><a href="?cmd=changeset;node=#node#">#rev#:#node#</a></td></tr>
#parent1#
#parent2#
<tr>
 <td class=metatag>manifest:</td>
 <td><a href="?cmd=manifest;manifest=#manifest#;path=/">#rev#:#manifest#</a></td></tr>
<tr>
 <td class=metatag>author:</td>
 <td>#author#</td></tr>
<tr>
 <td class=metatag>date:</td>
 <td>#date#</td></tr>
</table>

<pre>
#text#
</pre>

#footer#