mirror of https://github.com/wting/autojump
William Ting
8 years ago
commit
b9e70a0eea
@ -0,0 +1,127 @@
|
|||||||
|
#!/usr/bin/env python
|
||||||
|
# -*- coding: utf-8 -*-
|
||||||
|
import os
|
||||||
|
import re
|
||||||
|
from difflib import SequenceMatcher
|
||||||
|
|
||||||
|
from autojump_utils import is_python3
|
||||||
|
from autojump_utils import last
|
||||||
|
|
||||||
|
|
||||||
|
if is_python3(): # pragma: no cover
|
||||||
|
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(imap(re.escape, needles)) + '.*'
|
||||||
|
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),
|
||||||
|
]
|
||||||
|
|
||||||
|
# We can't actually use re.compile because of re.UNICODE
|
||||||
|
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),
|
||||||
|
]
|
||||||
|
"""
|
||||||
|
regex_no_sep = '[^' + os.sep + ']*'
|
||||||
|
regex_no_sep_end = regex_no_sep + '$'
|
||||||
|
regex_one_sep = regex_no_sep + os.sep + regex_no_sep
|
||||||
|
regex_needle = regex_one_sep.join(imap(re.escape, needles)) + regex_no_sep_end
|
||||||
|
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, threshold=0.6):
|
||||||
|
"""
|
||||||
|
Performs an approximate match with the last needle against the end of
|
||||||
|
every path past an acceptable 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) >= threshold
|
||||||
|
return ifilter(meets_threshold, haystack)
|
||||||
@ -1 +0,0 @@
|
|||||||
tox
|
|
||||||
@ -0,0 +1,131 @@
|
|||||||
|
#!/usr/bin/env python
|
||||||
|
# -*- coding: utf-8 -*-
|
||||||
|
import os
|
||||||
|
import sys
|
||||||
|
|
||||||
|
import pytest
|
||||||
|
|
||||||
|
sys.path.append(os.path.join(os.getcwd(), 'bin')) # noqa
|
||||||
|
from autojump_data import Entry
|
||||||
|
from autojump_match import match_anywhere
|
||||||
|
from autojump_match import match_consecutive
|
||||||
|
|
||||||
|
|
||||||
|
class TestMatchAnywhere(object):
|
||||||
|
|
||||||
|
entry1 = Entry('/foo/bar/baz', 10)
|
||||||
|
entry2 = Entry('/baz/foo/bar', 10)
|
||||||
|
entry3 = Entry('/foo/baz', 10)
|
||||||
|
entry4 = Entry('/中/zhong/国/guo', 10)
|
||||||
|
entry5 = Entry('/is\'t/this/a/b*tchin/edge/case?', 10)
|
||||||
|
win_entry1 = Entry('C:\\foo\\bar\\baz', 10)
|
||||||
|
win_entry2 = Entry('D:\Program Files (x86)\GIMP', 10)
|
||||||
|
win_entry3 = Entry('C:\Windows\System32', 10)
|
||||||
|
|
||||||
|
@pytest.fixture
|
||||||
|
def haystack(self):
|
||||||
|
return [
|
||||||
|
self.entry1,
|
||||||
|
self.entry2,
|
||||||
|
self.entry3,
|
||||||
|
self.entry4,
|
||||||
|
self.entry5,
|
||||||
|
]
|
||||||
|
|
||||||
|
@pytest.fixture
|
||||||
|
def windows_haystack(self):
|
||||||
|
return [self.win_entry1, self.win_entry2, self.win_entry3]
|
||||||
|
|
||||||
|
def test_single_needle(self, haystack):
|
||||||
|
assert list(match_anywhere(['bar'], haystack)) == [self.entry1, self.entry2]
|
||||||
|
|
||||||
|
def test_consecutive(self, haystack):
|
||||||
|
assert list(match_anywhere(['foo', 'bar'], haystack)) \
|
||||||
|
== [self.entry1, self.entry2]
|
||||||
|
assert list(match_anywhere(['bar', 'foo'], haystack)) == []
|
||||||
|
|
||||||
|
def test_skip(self, haystack):
|
||||||
|
assert list(match_anywhere(['baz', 'bar'], haystack)) == [self.entry2]
|
||||||
|
assert list(match_anywhere(['中', '国'], haystack)) == [self.entry4]
|
||||||
|
|
||||||
|
def test_ignore_case(self, haystack):
|
||||||
|
assert list(match_anywhere(['bAz', 'bAR'], haystack, ignore_case=True)) \
|
||||||
|
== [self.entry2]
|
||||||
|
|
||||||
|
def test_backslashes_for_windows_paths(self, windows_haystack):
|
||||||
|
# https://github.com/wting/autojump/issues/281
|
||||||
|
assert list(match_anywhere(['foo', 'baz'], windows_haystack)) \
|
||||||
|
== [self.win_entry1]
|
||||||
|
assert list(match_anywhere(['program', 'gimp'], windows_haystack, True)) \
|
||||||
|
== [self.win_entry2]
|
||||||
|
assert list(match_anywhere(['win', '32'], windows_haystack, True)) \
|
||||||
|
== [self.win_entry3]
|
||||||
|
|
||||||
|
def test_wildcard_in_needle(self, haystack):
|
||||||
|
# https://github.com/wting/autojump/issues/402
|
||||||
|
assert list(match_anywhere(['*', 'this'], haystack)) == []
|
||||||
|
assert list(match_anywhere(['this', '*'], haystack)) == [self.entry5]
|
||||||
|
|
||||||
|
|
||||||
|
class TestMatchConsecutive(object):
|
||||||
|
|
||||||
|
entry1 = Entry('/foo/bar/baz', 10)
|
||||||
|
entry2 = Entry('/baz/foo/bar', 10)
|
||||||
|
entry3 = Entry('/foo/baz', 10)
|
||||||
|
entry4 = Entry('/中/zhong/国/guo', 10)
|
||||||
|
entry5 = Entry('/日/本', 10)
|
||||||
|
entry6 = Entry('/is\'t/this/a/b*tchin/edge/case?', 10)
|
||||||
|
win_entry1 = Entry('C:\Foo\Bar\Baz', 10)
|
||||||
|
win_entry2 = Entry('D:\Program Files (x86)\GIMP', 10)
|
||||||
|
win_entry3 = Entry('C:\Windows\System32', 10)
|
||||||
|
|
||||||
|
@pytest.fixture
|
||||||
|
def haystack(self):
|
||||||
|
return [
|
||||||
|
self.entry1,
|
||||||
|
self.entry2,
|
||||||
|
self.entry3,
|
||||||
|
self.entry4,
|
||||||
|
self.entry5,
|
||||||
|
]
|
||||||
|
|
||||||
|
@pytest.fixture
|
||||||
|
def windows_haystack(self):
|
||||||
|
return [self.win_entry1, self.win_entry2, self.win_entry3]
|
||||||
|
|
||||||
|
def test_single_needle(self, haystack):
|
||||||
|
assert list(match_consecutive(['baz'], haystack)) == [self.entry1, self.entry3]
|
||||||
|
assert list(match_consecutive(['本'], haystack)) == [self.entry5]
|
||||||
|
|
||||||
|
def test_consecutive(self, haystack):
|
||||||
|
assert list(match_consecutive(['bar', 'baz'], haystack)) == [self.entry1]
|
||||||
|
assert list(match_consecutive(['foo', 'bar'], haystack)) == [self.entry2]
|
||||||
|
assert list(match_consecutive(['国', 'guo'], haystack)) == [self.entry4]
|
||||||
|
assert list(match_consecutive(['bar', 'foo'], haystack)) == []
|
||||||
|
|
||||||
|
def test_ignore_case(self, haystack):
|
||||||
|
assert list(match_consecutive(['FoO', 'bAR'], haystack, ignore_case=True)) \
|
||||||
|
== [self.entry2]
|
||||||
|
|
||||||
|
def test_windows_ignore_case(self, windows_haystack):
|
||||||
|
assert list(match_consecutive(['gimp'], windows_haystack, True)) == [self.win_entry2]
|
||||||
|
|
||||||
|
@pytest.mark.xfail(reason='https://github.com/wting/autojump/issues/418')
|
||||||
|
def test_backslashes_for_windows_paths(self, windows_haystack):
|
||||||
|
assert list(match_consecutive(['program', 'gimp'], windows_haystack, True)) \
|
||||||
|
== [self.win_entry2]
|
||||||
|
|
||||||
|
@pytest.mark.xfail(reason='https://github.com/wting/autojump/issues/418')
|
||||||
|
def test_foo_bar_baz(self, windows_haystack):
|
||||||
|
assert list(match_consecutive(['bar', 'baz'], windows_haystack, ignore_case=True)) \
|
||||||
|
== [self.win_entry1]
|
||||||
|
|
||||||
|
@pytest.mark.xfail(reason='https://github.com/wting/autojump/issues/402')
|
||||||
|
def test_thing(self, windows_haystack):
|
||||||
|
assert list(match_consecutive(['win', '32'], windows_haystack, True)) \
|
||||||
|
== [self.win_entry3]
|
||||||
|
|
||||||
|
@pytest.mark.xfail(reason='https://github.com/wting/autojump/issues/402')
|
||||||
|
def test_wildcard_in_needle(self, haystack):
|
||||||
|
assert list(match_consecutive(['*', 'this'], haystack)) == []
|
||||||
|
assert list(match_consecutive(['*', 'edge', 'case'], haystack)) == [self.entry6]
|
||||||
Loading…
Reference in new issue