Mercurial > hg > pyhgsh

comparison mercurial/hgweb.py @ 343:d7df759d0e97

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
rework all code using tags -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 rework all code using tags Add three utility functions: tags(): get (and possibly load) the tags mapping tagslist(): sort tag,node by revision (aka topologically) nodetags(): return a list of tags associated with a node (also cached) Update all the code using tags to use these. Simplify identify code make unknown always visible if printed don't ignore tip pseudo-tag manifest hash: e6deb4d545ad465be7735f9ec43227bcb5e238c7 -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.0 (GNU/Linux) iD8DBQFCr+HjywK+sNU5EO8RAh4/AJ90cI0WxmvQAj6Lq2ZiG8LmqZan/QCfR8B5 ltu8tOIEHDa8LhfS9wtBu0k= =pv3t -----END PGP SIGNATURE-----
author mpm@selenic.com
date Wed, 15 Jun 2005 00:08:03 -0800
parents 27d08c0c2a7e
children b4e0e20646bb
comparison
equal deleted inserted replaced
342:f7c51058cbb7 343:d7df759d0e97
521 521
522 def tags(self): 522 def tags(self):
523 cl = self.repo.changelog 523 cl = self.repo.changelog
524 mf = cl.read(cl.tip())[0] 524 mf = cl.read(cl.tip())[0]
525 525
526 self.repo.lookup(0) # prime the cache 526 i = self.repo.tagslist()
527 i = self.repo.tags.items() 527 i.reverse()
528 n = [ (cl.rev(e[1]), e) for e in i ] # sort by revision
529 n.sort()
530 n.reverse()
531 i = [ e[1] for e in n ]
532 528
533 def entries(): 529 def entries():
534 parity = 0 530 parity = 0
535 for k,n in i: 531 for k,n in i:
536 yield self.t("tagentry", 532 yield self.t("tagentry",