Commit fd053c81 authored by Jeroen F.J. Laros's avatar Jeroen F.J. Laros

PEP8.

parent 71c8b85c
""" """dict-trie: Basic implementation of a trie.
dict-trie: Basic implementation of a trie.
Copyright (c) 2017 Leiden University Medical Center <humgen@lumc.nl> Copyright (c) 2017 Leiden University Medical Center <humgen@lumc.nl>
......
def _hamming(path, node, word, distance): def _hamming(path, node, word, distance):
""" """Find the first path in the trie that is within a certain hamming
Find the first path in the trie that is within a certain hamming distance distance of {word}. Note that this does not necessarily the one with the
of {word}. Note that this does not necessarily the one with the smallest smallest distance.
distance.
:arg str path: Path taken so far to reach the current node. :arg str path: Path taken so far to reach the current node.
:arg dict node: Current node. :arg dict node: Current node.
...@@ -56,8 +55,7 @@ def _levenshtein(path, node, word, distance): ...@@ -56,8 +55,7 @@ def _levenshtein(path, node, word, distance):
class Trie(object): class Trie(object):
def __init__(self, words): def __init__(self, words):
""" """Initialise the class.
Initialise the class.
:arg list words: List of words. :arg list words: List of words.
""" """
...@@ -66,8 +64,7 @@ class Trie(object): ...@@ -66,8 +64,7 @@ class Trie(object):
self._build(words) self._build(words)
def _build(self, words): def _build(self, words):
""" """Build the trie.
Build the trie.
:arg list words: List of words. :arg list words: List of words.
""" """
...@@ -75,8 +72,7 @@ class Trie(object): ...@@ -75,8 +72,7 @@ class Trie(object):
self.add(word) self.add(word)
def _find(self, word): def _find(self, word):
""" """Find the node after following the path in the trie given by {word}.
Find the node after following the path in the trie given by {word}.
:arg str word: A word. :arg str word: A word.
...@@ -95,8 +91,7 @@ class Trie(object): ...@@ -95,8 +91,7 @@ class Trie(object):
return '' in self._find(word) return '' in self._find(word)
def add(self, word): def add(self, word):
""" """Add a word to the trie.
Add a word to the trie.
:arg str word: A word. :arg str word: A word.
""" """
...@@ -116,8 +111,7 @@ class Trie(object): ...@@ -116,8 +111,7 @@ class Trie(object):
return _hamming('', self.root, word, distance) return _hamming('', self.root, word, distance)
def best_hamming(self, word, distance): def best_hamming(self, word, distance):
""" """Find the best match with {word} in the trie.
Find the best match with {word} in the trie.
:arg str word: Query word. :arg str word: Query word.
:arg int distance: Amount of errors we can still make. :arg int distance: Amount of errors we can still make.
...@@ -138,8 +132,7 @@ class Trie(object): ...@@ -138,8 +132,7 @@ class Trie(object):
return _levenshtein('', self.root, word, distance) return _levenshtein('', self.root, word, distance)
def best_levenshtein(self, word, distance): def best_levenshtein(self, word, distance):
""" """Find the best match with {word} in the trie.
Find the best match with {word} in the trie.
:arg str word: Query word. :arg str word: Query word.
:arg int distance: Amount of errors we can still make. :arg int distance: Amount of errors we can still make.
......
""" """Tests for the trie library.
Tests for the trie library.
""" """
#from __future__ import ( #from __future__ import (
# absolute_import, division, print_function, unicode_literals) # absolute_import, division, print_function, unicode_literals)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment