mirror of
https://github.com/wting/autojump
synced 2024-09-28 22:10:45 +00:00
121 lines
3.9 KiB
Python
121 lines
3.9 KiB
Python
#!/usr/bin/env python
|
|
# -*- coding: utf-8 -*-
|
|
import os
|
|
import re
|
|
import sys
|
|
from difflib import SequenceMatcher
|
|
|
|
|
|
if sys.version_info[0] == 3:
|
|
ifilter = filter
|
|
imap = map
|
|
os.getcwdu = os.getcwd
|
|
else:
|
|
from itertools import ifilter
|
|
from itertools import imap
|
|
|
|
|
|
def match_anywhere(needles, haystack, ignore_case=False):
|
|
"""
|
|
Matches needles anywhere in the path as long as they're in the same (but
|
|
not necessary consecutive) order.
|
|
|
|
For example:
|
|
needles = ['foo', 'baz']
|
|
regex needle = r'.*foo.*baz.*'
|
|
haystack = [
|
|
(path="/foo/bar/baz", weight=10),
|
|
(path="/baz/foo/bar", weight=10),
|
|
(path="/foo/baz", weight=10)]
|
|
|
|
result = [
|
|
(path="/moo/foo/baz", weight=10),
|
|
(path="/foo/baz", weight=10)]
|
|
"""
|
|
regex_needle = '.*' + '.*'.join(needles).replace('\\', '\\\\') + '.*'
|
|
regex_flags = re.IGNORECASE | re.UNICODE if ignore_case else re.UNICODE
|
|
found = lambda haystack: re.search(
|
|
regex_needle,
|
|
haystack.path,
|
|
flags=regex_flags)
|
|
return ifilter(found, haystack)
|
|
|
|
|
|
def match_consecutive(needles, haystack, ignore_case=False):
|
|
"""
|
|
Matches consecutive needles at the end of a path.
|
|
|
|
For example:
|
|
needles = ['foo', 'baz']
|
|
haystack = [
|
|
(path="/foo/bar/baz", weight=10),
|
|
(path="/foo/baz/moo", weight=10),
|
|
(path="/moo/foo/baz", weight=10),
|
|
(path="/foo/baz", weight=10)]
|
|
|
|
regex_needle = re.compile(r'''
|
|
foo # needle #1
|
|
[^/]* # all characters except os.sep zero or more times
|
|
/ # os.sep
|
|
[^/]* # all characters except os.sep zero or more times
|
|
baz # needle #2
|
|
[^/]* # all characters except os.sep zero or more times
|
|
$ # end of string
|
|
''')
|
|
|
|
result = [
|
|
(path="/moo/foo/baz", weight=10),
|
|
(path="/foo/baz", weight=10)]
|
|
"""
|
|
# The normal \\ separator needs to be escaped again for use in regex.
|
|
sep = '\\\\' if is_windows() else os.sep
|
|
regex_no_sep = '[^' + sep + ']*'
|
|
regex_no_sep_end = regex_no_sep + '$'
|
|
regex_one_sep = regex_no_sep + sep + regex_no_sep
|
|
# can't use compiled regex because of flags
|
|
regex_needle = regex_one_sep.join(map(re.escape, needles)).replace('\\', '\\\\') + regex_no_sep_end # noqa
|
|
regex_flags = re.IGNORECASE | re.UNICODE if ignore_case else re.UNICODE
|
|
found = lambda entry: re.search(
|
|
regex_needle,
|
|
entry.path,
|
|
flags=regex_flags)
|
|
return ifilter(found, haystack)
|
|
|
|
|
|
def match_fuzzy(needles, haystack, ignore_case=False):
|
|
"""
|
|
Performs an approximate match with the last needle against the end of
|
|
every path past an acceptable threshold (FUZZY_MATCH_THRESHOLD).
|
|
|
|
For example:
|
|
needles = ['foo', 'bar']
|
|
haystack = [
|
|
(path="/foo/bar/baz", weight=11),
|
|
(path="/foo/baz/moo", weight=10),
|
|
(path="/moo/foo/baz", weight=10),
|
|
(path="/foo/baz", weight=10),
|
|
(path="/foo/bar", weight=10)]
|
|
|
|
result = [
|
|
(path="/foo/bar/baz", weight=11),
|
|
(path="/moo/foo/baz", weight=10),
|
|
(path="/foo/baz", weight=10),
|
|
(path="/foo/bar", weight=10)]
|
|
|
|
This is a weak heuristic and used as a last resort to find matches.
|
|
"""
|
|
end_dir = lambda path: last(os.path.split(path))
|
|
if ignore_case:
|
|
needle = last(needles).lower()
|
|
match_percent = lambda entry: SequenceMatcher(
|
|
a=needle,
|
|
b=end_dir(entry.path.lower())).ratio()
|
|
else:
|
|
needle = last(needles)
|
|
match_percent = lambda entry: SequenceMatcher(
|
|
a=needle,
|
|
b=end_dir(entry.path)).ratio()
|
|
meets_threshold = lambda entry: match_percent(entry) >= \
|
|
FUZZY_MATCH_THRESHOLD
|
|
return ifilter(meets_threshold, haystack)
|