xenofem/dlibrary
1
0
Fork 0
Code Issues 3 Pull requests Packages Projects Releases Wiki Activity

apply unicode normalization while finding prefix orderings, because the world is bad

Browse source
This commit is contained in:
xenofem 2024-02-16 16:08:56 -05:00
parent 34c0435d05
commit 25f44473c4
1 changed files with 20 additions and 13 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

33
dlibrary/dlibrary.py
View file

@ -11,6 +11,7 @@ import readline
import shutil
import sqlite3
import textwrap
import unicodedata
from urllib.parse import urlparse
import zipfile
@ -222,6 +223,12 @@ def link_pdf(src, dest, start_index):
return pdf.page_count
def nfc(s):
return unicodedata.normalize('NFC', s)
def nname(entry):
return nfc(entry.name)
def complete_prefix_number_ordering(entries):
if len(entries) == 1:
return entries
@ -230,7 +237,7 @@ def complete_prefix_number_ordering(entries):
for entry in entries:
version_code = 0
for (i, version) in enumerate(ALT_VERSIONS):
if version in entry.name:
if version in nname(entry):
version_code |= (1 << i)
entries_by_version.setdefault(version_code, []).append(entry)
@ -279,23 +286,23 @@ def complete_prefix_number_ordering(entries):
return result
def unique_hierarchical_prefix_numbering(entries, start_point=0):
if len(entries) == 1 and not NUMBER_REGEX.search(entries[0].name):
if len(entries) == 1 and not NUMBER_REGEX.search(nname(entries[0])):
return {None: entries}
longest_entry = max(entries, key=lambda e: len(e.name))
matches = reversed(list(NUMBER_REGEX.finditer(longest_entry.name)))
longest_entry = max(entries, key=lambda e: len(nname(e)))
matches = reversed(list(NUMBER_REGEX.finditer(nname(longest_entry))))
for m in matches:
pos = m.start()
if pos < start_point:
return None
prefix = longest_entry.name[:pos]
if all(e.name.startswith(prefix) or prefix.startswith(e.stem) for e in entries):
prefix = nname(longest_entry)[:pos]
if all(nname(e).startswith(prefix) or prefix.startswith(nfc(e.stem)) for e in entries):
numbering = {}
for e in entries:
if pos >= len(e.stem):
if pos >= len(nfc(e.stem)):
i = 0
else:
n = NUMBER_REGEX.match(e.name[pos:])
n = NUMBER_REGEX.match(nname(e)[pos:])
if n is None:
return None
i = int(n.group())
@ -305,8 +312,8 @@ def unique_hierarchical_prefix_numbering(entries, start_point=0):
for idx in indices:
if len(numbering[idx]) > 1:
ents_idx = numbering.pop(idx)
longest = max(ents_idx, key=lambda e: len(e.name))
next_layer_start = pos + NUMBER_REGEX.match(longest.name[pos:]).end()
longest = max(ents_idx, key=lambda e: len(nname(e)))
next_layer_start = pos + NUMBER_REGEX.match(nname(longest)[pos:]).end()
sub_numbering = unique_hierarchical_prefix_numbering(ents_idx, start_point=next_layer_start) or alphabetic_numbering(ents_idx, next_layer_start)
if not sub_numbering:
return None
@ -421,9 +428,9 @@ def try_collate_split_regex(srcs, dest, start_index, exclude, earlier=None, late
middle_srcs = []
late_srcs = []
for src in srcs:
if earlier and earlier.search(src.name):
if earlier and earlier.search(nname(src)):
early_srcs.append(src)
elif later and later.search(src.name):
elif later and later.search(nname(src)):
late_srcs.append(src)
else:
middle_srcs.append(src)
@ -548,7 +555,7 @@ def collate_from_paths(srcs, dest, start_index, exclude):
return 0
if len(srcs) == 2 and all(src.is_dir() for src in srcs):
hi_res_dirs = [src for src in srcs if HI_RES_REGEX.search(src.name)]
hi_res_dirs = [src for src in srcs if HI_RES_REGEX.search(nname(src))]
if len(hi_res_dirs) == 1:
hi_res_dir = hi_res_dirs[0]
lo_res_dir = next(src for src in srcs if src != hi_res_dir)