mirror of
https://github.com/wting/autojump
synced 2024-10-27 20:34:07 +00:00
Simplify flake8 noqa.
This commit is contained in:
parent
7922a9013d
commit
218d779b4d
110
bin/autojump
110
bin/autojump
@ -20,13 +20,11 @@
|
|||||||
"""
|
"""
|
||||||
from __future__ import print_function
|
from __future__ import print_function
|
||||||
|
|
||||||
from difflib import SequenceMatcher
|
|
||||||
from itertools import chain
|
from itertools import chain
|
||||||
from math import sqrt
|
from math import sqrt
|
||||||
from operator import attrgetter
|
from operator import attrgetter
|
||||||
from operator import itemgetter
|
from operator import itemgetter
|
||||||
import os
|
import os
|
||||||
import re
|
|
||||||
import sys
|
import sys
|
||||||
|
|
||||||
if sys.version_info[0] == 3:
|
if sys.version_info[0] == 3:
|
||||||
@ -49,6 +47,9 @@ from autojump_data import entriefy
|
|||||||
from autojump_data import Entry
|
from autojump_data import Entry
|
||||||
from autojump_data import load
|
from autojump_data import load
|
||||||
from autojump_data import save
|
from autojump_data import save
|
||||||
|
from autojump_match import match_anywhere
|
||||||
|
from autojump_match import match_consecutive
|
||||||
|
from autojump_match import match_fuzzy
|
||||||
from autojump_utils import first
|
from autojump_utils import first
|
||||||
from autojump_utils import get_pwd
|
from autojump_utils import get_pwd
|
||||||
from autojump_utils import get_tab_entry_info
|
from autojump_utils import get_tab_entry_info
|
||||||
@ -225,111 +226,6 @@ def handle_tab_completion(needle, entries):
|
|||||||
TAB_SEPARATOR)
|
TAB_SEPARATOR)
|
||||||
|
|
||||||
|
|
||||||
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)
|
|
||||||
|
|
||||||
|
|
||||||
def purge_missing_paths(entries):
|
def purge_missing_paths(entries):
|
||||||
"""Remove non-existent paths from a list of entries."""
|
"""Remove non-existent paths from a list of entries."""
|
||||||
exists = lambda entry: os.path.exists(entry.path)
|
exists = lambda entry: os.path.exists(entry.path)
|
||||||
|
120
bin/autojump_match.py
Normal file
120
bin/autojump_match.py
Normal file
@ -0,0 +1,120 @@
|
|||||||
|
#!/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)
|
@ -6,20 +6,20 @@ import sys
|
|||||||
import mock
|
import mock
|
||||||
import pytest
|
import pytest
|
||||||
|
|
||||||
sys.path.append(os.path.join(os.getcwd(), 'bin'))
|
sys.path.append(os.path.join(os.getcwd(), 'bin')) # noqa
|
||||||
import autojump_utils # noqa
|
import autojump_utils
|
||||||
from autojump_utils import encode_local # noqa
|
from autojump_utils import encode_local
|
||||||
from autojump_utils import first # noqa
|
from autojump_utils import first
|
||||||
from autojump_utils import get_tab_entry_info # noqa
|
from autojump_utils import get_tab_entry_info
|
||||||
from autojump_utils import has_uppercase # noqa
|
from autojump_utils import has_uppercase
|
||||||
from autojump_utils import in_bash # noqa
|
from autojump_utils import in_bash
|
||||||
from autojump_utils import is_python3 # noqa
|
from autojump_utils import is_python3
|
||||||
from autojump_utils import last # noqa
|
from autojump_utils import last
|
||||||
from autojump_utils import sanitize # noqa
|
from autojump_utils import sanitize
|
||||||
from autojump_utils import second # noqa
|
from autojump_utils import second
|
||||||
from autojump_utils import surround_quotes # noqa
|
from autojump_utils import surround_quotes
|
||||||
from autojump_utils import take # noqa
|
from autojump_utils import take
|
||||||
from autojump_utils import unico # noqa
|
from autojump_utils import unico
|
||||||
|
|
||||||
|
|
||||||
if is_python3():
|
if is_python3():
|
||||||
|
Loading…
Reference in New Issue
Block a user