Mercurial > hg
changeset 14206:2bf60f158ecb
setdiscovery: limit lines to 80 characters
| author | Steven Brown <StevenGBrown@gmail.com> |
|---|---|
| date | Thu, 05 May 2011 23:21:37 +0800 |
| parents | 5fa21960b2f4 |
| children | c1cca38818b9 |
| files | mercurial/dagutil.py mercurial/setdiscovery.py |
| diffstat | 2 files changed, 14 insertions(+), 8 deletions(-) [+] |
line wrap: on
line diff
--- a/mercurial/dagutil.py Wed May 04 22:08:55 2011 -0500 +++ b/mercurial/dagutil.py Thu May 05 23:21:37 2011 +0800 @@ -40,18 +40,24 @@ raise NotImplementedError() def ancestorset(self, starts, stops=None): - '''set of all ancestors of starts (incl), but stop walk at stops (excl)''' + ''' + set of all ancestors of starts (incl), but stop walk at stops (excl) + ''' raise NotImplementedError() def descendantset(self, starts, stops=None): - '''set of all descendants of starts (incl), but stop walk at stops (excl)''' + ''' + set of all descendants of starts (incl), but stop walk at stops (excl) + ''' return self.inverse().ancestorset(starts, stops) def headsetofconnecteds(self, ixs): - '''subset of connected list of ixs so that no node has a descendant in it + ''' + subset of connected list of ixs so that no node has a descendant in it By "connected list" we mean that if an ancestor and a descendant are in - the list, then so is at least one path connecting them.''' + the list, then so is at least one path connecting them. + ''' raise NotImplementedError() def externalize(self, ix):
--- a/mercurial/setdiscovery.py Wed May 04 22:08:55 2011 -0500 +++ b/mercurial/setdiscovery.py Thu May 05 23:21:37 2011 +0800 @@ -82,8 +82,8 @@ initialsamplesize=100, fullsamplesize=200, abortwhenunrelated=True): - '''Return a tuple (common, anyincoming, remoteheads) used to identify missing - nodes from or in remote. + '''Return a tuple (common, anyincoming, remoteheads) used to identify + missing nodes from or in remote. shortcutlocal determines whether we try use direct access to localrepo if remote is actually local. @@ -106,8 +106,8 @@ return [nullid], True, srvheadhashes return [nullid], False, [] - # start actual discovery (we note this before the next "if" for compatibility - # reasons) + # start actual discovery (we note this before the next "if" for + # compatibility reasons) ui.status(_("searching for changes\n")) srvheads = dag.internalizeall(srvheadhashes, filterunknown=True)