Is there any better way to filter nodes? about flutter_tree_view HOT 3 CLOSED

  void onSearch() {
    if (searchContent.trim().isEmpty) {
      getData();
    } else {
      final TreeNode newRootNode = TreeNode(id: 'SearchRoot');

      final Set<TreeNode> searchData =
          buildSearchData(searchContent, Set<TreeNode>.from(rootNode.children));

      newRootNode.addChildren(searchData);

      treeController = TreeViewController(rootNode: newRootNode);
    }

    treeController.expandAll();

    setState(() {});
  }

  Set<TreeNode> buildSearchData(String content, Iterable<TreeNode> nodes) {
    return nodes
        .map(
          (TreeNode e) {
            final TreeNode treeNode =
                TreeNode(id: e.id, label: e.label, data: e.data);
            if (e.hasChildren) {
              if (e.label.contains(content)) {
                final Set<TreeNode> children = Set<TreeNode>.from(e.children);
                treeNode.addChildren(children);
                return treeNode;
              } else {
                final Iterable<TreeNode> searchData =
                    buildSearchData(content, e.children);
                if (searchData.isNotEmpty) {
                  searchData.forEach(treeNode.addChild);
                  return treeNode;
                }
              }
            } else if (e.label.contains(content)) {
              return treeNode;
            } else if (e.data is Map<String, dynamic>) {
              final Map<String, dynamic> data = e.data as Map<String, dynamic>;
              // tree data satisfies search content
              if (data.validateAny(
                (Map<String, dynamic> data) => <bool?>[
                  cast<String?>(data['standards'])?.contains(content),
                  cast<String?>(data['unit'])?.contains(content),
                ],
              )) {
                return treeNode;
              }
            }
          },
        )
        .whereNotNull()
        .toSet();
  }

if (e.hasChildren) {
  if (e.label.contains(content)) {
    // You should probably copy each child into a new TreeNode here, right?
    final Set<TreeNode> children = Set<TreeNode>.from(e.children);
    // Before adding them to the treeNode children as below
    treeNode.addChildren(children);
    return treeNode;
  } else {
    // ...
  }
}

if (e.hasChildren) {
  if (e.label.contains(content)) {
    for (final TreeNode child in e.children) {
      final TreeNode newChild = TreeNode(id: child.id, label: child.label, data: child.data);
      treeNode.addChild(newChild);
    }
    return treeNode;
  } else {
    // ...
  }
}