1c548daaf4
In Bitwarden, one could make it so their account only has a certain set of folders, like so: - testfolder/a - testfolder/a/b/c - testfolder/a/b/c/d The resulting hierarchy would look like this: testfolder/a `- b/c `- d As shown above, Bitwarden allows one to name a folder something like "foo/bar" even if a folder "foo" doesn't exist. Bitwarden handles this by just putting this folder in the root with the name as-is. In addition, as shown with "testfolder/a/b/c", a folder name may not necessarily be just anything that comes after the last `/` delimiter. Instead, it's dependent on which ever existing folder happens to match the most of the folder's name's prefix. As such, the following references were used to replicate this behavior in bitwarden-to-keepass:ecdd08624f/common/src/services/folder.service.ts (L108)ecdd08624f/common/src/misc/serviceUtils.ts (L7)
59 lines
1.9 KiB
Python
59 lines
1.9 KiB
Python
import collections
|
|
from typing import Callable, Deque, List, Optional
|
|
|
|
from pykeepass.group import Group as KPGroup
|
|
|
|
class Folder:
|
|
id: Optional[str]
|
|
name: Optional[str]
|
|
children: List['Folder']
|
|
parent: Optional['Folder']
|
|
keepass_group: Optional[KPGroup]
|
|
|
|
def __init__(self, id: Optional[str]):
|
|
self.id = id
|
|
self.name = None
|
|
self.children = []
|
|
self.parent = None
|
|
self.keepass_group = None
|
|
|
|
def add_child(self, child: 'Folder'):
|
|
self.children.append(child)
|
|
child.parent = self
|
|
|
|
# logic was lifted directly from https://github.com/bitwarden/jslib/blob/ecdd08624f61ccff8128b7cb3241f39e664e1c7f/common/src/misc/serviceUtils.ts#L7
|
|
def nested_traverse_insert(root: Folder, name_parts: List[str], new_folder: Folder, delimiter: str) -> None:
|
|
if len(name_parts) == 0:
|
|
return
|
|
|
|
end: bool = len(name_parts) == 1
|
|
part_name: str = name_parts[0]
|
|
|
|
for child in root.children:
|
|
if child.name != part_name:
|
|
continue
|
|
|
|
if end and child.id != new_folder.id:
|
|
# Another node with the same name.
|
|
new_folder.name = part_name
|
|
root.add_child(new_folder)
|
|
return
|
|
nested_traverse_insert(child, name_parts[1:], new_folder, delimiter)
|
|
return
|
|
|
|
if end:
|
|
new_folder.name = part_name
|
|
root.add_child(new_folder)
|
|
return
|
|
new_part_name: str = part_name + delimiter + name_parts[1]
|
|
new_name_parts: List[str] = [new_part_name]
|
|
new_name_parts.extend(name_parts[2:])
|
|
nested_traverse_insert(root, new_name_parts, new_folder, delimiter)
|
|
|
|
def bfs_traverse_execute(root: Folder, callback: Callable[[Folder], None]) -> None:
|
|
queue: Deque[Folder] = collections.deque()
|
|
queue.extend(root.children)
|
|
while queue:
|
|
child: Folder = queue.popleft()
|
|
queue.extend(child.children)
|
|
callback(child) |