# HG changeset patch
# User Mads Kiilerich <mads@kiilerich.com>
# Date 2019-12-26 04:07:03
# Node ID c4c2df84442451413e9270e12caa1654bed7a8b4
# Parent  756e46bd926b94a1fbb6d04abe0b3369035ab5eb

py3: zip will return an iterator - apply list before reversing

diff --git a/kallithea/lib/vcs/backends/git/inmemory.py b/kallithea/lib/vcs/backends/git/inmemory.py
--- a/kallithea/lib/vcs/backends/git/inmemory.py
+++ b/kallithea/lib/vcs/backends/git/inmemory.py
@@ -113,7 +113,7 @@ class GitInMemoryChangeset(BaseInMemoryC
                 except KeyError:
                     break
             # Cut down the blob and all rotten trees on the way back...
-            for path, tree in reversed(zip(paths, trees)):
+            for path, tree in reversed(list(zip(paths, trees))):
                 del tree[path]
                 if tree:
                     # This tree still has elements - don't remove it or any