diff -r 1816b622aef2 -r 62ae22eae123 eric6/Utilities/ModuleParser.py
--- a/eric6/Utilities/ModuleParser.py Sun May 02 18:16:54 2021 +0200
+++ b/eric6/Utilities/ModuleParser.py Mon May 03 19:42:27 2021 +0200
@@ -1213,10 +1213,10 @@
@return A dictionary with inheritance hierarchies.
"""
hierarchy = {}
- for cls in list(list(self.classes.keys())):
- self.assembleHierarchy(cls, self.classes, [cls], hierarchy)
- for mod in list(list(self.modules.keys())):
- self.assembleHierarchy(mod, self.modules, [mod], hierarchy)
+ for class_ in self.classes:
+ self.assembleHierarchy(class_, self.classes, [class_], hierarchy)
+ for module in self.modules:
+ self.assembleHierarchy(module, self.modules, [module], hierarchy)
return hierarchy
def assembleHierarchy(self, name, classes, path, result):
@@ -1236,16 +1236,16 @@
"""
rv = {}
if name in classes:
- for cls in classes[name].super:
- if cls not in classes:
- rv[cls] = {}
- exhausted = path + [cls]
+ for class_ in classes[name].super:
+ if class_ not in classes:
+ rv[class_] = {}
+ exhausted = path + [class_]
exhausted.reverse()
self.addPathToHierarchy(
exhausted, result, self.addPathToHierarchy)
else:
- rv[cls] = self.assembleHierarchy(
- cls, classes, path + [cls], result)
+ rv[class_] = self.assembleHierarchy(
+ class_, classes, path + [class_], result)
if len(rv) == 0:
exhausted = path
