mirror of
https://github.com/krateng/maloja.git
synced 2023-08-10 21:12:55 +03:00
Removed issues functionality for now
This commit is contained in:
parent
037f195803
commit
4e33f808e4
@ -339,109 +339,6 @@ def track_info(dbconn=None,**keys):
|
|||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
def issues(dbconn=None):
|
|
||||||
return ISSUES
|
|
||||||
|
|
||||||
def check_issues():
|
|
||||||
combined = []
|
|
||||||
duplicates = []
|
|
||||||
newartists = []
|
|
||||||
|
|
||||||
import itertools
|
|
||||||
import difflib
|
|
||||||
|
|
||||||
sortedartists = ARTISTS.copy()
|
|
||||||
sortedartists.sort(key=len,reverse=True)
|
|
||||||
reversesortedartists = sortedartists.copy()
|
|
||||||
reversesortedartists.reverse()
|
|
||||||
for a in reversesortedartists:
|
|
||||||
|
|
||||||
nochange = cla.confirmedReal(a)
|
|
||||||
|
|
||||||
st = a
|
|
||||||
lis = []
|
|
||||||
reachedmyself = False
|
|
||||||
for ar in sortedartists:
|
|
||||||
if (ar != a) and not reachedmyself:
|
|
||||||
continue
|
|
||||||
elif not reachedmyself:
|
|
||||||
reachedmyself = True
|
|
||||||
continue
|
|
||||||
|
|
||||||
if (ar.lower() == a.lower()) or ("the " + ar.lower() == a.lower()) or ("a " + ar.lower() == a.lower()):
|
|
||||||
duplicates.append((ar,a))
|
|
||||||
break
|
|
||||||
|
|
||||||
if (ar + " " in st) or (" " + ar in st):
|
|
||||||
lis.append(ar)
|
|
||||||
st = st.replace(ar,"").strip()
|
|
||||||
elif (ar == st):
|
|
||||||
lis.append(ar)
|
|
||||||
st = ""
|
|
||||||
if not nochange:
|
|
||||||
combined.append((a,lis))
|
|
||||||
break
|
|
||||||
|
|
||||||
elif (ar in st) and len(ar)*2 > len(st):
|
|
||||||
duplicates.append((a,ar))
|
|
||||||
|
|
||||||
st = st.replace("&","").replace("and","").replace("with","").strip()
|
|
||||||
if st not in ["", a]:
|
|
||||||
if len(st) < 5 and len(lis) == 1:
|
|
||||||
#check if we havent just randomly found the string in another word
|
|
||||||
#if (" " + st + " ") in lis[0] or (lis[0].endswith(" " + st)) or (lis[0].startswith(st + " ")):
|
|
||||||
duplicates.append((a,lis[0]))
|
|
||||||
elif len(st) < 5 and len(lis) > 1 and not nochange:
|
|
||||||
combined.append((a,lis))
|
|
||||||
elif len(st) >= 5 and not nochange:
|
|
||||||
#check if we havent just randomly found the string in another word
|
|
||||||
if (" " + st + " ") in a or (a.endswith(" " + st)) or (a.startswith(st + " ")):
|
|
||||||
newartists.append((st,a,lis))
|
|
||||||
|
|
||||||
#for c in itertools.combinations(ARTISTS,3):
|
|
||||||
# l = list(c)
|
|
||||||
# print(l)
|
|
||||||
# l.sort(key=len,reverse=True)
|
|
||||||
# [full,a1,a2] = l
|
|
||||||
# if (a1 + " " + a2 in full) or (a2 + " " + a1 in full):
|
|
||||||
# combined.append((full,a1,a2))
|
|
||||||
|
|
||||||
|
|
||||||
#for c in itertools.combinations(ARTISTS,2):
|
|
||||||
# if
|
|
||||||
#
|
|
||||||
# if (c[0].lower == c[1].lower):
|
|
||||||
# duplicates.append((c[0],c[1]))
|
|
||||||
|
|
||||||
|
|
||||||
# elif (c[0] + " " in c[1]) or (" " + c[0] in c[1]) or (c[1] + " " in c[0]) or (" " + c[1] in c[0]):
|
|
||||||
# if (c[0] in c[1]):
|
|
||||||
# full, part = c[1],c[0]
|
|
||||||
# rest = c[1].replace(c[0],"").strip()
|
|
||||||
# else:
|
|
||||||
# full, part = c[0],c[1]
|
|
||||||
# rest = c[0].replace(c[1],"").strip()
|
|
||||||
# if rest in ARTISTS and full not in [c[0] for c in combined]:
|
|
||||||
# combined.append((full,part,rest))
|
|
||||||
|
|
||||||
# elif (c[0] in c[1]) or (c[1] in c[0]):
|
|
||||||
# duplicates.append((c[0],c[1]))
|
|
||||||
|
|
||||||
|
|
||||||
return {"duplicates":duplicates,"combined":combined,"newartists":newartists}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
def get_predefined_rulesets(dbconn=None):
|
def get_predefined_rulesets(dbconn=None):
|
||||||
validchars = "-_abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
|
validchars = "-_abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user