addset: use base implementation for __and__
authorPierre-Yves David <pierre-yves.david@fb.com>
Fri, 03 Oct 2014 01:31:46 -0500
changeset 22745 021660aeb75e
parent 22744 3ed3ca4dfd31
child 22746 11a543b5de6f
addset: use base implementation for __and__
mercurial/revset.py
--- a/mercurial/revset.py	Thu Oct 02 19:42:06 2014 -0500
+++ b/mercurial/revset.py	Fri Oct 03 01:31:46 2014 -0500
@@ -2607,12 +2607,6 @@
             if self._ascending:
                 self.reverse()
 
-    def __and__(self, other):
-        filterfunc = other.__contains__
-        if self._ascending is not None:
-            return orderedlazyset(self, filterfunc, ascending=self._ascending)
-        return filteredset(self, filterfunc)
-
     def __sub__(self, other):
         filterfunc = lambda r: r not in other
         if self._ascending is not None: