Python std::unordered_set tidy up and additional testing

Author: wsfulton

Examples/test-suite/python/cpp11_hash_tables_runme.py

@@ -34,6 +34,7 @@ def swig_assert_equal(a, b):
 		  cpp11_hash_tables.UnorderedMultiMapIntInt({1:7})]:
 	x[1] = 9
 	swig_assert_equal(sorted([v for k, v in x.iteritems()]), [7, 9])
+	swig_assert_equal(len(x), 2)
 
 for x in [cpp11_hash_tables.SetInt([1]),
 		  cpp11_hash_tables.MultiSetInt([1]),
@@ -56,3 +57,4 @@ def swig_assert_equal(a, b):
 		  cpp11_hash_tables.UnorderedMultiSetInt([1])]:
 	x.append(1)
 	swig_assert_equal(x.count(1), 2)
+	swig_assert_equal(len(x), 2)

Lib/python/std_unordered_set.i

@@ -49,7 +49,7 @@
 #endif
 
 
-  %extend  {
+  %extend {
      void append(value_type x) {
        self->insert(x);
      }
@@ -61,8 +61,7 @@
      value_type __getitem__(difference_type i) const throw (std::out_of_range) {
        return *(swig::cgetpos(self, i));
      }
-
-  };
+  }
 %enddef
 
 %include <std/std_unordered_set.i>