[FL-2150] Dolphin animation refactoring (#938)
* Dolphin Animation Refactoring, part 1 * Remove animations from desktop * Remove excess, first start * Split animation_manager with callbacks * allocate view inside animation_view * Work on ViewComposed * Draw white rectangles under bubble corners * Fix bubbles sequence * RPC: remove obsolete include "status.pb.h" * Add animations manifest decoding * Flipper file: add strict mode * FFF: Animation structures parsing * Assembling structure of animation * Lot of view fixes: Add multi-line bubbles Add support for passive bubbles (frame_order values starts from passive now) Add hard-coded delay (active_shift) for active state enabling Fix active state handling Fix leaks Fix parsing uncorrect bubble_animation meta file Fix bubble rules of showing * Animation load/unload & view freeze/unfreeze * Blocking & system animations, fixes: View correct activation Refactoring + blocking animation Freeze first passive/active frames Many insert/eject SD tests fixes Add system animations Add Loader events app started/finished Add system no_sd animation * Assets: dolphin packer. Scripts: minor refactoring. * Desktop: update logging tags. Scripts: add metadata to dolphin bundling process, extra sorting for fs traversing. Make: phony assets rules. * Github: rebuild assets on build * Docker: add missing dependencies for assets compilation * Docker: fix run command syntax * ReadMe: update naming rules with link to source * Assets: recompile icons * Loader: add loader event * Desktop, Gui, Furi Core: const shenanigans macros Co-authored-by: Aleksandr Kutuzov <alleteam@gmail.com>
This commit is contained in:
27
scripts/flipper/utils/__init__.py
Normal file
27
scripts/flipper/utils/__init__.py
Normal file
@@ -0,0 +1,27 @@
|
||||
import datetime
|
||||
import hashlib
|
||||
import os
|
||||
|
||||
|
||||
def timestamp():
|
||||
return int(datetime.datetime.now().timestamp())
|
||||
|
||||
|
||||
def file_hash(path: str, algo: str, block_size: int = 4096):
|
||||
fd = open(path, "rb")
|
||||
h = hashlib.new(algo)
|
||||
while True:
|
||||
data = fd.read(block_size)
|
||||
if len(data) > 0:
|
||||
h.update(data)
|
||||
else:
|
||||
break
|
||||
return h.hexdigest()
|
||||
|
||||
|
||||
def file_md5(path, block_size=4096):
|
||||
return file_hash(path, "md5", block_size)
|
||||
|
||||
|
||||
def file_sha256(path, block_size=4096):
|
||||
return file_hash(path, "sha256", block_size)
|
76
scripts/flipper/utils/fstree.py
Normal file
76
scripts/flipper/utils/fstree.py
Normal file
@@ -0,0 +1,76 @@
|
||||
from enum import Enum
|
||||
from collections import OrderedDict
|
||||
|
||||
|
||||
class FsNode:
|
||||
class Type(Enum):
|
||||
File = 0
|
||||
Directory = 1
|
||||
|
||||
def __init__(self, name: str, type: "FsNode.Type", **kwargs):
|
||||
self.name = name
|
||||
self.type = type
|
||||
self.data = kwargs
|
||||
self.parent = None
|
||||
self.children = OrderedDict()
|
||||
|
||||
def addChild(self, node: "FsNode"):
|
||||
self.children[node.name] = node
|
||||
node.parent = self
|
||||
|
||||
def addDirectory(self, path):
|
||||
fragments = path.split("/")
|
||||
name = fragments[-1]
|
||||
fragments = fragments[:-1]
|
||||
parent_node = self.traverse(fragments)
|
||||
if not parent_node:
|
||||
raise Exception(f"No parent node found for: {path}")
|
||||
parent_node.addChild(FsNode(name, FsNode.Type.Directory))
|
||||
|
||||
def addFile(self, path, md5, size):
|
||||
fragments = path.split("/")
|
||||
name = fragments[-1]
|
||||
fragments = fragments[:-1]
|
||||
parent_node = self.traverse(fragments)
|
||||
if not parent_node:
|
||||
raise Exception(f"No parent node found for: {path}")
|
||||
parent_node.addChild(FsNode(name, FsNode.Type.File, md5=md5, size=size))
|
||||
|
||||
def getChild(self, name):
|
||||
return self.children[name]
|
||||
|
||||
def traverse(self, fragments):
|
||||
current = self
|
||||
for fragment in fragments:
|
||||
current = current.getChild(fragment)
|
||||
if not current:
|
||||
break
|
||||
return current
|
||||
|
||||
def getPath(self):
|
||||
fragments = []
|
||||
current = self
|
||||
while current.parent:
|
||||
fragments.append(current.name)
|
||||
current = current.parent
|
||||
return "/".join(reversed(fragments))
|
||||
|
||||
def dump(self):
|
||||
ret = {}
|
||||
ret["name"] = (self.name,)
|
||||
ret["type"] = (self.type,)
|
||||
ret["path"] = (self.getPath(),)
|
||||
if len(self.children):
|
||||
ret["children"] = [node.dump() for node in self.children.values()]
|
||||
return ret
|
||||
|
||||
|
||||
def compare_fs_trees(left: FsNode, right: FsNode):
|
||||
# import pprint
|
||||
# pprint.pprint(left.dump())
|
||||
# pprint.pprint(right.dump())
|
||||
|
||||
only_in_left = []
|
||||
changed = []
|
||||
only_in_right = []
|
||||
return [], [], []
|
Reference in New Issue
Block a user