mirror of
https://github.com/anasty17/mirror-leech-telegram-bot.git
synced 2025-01-09 04:47:34 +08:00
120 lines
4.4 KiB
Python
120 lines
4.4 KiB
Python
# -*- coding: utf-8 -*-
|
|
# (c) YashDK [yash-dk@github]
|
|
|
|
from anytree import NodeMixin, RenderTree
|
|
|
|
SIZE_UNITS = ['B', 'KB', 'MB', 'GB', 'TB', 'PB']
|
|
|
|
class TorNode(NodeMixin):
|
|
def __init__(self, name, is_folder=False, is_file=False, parent=None, progress=None, size=None, priority=None, file_id=None):
|
|
super().__init__()
|
|
self.name = name
|
|
self.is_folder = is_folder
|
|
self.is_file = is_file
|
|
|
|
if parent is not None:
|
|
self.parent = parent
|
|
if progress is not None:
|
|
self.progress = progress
|
|
if size is not None:
|
|
self.size = size
|
|
if priority is not None:
|
|
self.priority = priority
|
|
if file_id is not None:
|
|
self.file_id = file_id
|
|
|
|
|
|
def get_folders(path):
|
|
path_seperator = "/"
|
|
return path.split(path_seperator)
|
|
|
|
|
|
def make_tree(res):
|
|
"""This function takes the list of all the torrent files. The files are name hierarchically.
|
|
Felt a need to document to save time.
|
|
|
|
Args:
|
|
res (list): Torrent files list.
|
|
|
|
Returns:
|
|
TorNode: Parent node of the tree constructed and can be used further.
|
|
"""
|
|
parent = TorNode("Torrent")
|
|
for l, i in enumerate(res):
|
|
# Get the hierarchy of the folders by splitting based on '/'
|
|
folders = get_folders(i.name)
|
|
# Check if the file is alone for if its in folder
|
|
if len(folders) > 1:
|
|
# Enter here if in folder
|
|
|
|
# Set the parent
|
|
previous_node = parent
|
|
|
|
# Traverse till second last assuming the last is a file.
|
|
for j in range(len(folders)-1):
|
|
current_node = None
|
|
|
|
# As we are traversing the folder from top to bottom we are searching
|
|
# the first folder (folders list) under the parent node in first iteration.
|
|
# If the node is found then it becomes the current node else the current node
|
|
# is left None.
|
|
for k in previous_node.children:
|
|
if k.name == folders[j]:
|
|
current_node = k
|
|
break
|
|
# if the node is not found then create the folder node
|
|
# if the node is found then use it as base for the next
|
|
if current_node is None:
|
|
previous_node = TorNode(folders[j],parent=previous_node,is_folder=True)
|
|
else:
|
|
previous_node = current_node
|
|
# at this point the previous_node will contain the deepest folder in it so add the file to it
|
|
TorNode(folders[-1],is_file=True,parent=previous_node,progress=i.progress,size=i.size,priority=i.priority,file_id=l)
|
|
else:
|
|
# at the file to the parent if no folders are there
|
|
TorNode(folders[-1],is_file=True,parent=parent,progress=i.progress,size=i.size,priority=i.priority,file_id=l)
|
|
return parent
|
|
|
|
|
|
def print_tree(parent):
|
|
for pre, _, node in RenderTree(parent):
|
|
treestr = u"%s%s" % (pre, node.name)
|
|
print(treestr.ljust(8), node.is_folder, node.is_file)
|
|
|
|
|
|
def create_list(par, msg):
|
|
if par.name != ".unwanted":
|
|
msg[0] += "<ul>"
|
|
for i in par.children:
|
|
if i.is_folder:
|
|
msg[0] += "<li>"
|
|
if i.name != ".unwanted":
|
|
msg[0] += f"<input type=\"checkbox\" name=\"foldernode_{msg[1]}\"> <label for=\"{i.name}\">{i.name}</label>"
|
|
create_list(i,msg)
|
|
msg[0] += "</li>"
|
|
msg[1] += 1
|
|
else:
|
|
msg[0] += "<li>"
|
|
if i.priority == 0:
|
|
msg[0] += f"<input type=\"checkbox\" name=\"filenode_{i.file_id}\"> <label for=\"filenode_{i.file_id}\">{i.name} - {get_readable_file_size(i.size)}</label>"
|
|
else:
|
|
msg[0] += f"<input type=\"checkbox\" checked name=\"filenode_{i.file_id}\"> <label for=\"filenode_{i.file_id}\">{i.name} - {get_readable_file_size(i.size)}</label>"
|
|
msg[0] += f"<input type=\"hidden\" value=\"off\" name=\"filenode_{i.file_id}\">"
|
|
|
|
msg[0] += "</li>"
|
|
|
|
if par.name != ".unwanted":
|
|
msg[0] += "</ul>"
|
|
|
|
def get_readable_file_size(size_in_bytes) -> str:
|
|
if size_in_bytes is None:
|
|
return '0B'
|
|
index = 0
|
|
while size_in_bytes >= 1024:
|
|
size_in_bytes /= 1024
|
|
index += 1
|
|
try:
|
|
return f'{round(size_in_bytes, 2)}{SIZE_UNITS[index]}'
|
|
except IndexError:
|
|
return 'File too large'
|