release v2.0.7

BUGFIX: foreach with empty tree raised exception
close issue #3

NEWS.rst

@@ -2,10 +2,9 @@
 NEWS
 ====
 
-bintrees development stopped, use `sortedcontainers` instead: https://pypi.python.org/pypi/sortedcontainers
-
-Version 2.0.7 - ...
+Version 2.0.7 - 2017-04-28
 
+  * BUGFIX: foreach (pure Python implementation) works with empty trees
   * acquire GIL for PyMem_Malloc() and PyMem_Free() calls
 
 Version 2.0.6 - 2017-02-04

bintrees/abctree.py

@@ -644,6 +644,9 @@ def foreach(self, func, order=0):
         parm func: function(key, value)
         param int order: inorder = 0, preorder = -1, postorder = +1
         """
+        if self.count == 0:
+            return
+
         def _traverse(node):
             if order == -1:
                 func(node.key, node.value)

setup.py

@@ -26,7 +26,7 @@ def read(fname):
 
 setup(
     name='bintrees',
-    version='2.0.6',
+    version='2.0.7',
     description='Package provides Binary-, RedBlack- and AVL-Trees in Python and Cython.',
     author='mozman',
     url='https://github.com/mozman/bintrees.git',

tests/test_all_trees.py

@@ -868,6 +868,17 @@ def test_101_deepcopy_tree_in_tree(self):
         self.assertEqual(id(copytree21[5]), id(copytree22[5]))  # sublist copied only once?
         self.assertEqual(id(copytree21[5]), id(copytree23[5]))  # sublist copied only once?
 
+    def test_102_deepcopy_empty_tree(self):
+        tree1 = self.TREE_CLASS()
+        tree2 = deepcopy(tree1)
+        self.assertEqual(len(tree2), 0)
+
+    def test_103_foreach_with_empty_tree(self):
+        tree1 = self.TREE_CLASS()
+        # does not raise any exception
+        tree1.foreach(lambda k, v: None)
+        self.assertTrue(True)
+
 
 class TestBinaryTree(CheckTree, unittest.TestCase):
     TREE_CLASS = BinaryTree