[Checkins] SVN: BTrees/branches/py3k/ Reify remaining zips.

[Tres Seaver]

Log message for revision 128667:
  Reify remaining zips.

Changed:
  _U  BTrees/branches/py3k/
  U   BTrees/branches/py3k/BTrees/tests/common.py

-=-
Modified: BTrees/branches/py3k/BTrees/tests/common.py
===================================================================
--- BTrees/branches/py3k/BTrees/tests/common.py	2012-12-14 22:37:16 UTC (rev 128666)
+++ BTrees/branches/py3k/BTrees/tests/common.py	2012-12-14 22:37:17 UTC (rev 128667)
@@ -457,7 +457,7 @@
         # For IITreeSets, this one was returning 31 for len(keys), and
         # list(keys) produced a list with 100 elements.
         t.clear()
-        t.update(zip(range(300), range(300)))
+        t.update(list(zip(range(300), range(300))))
         keys = t.keys(200, 50)
         self.assertEqual(len(keys), 0)
         self.assertEqual(list(keys), [])
@@ -1526,7 +1526,7 @@
 # that builds an object of that type given only a list of keys.
 def makeBuilder(mapbuilder):
     def result(keys=[], mapbuilder=mapbuilder):
-        return mapbuilder(zip(keys, keys))
+        return mapbuilder(list(zip(keys, keys)))
     return result
 
 # Subclasses have to set up:
@@ -1730,7 +1730,7 @@
     # If obj is a set, return a bucket with values all 1; else return obj.
     def _normalize(self, obj):
         if isaset(obj):
-            obj = self.mkbucket(zip(obj, [1] * len(obj)))
+            obj = self.mkbucket(list(zip(obj, [1] * len(obj))))
         return obj
 
     # Python simulation of weightedUnion.