From 130a6d2b43bb23a90e9e7bd1c40175e02b8a82f1 Mon Sep 17 00:00:00 2001 From: Antoine Lambert Date: Thu, 26 Oct 2017 18:50:39 +0200 Subject: [PATCH] add Python 3 support --- h3/tree.py | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/h3/tree.py b/h3/tree.py index 5b30d2a..e5fe41b 100644 --- a/h3/tree.py +++ b/h3/tree.py @@ -47,7 +47,7 @@ def __init__(self, edges=None): edges = None # Release that memory. - for id, node in self.nodes.iteritems(): + for id, node in self.nodes.items(): if node.parent is None: self.root = node break @@ -88,7 +88,7 @@ def get_leaf_nodes(self): :returns: A generator of all the leaf nodes in the Tree """ - for node_id, node in self.nodes.iteritems(): + for node_id, node in self.nodes.items(): if not node.children: yield node.node_id @@ -227,7 +227,7 @@ def sort_children_by_radius(self): for child in self.nodes[node_id].children] child_size_pair.sort(key=itemgetter(1), reverse=True) if child_size_pair: - self.nodes[node_id].children = list(zip(*child_size_pair)[0]) + self.nodes[node_id].children = list(zip(*child_size_pair))[0] depth += 1 current_generation = next_generation @@ -252,7 +252,7 @@ def sort_children_by_tree_size(self): for child in self.nodes[node_id].children] child_size_pair.sort(key=itemgetter(1), reverse=True) if child_size_pair: - self.nodes[node_id].children = list(zip(*child_size_pair)[0]) + self.nodes[node_id].children = list(zip(*child_size_pair))[0] depth += 1 current_generation = next_generation