recursive_tree_flutter
library
Functions
-
checkAll<T extends AbsNodeType>(TreeType<T> tree)
→ bool
-
checkAll for this tree (from current node to bottom)
-
findRightmostOfABranch<T extends AbsNodeType>(TreeType<T> tree)
→ TreeType<T>
-
If we use canvas to draw lines in expandable tree view (look at example),
we will wonder, what is the rightmost node in current branch of tree?
Because the line in rightmost node has little difference from other.
-
findRoot<T extends AbsNodeType>(TreeType<T> tree)
→ TreeType<T>
-
-
findTreeWithId<T extends AbsNodeType>(TreeType<T> tree, dynamic id)
→ TreeType<T>?
-
-
isChosenAll<T extends AbsNodeType>(TreeType<T> tree, {bool isThisLazyTree = false})
→ EChosenAllValues
-
Check if the the tree is chosen all
-
returnChosenLeaves<T extends AbsNodeType>(TreeType<T> tree, List<TreeType<T>> result)
→ void
-
-
returnChosenNodes<T extends AbsNodeType>(TreeType<T> tree, List<TreeType<T>> result)
→ void
-
-
returnFavoriteNodes<T extends AbsNodeType>(TreeType<T> tree, List<TreeType<T>> result)
→ void
-
-
searchAllTreesWithTitleDFS<T extends AbsNodeType>(TreeType<T> tree, String text, List<TreeType<T>> result)
→ void
-
Using DFS to return all the trees if each of root's data contains searching
text
-
searchLeavesWithTitleDFS<T extends AbsNodeType>(TreeType<T> tree, String text, List<TreeType<T>> result)
→ void
-
Using DFS to return leaves if each of leaf's data contains searching text
-
showVTSDepartmentTreeBottomSheet<T extends AbsNodeType>({required BuildContext context, double? height, double sheetBorderRadius = 24, double spaceTopPositionedMainView = 24, Widget? titleLeadingWidget, Widget? titleTrailingWidget, required String sheetTitle, TextStyle? sheetTitleStyle, required Widget loadingWidget, required Widget emptyPage, required Widget errorPage, Widget handleBar = const SizedBox.shrink(), required Future<TreeType<T>?> funcParseDataToTree, dynamic funcWhenComplete(TreeType<T> tree)?, required FunctionBuildLeadingWidget<T> buildLeadingWidgetNode})
→ void
-
-
uncheckALl<T extends AbsNodeType>(TreeType<T> tree)
→ bool
-
uncheckAll
for this tree (from current node to bottom)
-
updateAllUnavailableNodes<T extends AbsNodeType>(TreeType<T> tree)
→ bool
-
This function is used to update all unavailable nodes of current tree.
-
updateTreeMultipleChoice<T extends AbsNodeType>(TreeType<T> tree, bool? chosenValue, {bool isUpdatingParentRecursion = false, bool isThisLazyTree = false})
→ void
-
updateTreeMultipleChoice when choose/un-choose a node:
-
updateTreeSingleChoice<T extends AbsNodeType>(TreeType<T> tree, bool chosenValue)
→ void
-
The tree is single choice, not multiple choice. Only leaf can be chosen.
-
updateTreeSingleChoiceDms4<T extends AbsNodeType>(TreeType<T> tree, bool chosenValue)
→ void
-
The tree is single choice, not multiple choice. Viettel DMS.4 customized
version: Every node can be chosen, so
T.isChosen
is never null.
-
updateTreeWithSearchingTitle<T extends AbsNodeType>(TreeType<T> tree, String searchingText, {bool willBlurParent = false, bool willAllExpanded = false})
→ void
-
Update field
isShowedInSearching
of every node based on searching text.