TF-37 Generate tree with Map

This commit is contained in:
Dat PHAM HOANG
2021-08-31 18:08:58 +07:00
committed by Dat H. Pham
parent 41b4e8296c
commit e63298bc29
6 changed files with 44 additions and 242 deletions
@@ -1,6 +1,5 @@
import 'dart:collection';
import 'package:built_collection/built_collection.dart';
import 'package:jmap_dart_client/jmap/mail/mailbox/mailbox.dart';
import 'package:model/mailbox/presentation_mailbox.dart';
@@ -9,50 +8,24 @@ import 'mailbox_tree.dart';
class TreeBuilder {
Future<MailboxTree> generateMailboxTree(List<PresentationMailbox> mailboxesList) async {
final Map<MailboxId, BuiltList<PresentationMailbox>> mapNotFoundParentMailbox = HashMap();
final Map<MailboxId, MailboxNode> mailboxDictionary = HashMap();
final tree = MailboxTree(MailboxNode.root());
mailboxesList.forEach((mailbox) {
if (mailbox.hasParentId()) {
final parentId = mailbox.parentId!;
final foundParent = tree.findNode(parentId);
if (foundParent != null) {
_addDescendant(tree, mailbox, maybeDescendant: mapNotFoundParentMailbox);
} else {
final siblingTrees = mapNotFoundParentMailbox[mailbox.parentId];
if (siblingTrees != null) {
mapNotFoundParentMailbox.addAll({
parentId: (ListBuilder<PresentationMailbox>(siblingTrees)..add(mailbox)).build()
});
} else {
mapNotFoundParentMailbox.addAll({parentId: (ListBuilder<PresentationMailbox>()..add(mailbox)).build()});
}
}
} else {
_addDescendant(tree, mailbox, maybeDescendant: mapNotFoundParentMailbox);
}
mailboxDictionary[mailbox.id] = MailboxNode(mailbox);
});
mapNotFoundParentMailbox.forEach((_, listMailbox) {
listMailbox.forEach((mailbox) {
_addDescendant(tree, mailbox);
});
mailboxesList.forEach((mailbox) {
final parentId = mailbox.parentId;
final parentNode = mailboxDictionary[parentId];
final node = mailboxDictionary[mailbox.id];
if (node != null) {
if (parentNode != null) {
parentNode.addChildNode(node);
} else {
tree.root.addChildNode(node);
}
}
});
return tree;
}
MailboxNode? _addDescendant(
MailboxTree tree,
PresentationMailbox mailboxChild,
{Map<MailboxId, BuiltList<PresentationMailbox>>? maybeDescendant}
) {
final queue = ListQueue<PresentationMailbox>();
queue.addLast(mailboxChild);
while (queue.isNotEmpty) {
final current = queue.removeFirst();
tree.insertNode(current);
maybeDescendant?.remove(current.id)?.forEach((child) {
queue.addLast(child);
});
}
}
}