Mercurial Mercurial > master > rql / changeset
summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | raw | zip | gz | bz2 | help
Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
autopep8: fix E262 inline comment should start with '# '
authorPhilippe Pepiot <philippe.pepiot@logilab.fr>
Wed, 13 Feb 2019 17:23:28 +0100
changeset 847 f8ff67ee0d5a
parent 846 435999068f66
child 848 fcc4e6158204
autopep8: fix E262 inline comment should start with '# '
rql/analyze.py file | annotate | diff | comparison | revisions
rql/stcheck.py file | annotate | diff | comparison | revisions 
--- a/rql/analyze.py	Wed Feb 13 17:22:45 2019 +0100
+++ b/rql/analyze.py	Wed Feb 13 17:23:28 2019 +0100
@@ -527,7 +527,7 @@
                     ptypes = totypes & rhsdomain
                     res.append([([lhsvar], [str(fromtype)]),
                                   ([rhsvar], list(ptypes))])
-                    if same_var and (fromtype in totypes): #ptypes ?
+                    if same_var and (fromtype in totypes):  # ptypes ?
                         var_types.append(fromtype)
             constraints.or_and(res)
             if same_var:
--- a/rql/stcheck.py	Wed Feb 13 17:22:45 2019 +0100
+++ b/rql/stcheck.py	Wed Feb 13 17:23:28 2019 +0100
@@ -288,7 +288,7 @@
         pass
 
     def visit_and(self, et, state):
-        pass #assert len(et.children) == 2, len(et.children)
+        pass  # assert len(et.children) == 2, len(et.children)
 
     def leave_and(self, node, state):
         pass
@@ -411,19 +411,19 @@
         #                                                       relation)
 
     def visit_comparison(self, comparison, state):
-        pass #assert len(comparison.children) in (1,2), len(comparison.children)
+        pass  # assert len(comparison.children) in (1,2), len(comparison.children)
 
     def leave_comparison(self, node, state):
         pass
 
     def visit_mathexpression(self, mathexpr, state):
-        pass #assert len(mathexpr.children) == 2, len(mathexpr.children)
+        pass  # assert len(mathexpr.children) == 2, len(mathexpr.children)
 
     def leave_mathexpression(self, node, state):
         pass
 
     def visit_unaryexpression(self, unaryexpr, state):
-        pass #assert len(unaryexpr.children) == 2, len(unaryexpr.children)
+        pass  # assert len(unaryexpr.children) == 2, len(unaryexpr.children)
 
     def leave_unaryexpression(self, node, state):
         pass
master/rql