# HG changeset patch
# User Pierre-Yves David <pierre-yves.david@fb.com>
# Date 1412290435 18000
# Node ID 7b123e5639f4e5304c0c2dfd5b698e1c879b6d66
# Parent  b89f7e3a414d63217576cee4c97d554f5bf54757
spanset: do a single range check in __contains__

Now that `start <= end` is always true, we can simplify this function.

diff -r b89f7e3a414d -r 7b123e5639f4 mercurial/revset.py
--- a/mercurial/revset.py	Thu Oct 02 18:02:17 2014 -0500
+++ b/mercurial/revset.py	Thu Oct 02 17:53:55 2014 -0500
@@ -2895,10 +2895,8 @@
         return iter(iterrange)
 
     def __contains__(self, rev):
-        start = self._start
-        end = self._end
         hidden = self._hiddenrevs
-        return (((end < rev <= start) or (start <= rev and rev < end))
+        return ((self._start <= rev < self._end)
                 and not (hidden and rev in hidden))
 
     def __nonzero__(self):