mirror of
https://github.com/offa/android-foss.git
synced 2025-11-08 10:25:29 +05:30
Show how to sort
This commit is contained in:
parent
2dccd0ee5f
commit
db4def5f1c
1 changed files with 19 additions and 6 deletions
25
ensure_sorted.py
Normal file → Executable file
25
ensure_sorted.py
Normal file → Executable file
|
|
@ -3,11 +3,11 @@ import re
|
|||
|
||||
class bcolors:
|
||||
HEADER = '\033[95m'
|
||||
OKBLUE = '\033[94m'
|
||||
OKCYAN = '\033[96m'
|
||||
OKGREEN = '\033[92m'
|
||||
WARNING = '\033[93m'
|
||||
FAIL = '\033[91m'
|
||||
BLUE = '\033[94m'
|
||||
CYAN = '\033[96m'
|
||||
GREEN = '\033[92m'
|
||||
YELLOW = '\033[93m'
|
||||
RED = '\033[91m'
|
||||
ENDC = '\033[0m'
|
||||
BOLD = '\033[1m'
|
||||
UNDERLINE = '\033[4m'
|
||||
|
|
@ -30,6 +30,15 @@ class Category:
|
|||
# I know not effiencent
|
||||
return sorted(self.apps) == self.apps
|
||||
|
||||
# Tell exactly where it's unsorted
|
||||
def where_unsorted(self):
|
||||
for i in range(1, len(self.apps)):
|
||||
if self.apps[i] < self.apps[i-1]:
|
||||
return f'App {bcolors.RED}{self.apps[i-1]}{bcolors.ENDC} is not in the correct order'
|
||||
|
||||
def get_sorted_list(self):
|
||||
return sorted(self.apps)
|
||||
|
||||
def __str__(self):
|
||||
return str(self.apps)
|
||||
|
||||
|
|
@ -64,7 +73,11 @@ def main():
|
|||
all_sorted = True
|
||||
for i in categories:
|
||||
if not i.is_sorted():
|
||||
print(f'Category {bcolors.OKBLUE}{i.name}{bcolors.ENDC} is not sorted')
|
||||
print(f'Category {bcolors.BLUE}{i.name}{bcolors.ENDC} is not sorted')
|
||||
print(' ' + i.where_unsorted())
|
||||
print(' Should be sorted as follows:')
|
||||
for j in i.get_sorted_list():
|
||||
print(f' {j}')
|
||||
all_sorted = False
|
||||
|
||||
if not all_sorted:
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue