Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Updates to pass latest version of pylint #1022

Merged
merged 1 commit into from
May 29, 2024
Merged

Updates to pass latest version of pylint #1022

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions vunit/check_preprocessor.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -99,6 +99,7 @@ def even_quotes(code):
return (n_quotes % 2) == 0

code_section = Token.NORMAL
next_code_section = Token.NORMAL
level = 1
index = 0
for char in code:
Expand Down
6 changes: 4 additions & 2 deletions vunit/dependency_graph.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -94,10 +94,12 @@ def visit(node):
callback(node)

visited: Set[T] = set()
path: Set[T] = set()
path_ordered: List[T] = []
for node in nodes:
if node not in visited:
path: Set[T] = set()
path_ordered: List[T] = []
path = set()
path_ordered = []
visit(node)

def get_dependent(self, nodes: Iterable[T]) -> Set[T]:
Expand Down