mercurial: comparison mercurial/revset.py

equal deleted inserted replaced

-:6eab50a34fed
+:e53f6b72a0e4
 self._list
 return iter(self)
 return it()
 def _trysetasclist(self):
-"""populate the _asclist attribut if possible and necessary"""
+"""populate the _asclist attribute if possible and necessary"""
 if self._genlist is not None and self._asclist is None:
 self._asclist = sorted(self._genlist)
 @property
 def fastasc(self):
 if self._finished:
 return iter(self._genlist)
 # We have to use this complex iteration strategy to allow multiple
 # iterations at the same time. We need to be able to catch revision
-# removed from `consumegen` and added to genlist in another instance.
+# removed from _consumegen and added to genlist in another instance.
 #
 # Getting rid of it would provide an about 15% speed up on this
 # iteration.
 genlist = self._genlist
 nextrev = self._consumegen().next
 return None
 class fullreposet(_spanset):
 """a set containing all revisions in the repo
-This class exists to host special optimisation.
+This class exists to host special optimization.
 """
 def __init__(self, repo):
 super(fullreposet, self).__init__(repo)
 def __and__(self, other):
-"""fullrepo & other -> other
+"""As self contains the whole repo, all of the other set should also be
+in self. Therefore `self & other = other`.
-As self contains the whole repo, all of the other set should also be in
-self. Therefor `self & other = other`.
 This boldly assumes the other contains valid revs only.
 """
 # other not a smartset, make is so
 if not util.safehasattr(other, 'isascending'):

changeset 23139	e53f6b72a0e4
parent 23127	7361d8244efb
child 23162	69524a05a7fa