-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort.py
More file actions
66 lines (55 loc) · 1.61 KB
/
sort.py
File metadata and controls
66 lines (55 loc) · 1.61 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
import re
UA_ALPHABET = "абвгґдеєжзиіїйклмнопрстуфхцчшщьюя"
UA_INDEX = {ch: i for i, ch in enumerate(UA_ALPHABET)}
RE_FIRST_LETTER = re.compile(r"^\s*([A-Za-zА-Яа-яІіЇїЄєҐґ])")
def is_ukrainian(s: str) -> bool:
m = RE_FIRST_LETTER.match(s)
if not m:
return False
ch = m.group(1)
return bool(re.match(r"[А-Яа-яІіЇїЄєҐґ]", ch))
def is_latin(s: str) -> bool:
m = RE_FIRST_LETTER.match(s)
if not m:
return False
ch = m.group(1)
return bool(re.match(r"[A-Za-z]", ch))
def ua_sort_key(text: str):
t = text.casefold()
t = re.sub(r"[^а-яієїґ\s]", "", t)
t = re.sub(r"\s+", " ", t).strip()
return [UA_INDEX.get(ch, 10_000) for ch in t]
def latin_sort_key(text: str):
t = text.casefold()
t = re.sub(r"\s+", " ", t).strip()
return t
def sort_key(s: str):
if is_ukrainian(s):
return (0, ua_sort_key(s))
elif is_latin(s):
return (1, latin_sort_key(s))
else:
return (2, s.casefold())
if __name__ == "__main__":
words = [
"English",
"інформація",
"android",
"Windows",
"Добрий день",
"матриця",
"актова зала",
"біоресурси",
"єдиний",
"кава",
"Імла",
"їжак",
"Єдність",
"Zoo",
"apple",
]
print("Заданий список:")
print(words)
sorted_words = sorted(words, key=sort_key)
print("\nВідсортований список:")
print(sorted_words)