|
 |
0a39a2 |
From 7c4c4ba050252ba2ecce06672cb6a7dae34a5044 Mon Sep 17 00:00:00 2001
|
|
|
0a39a2 |
From: Antonio Valentino <antonio.valentino@tiscali.it>
|
|
|
0a39a2 |
Date: Sat, 21 Dec 2019 18:18:01 +0100
|
|
|
0a39a2 |
Subject: [PATCH] Fix syntax warnings
|
|
|
0a39a2 |
|
|
|
0a39a2 |
---
|
|
|
0a39a2 |
tables/scripts/pttree.py | 5 ++---
|
|
|
0a39a2 |
1 file changed, 2 insertions(+), 3 deletions(-)
|
|
|
0a39a2 |
|
|
|
0a39a2 |
diff --git a/tables/scripts/pttree.py b/tables/scripts/pttree.py
|
|
|
0a39a2 |
index 8101a6bf78..a3cad7e3a3 100644
|
|
|
0a39a2 |
--- a/tables/scripts/pttree.py
|
|
|
0a39a2 |
+++ b/tables/scripts/pttree.py
|
|
|
0a39a2 |
@@ -221,7 +221,6 @@ def get_tree_str(f, where='/', max_depth=-1, print_class=True,
|
|
|
0a39a2 |
else:
|
|
|
0a39a2 |
leaves.append(node)
|
|
|
0a39a2 |
|
|
|
0a39a2 |
-
|
|
|
0a39a2 |
# on the second pass we start at each leaf and work upwards towards the
|
|
|
0a39a2 |
# root node, computing the cumulative size of each branch at each node, and
|
|
|
0a39a2 |
# instantiating a PrettyTree object for each node to create an ASCII
|
|
|
0a39a2 |
@@ -317,7 +316,7 @@ def get_tree_str(f, where='/', max_depth=-1, print_class=True,
|
|
|
0a39a2 |
pretty[path].sort_by = node._v_name
|
|
|
0a39a2 |
else:
|
|
|
0a39a2 |
# natural order
|
|
|
0a39a2 |
- if path is '/':
|
|
|
0a39a2 |
+ if path == '/':
|
|
|
0a39a2 |
# root is not in root._v_children
|
|
|
0a39a2 |
pretty[path].sort_by = 0
|
|
|
0a39a2 |
else:
|
|
|
0a39a2 |
@@ -326,7 +325,7 @@ def get_tree_str(f, where='/', max_depth=-1, print_class=True,
|
|
|
0a39a2 |
|
|
|
0a39a2 |
# exclude root node or we'll get infinite recursions (since '/' is
|
|
|
0a39a2 |
# the parent of '/')
|
|
|
0a39a2 |
- if path is not '/':
|
|
|
0a39a2 |
+ if path != '/':
|
|
|
0a39a2 |
|
|
|
0a39a2 |
# create a PrettyTree for the parent of this node, if one
|
|
|
0a39a2 |
# doesn't exist already
|