Archives/wting_autojump
1
0
Fork 0
mirror of https://github.com/wting/autojump synced 2025-06-13 12:54:07 +00:00
Code Issues Releases Wiki Activity

Implement Ukkonen's cut-off heuristic.

Browse Source
This commit is contained in:
jez 2011-05-31 17:01:09 +00:00
parent 7ffb81d08e
commit d6a92e4582
1 changed files with 14 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
autojump
View File

@ -88,10 +88,11 @@ def clean_dict(sorted_dirs, path_dict):
return True return True
else: return False else: return False
def approximatch(pat, text): def approximatch(pat, text, max_errors):
cols = [list(range(0, len(pat)+1))] cols = [list(range(0, len(pat)+1))]
for i in range(0, len(text)): cols.append([0] * (len(pat) + 1))
errors = len(pat) errors = len(pat)
for i in range(0, len(text)): cols.append([errors] * (len(pat) + 1))
last_active = min(max_errors, len(pat))
last_seen_in_text = {} last_seen_in_text = {}
for i, char1 in enumerate(text): for i, char1 in enumerate(text):
cols[i+1][0] = 0 cols[i+1][0] = 0
@ -106,8 +107,17 @@ def approximatch(pat, text):
cols[i+1][j+1] = 1 + min(cols[i+1][j], cols[i][j+1], cols[i][j]) cols[i+1][j+1] = 1 + min(cols[i+1][j], cols[i][j+1], cols[i][j])
if i1 and j1: if i1 and j1:
cols[i+1][j+1] = min(cols[i+1][j+1], 1 + (i - i1) + (j - j1) + cols[i1-1][j1-1]) cols[i+1][j+1] = min(cols[i+1][j+1], 1 + (i - i1) + (j - j1) + cols[i1-1][j1-1])
errors = min(errors, cols[i+1][-1])
if j + 1 == len(pat):
errors = min(errors, cols[i+1][j+1])
elif j + 1 == last_active + 1:
break
last_seen_in_text[char1] = i + 1 last_seen_in_text[char1] = i + 1
if last_active < len(pat): last_active += 1
while cols[i+1][last_active] > max_errors: last_active -= 1
return errors return errors
def find_matches(dirs, patterns, result_list, ignore_case, approx, max_matches): def find_matches(dirs, patterns, result_list, ignore_case, approx, max_matches):
@ -135,7 +145,7 @@ def find_matches(dirs, patterns, result_list, ignore_case, approx, max_matches):
total_errors = 0 total_errors = 0
bad_match = False bad_match = False
for pattern, match_string in get_pattern_and_match(patterns, path): for pattern, match_string in get_pattern_and_match(patterns, path):
errors = approximatch(pattern, match_string) errors = approximatch(pattern, match_string, 2)
if errors >= len(pattern) or errors >= len(match_string): if errors >= len(pattern) or errors >= len(match_string):
bad_match = True bad_match = True
break break