This is an archive of the discontinued Mercurial Phabricator instance.

Differential D10443

template: make an explicit closure for formatting entry in peerurls
ClosedPublic

Authored by marmoute on Apr 15 2021, 8:03 PM.

Details

Reviewers
Alphare
pulkit
Group Reviewers
hg-reviewers
Commits
rHG824ee4aaa09b: template: make an explicit closure for formatting entry in peerurls
rHGd63c01a3179d: template: make an explicit closure for formatting entry in peerurls
Summary

This is about to be become significantly more complicated as ui.path[x] will
become a list.

Diff Detail

Repository
rHG Mercurial
Branch
default
Lint
No Linters Available
Unit
No Unit Test Coverage

Event Timeline

marmoute created this revision.Apr 15 2021, 8:03 PM
baymax updated this revision to Diff 27012.Apr 17 2021, 7:44 PM

✅ refresh by Heptapod after a successful CI run (🐙 💚)

Alphare accepted this revision.Apr 20 2021, 10:57 AM
This revision is now accepted and ready to land.Apr 20 2021, 10:57 AM
baymax updated this revision to Diff 27203.Apr 29 2021, 1:47 PM

✅ refresh by Heptapod after a successful CI run (🐙 💚)

pulkit accepted this revision.Apr 30 2021, 5:57 AM
baymax updated this revision to Diff 27231.Apr 30 2021, 8:25 AM

✅ refresh by Heptapod after a successful CI run (🐙 💚)

Revision Contents
Changeset List

PathPackages
Mmercurial/templatekw.py (5 lines)

Diff 27231

mercurial/templatekw.py

urls = util.sortdict((k, p.rawloc) for k, p in all_paths) urls = util.sortdict((k, p.rawloc) for k, p in all_paths)
def makemap(k): def makemap(k):
p = paths[k] p = paths[k]
d = {b'name': k, b'url': p.rawloc} d = {b'name': k, b'url': p.rawloc}
d.update((o, v) for o, v in sorted(pycompat.iteritems(p.suboptions))) d.update((o, v) for o, v in sorted(pycompat.iteritems(p.suboptions)))
return d return d
return _hybrid(None, urls, makemap, lambda k: b'%s=%s' % (k, urls[k])) def format_one(k):
return b'%s=%s' % (k, urls[k])
return _hybrid(None, urls, makemap, format_one)
@templatekeyword(b"predecessors", requires={b'repo', b'ctx'}) @templatekeyword(b"predecessors", requires={b'repo', b'ctx'})
def showpredecessors(context, mapping): def showpredecessors(context, mapping):
"""Returns the list of the closest visible predecessors. (EXPERIMENTAL)""" """Returns the list of the closest visible predecessors. (EXPERIMENTAL)"""
repo = context.resource(mapping, b'repo') repo = context.resource(mapping, b'repo')
ctx = context.resource(mapping, b'ctx') ctx = context.resource(mapping, b'ctx')
predecessors = sorted(obsutil.closestpredecessors(repo, ctx.node())) predecessors = sorted(obsutil.closestpredecessors(repo, ctx.node()))