mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

noqa: F821 This syntax is Python 3 only

Browse Source
This commit is contained in:
cclauss 2018-01-20 12:35:12 +01:00 committed by GitHub
parent cc5102ab01
commit 3f6760ee15
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
data_structures/Trie/Trie.py
View File

@ -12,7 +12,7 @@ class TrieNode:
self.nodes = dict() # Mapping from char to TrieNode
self.is_leaf = False
def insert_many(self, words: [str]):
def insert_many(self, words: [str]): # noqa: F821 This syntax is Python 3 only
"""
Inserts a list of words into the Trie
:param words: list of string words
@ -34,7 +34,7 @@ class TrieNode:
curr = curr.nodes[char]
curr.is_leaf = True
def find(self, word: str) -> bool:
def find(self, word: str) -> bool: # noqa: F821 This syntax is Python 3 only
"""
Tries to find word in a Trie
:param word: word to look for
@ -48,7 +48,7 @@ class TrieNode:
return curr.is_leaf
def print_words(node: TrieNode, word: str):
def print_words(node: TrieNode, word: str): # noqa: F821 This syntax is Python 3 only
"""
Prints all the words in a Trie
:param node: root node of Trie