73 lines
2.2 KiB
Python
73 lines
2.2 KiB
Python
# Copyright (C) 2018 Avatao.com Innovative Learning Kft.
|
|
# All Rights Reserved. See LICENSE file for details.
|
|
|
|
from shlex import split
|
|
from re import search
|
|
|
|
from tfw.decorators.lazy_property import lazy_property
|
|
|
|
|
|
class CommandsEqual:
|
|
def __init__(
|
|
self, command_1, command_2,
|
|
fuzzyness=1, begin_similarly=True,
|
|
include_patterns=None, exclude_patterns=None
|
|
):
|
|
self.command_1 = split(command_1)
|
|
self.command_2 = split(command_2)
|
|
self.fuzzyness = fuzzyness
|
|
self.begin_similarly = begin_similarly
|
|
self.include_patterns = include_patterns
|
|
self.exclude_patterns = exclude_patterns
|
|
|
|
def __bool__(self):
|
|
if self.begin_similarly:
|
|
if not self.beginnings_are_equal:
|
|
return False
|
|
|
|
if self.include_patterns is not None:
|
|
if not self.commands_contain_include_patterns:
|
|
return False
|
|
|
|
if self.exclude_patterns is not None:
|
|
if not self.commands_contain_no_exclude_patterns:
|
|
return False
|
|
|
|
print(self.similarity)
|
|
return self.similarity >= self.fuzzyness
|
|
|
|
@lazy_property
|
|
def beginnings_are_equal(self):
|
|
return self.command_1[0] == self.command_2[0]
|
|
|
|
@lazy_property
|
|
def commands_contain_include_patterns(self):
|
|
return all((
|
|
self.contains_regex_patterns(self.command_1, self.include_patterns),
|
|
self.contains_regex_patterns(self.command_2, self.include_patterns)
|
|
))
|
|
|
|
@lazy_property
|
|
def commands_contain_no_exclude_patterns(self):
|
|
return all((
|
|
not self.contains_regex_patterns(self.command_1, self.exclude_patterns),
|
|
not self.contains_regex_patterns(self.command_2, self.exclude_patterns)
|
|
))
|
|
|
|
@staticmethod
|
|
def contains_regex_patterns(command, regex_parts):
|
|
command = ' '.join(command)
|
|
for pattern in regex_parts:
|
|
if not search(pattern, command):
|
|
return False
|
|
return True
|
|
|
|
@lazy_property
|
|
def similarity(self):
|
|
parts_1 = set(self.command_1)
|
|
parts_2 = set(self.command_2)
|
|
|
|
difference = parts_1 - parts_2
|
|
deviance = len(difference) / len(max(parts_1, parts_2))
|
|
return 1 - deviance
|