# HG changeset patch
# User Pierre-Yves David <pierre-yves.david@fb.com>
# Date 1412392728 25200
# Node ID ff6689b47e4894db6873167dd33a7adcd80c0840
# Parent  bec4365a0707725c5ca1537b7188d6f05fd47bec
addset: drop the leading underscore from the class name

This class is now a real smartset.

diff -r bec4365a0707 -r ff6689b47e48 mercurial/revset.py
--- a/mercurial/revset.py	Fri Oct 03 20:17:12 2014 -0700
+++ b/mercurial/revset.py	Fri Oct 03 20:18:48 2014 -0700
@@ -668,7 +668,7 @@
     result = (filteredset(s, subset.__contains__, ascending=True) +
               filteredset(args, subset.__contains__, ascending=True))
 
-    # Wrap result in a filteredset since it's an _addset, which doesn't
+    # Wrap result in a filteredset since it's an addset, which doesn't
     # implement all the necessary functions to be consumed by callers.
     return filteredset(result, lambda r: True, ascending=True)
 
@@ -2285,7 +2285,7 @@
             kwargs['ascending'] = True
         if self.isdescending() and other.isdescending():
             kwargs['ascending'] = False
-        return _addset(self, other, **kwargs)
+        return addset(self, other, **kwargs)
 
     def __sub__(self, other):
         """Returns a new object with the substraction of the two collections.
@@ -2460,7 +2460,7 @@
     def isdescending(self):
         return self._ascending is not None and not self._ascending
 
-class _addset(abstractsmartset):
+class addset(abstractsmartset):
     """Represent the addition of two sets
 
     Wrapper structure for lazily adding two structures without losing much