TreeView - 如何计算所有孩子（包括折叠） [英] TreeView - How to count all children (including collapsed)
问题描述
是否有一种方法可以获取TreeView对象中的子项数？我想把所有的孩子，包括孩子的孩子，都计算在内。
Is there a method to get the number of children in a TreeView object? I want to count all the children, including children's children, all the way down.
getExpandedItemCount（）方法只获取展开子项的子计数。有没有办法计算所有孩子的数量，无论他们是否扩大。
The getExpandedItemCount() method only gets the child count of children who are expanded. Is there a way to get the count of all the children regardless of whether they are expanded or not.
推荐答案
这个答案中的解决方案对于计算小树中的节点来说是过度的。
The solutions in this answer are overkill for just counting nodes in a small tree.
其他答案中的简单递归计数解决方案很好。这个答案仅用于添加更多上下文和替代实现。
The simple recursive count solution in the other answers is fine. This answer is just provided to add a bit more context and alternate implementations.
在堆栈与递归上
使用递归时，您隐式依赖Java运行时来为您维护一堆项目。对于非常大的树，这可能是一个问题，因为运行时可能会耗尽堆栈空间（堆栈溢出）。
When you use recursion, you are implicitly relying on the Java runtime to maintain a stack of items for you. For very large trees, this can be an issue, because the runtime can run out of stack space (a stack overflow).
有关偏好叠加优先于递归的更多信息，请参阅：
For more information on preferring a stack over recursion see:
- John Skeet's回答 Java：有限递归中的Stackoverflow 。
- 顶级编码器树遍历算法，深度优先搜索。
- John Skeet's answer to Java: Stackoverflow in finite recursion.
- Top coder tree traversal algorithms, depth first search.
当然，如果你知道你正在处理的树很小，可以使用递归。有时递归算法比非递归算法更容易理解。
Of course, if you know the trees you are processing are small in size, it is OK to use recursion. Sometimes recursive algorithms are easier to understand than their non-recursive counterparts.
基于迭代器的解决方案
private class TreeIterator<T> implements Iterator<TreeItem<T>> {
private Stack<TreeItem<T>> stack = new Stack<>();
public TreeIterator(TreeItem<T> root) {
stack.push(root);
}
@Override
public boolean hasNext() {
return !stack.isEmpty();
}
@Override
public TreeItem<T> next() {
TreeItem<T> nextItem = stack.pop();
nextItem.getChildren().forEach(stack::push);
return nextItem;
}
}
Iterator用于计算a中项目的示例用法树。
Example usage of the Iterator to count the items in a tree.
TreeIterator<String> iterator = new TreeIterator<>(rootItem);
int nItems = 0;
while (iterator.hasNext()) {
nItems++;
iterator.next();
}
如果需要，迭代器可以适应流，通过创建自定义流支持类，允许您编写功能代码，如：
If desired, the iterator can be adapted to a stream, by creating a custom stream support class, which allows you to write functional code such as:
TreeItemStreamSupport.stream(rootItem)
.filter(TreeItem::isExpanded)
.count()
示例程序
import javafx.application.Application;
import javafx.geometry.Insets;
import javafx.scene.Scene;
import javafx.scene.control.*;
import javafx.scene.layout.VBox;
import javafx.stage.Stage;
import java.util.*;
import java.util.stream.*;
public class TreeViewSample extends Application {
// limits on randomly generated tree size.
private static final int MAX_DEPTH = 8;
private static final int MAX_CHILDREN_PER_NODE = 6;
private static final double EXPANSION_PROPABILITY = 0.2;
public static void main(String[] args) {
launch(args);
}
@Override
public void start(Stage stage) {
Label numItemsLabel = new Label();
// create a tree.
TreeItem<String> rootItem = TreeFactory.createTree(
MAX_DEPTH,
MAX_CHILDREN_PER_NODE,
EXPANSION_PROPABILITY
);
rootItem.setExpanded(true);
TreeView<String> tree = new TreeView<>(rootItem);
numItemsLabel.setText(
"Num Items: " + countExpandedItemsUsingStream(rootItem)
);
// display the number of items and the tree.
VBox layout = new VBox(10, numItemsLabel, tree);
layout.setPadding(new Insets(10));
stage.setScene(new Scene(layout, 300, 250));
stage.show();
}
// unused method demonstrating alternate solution.
private long countItemsUsingIterator(TreeItem<String> rootItem) {
TreeItemIterator<String> iterator = new TreeItemIterator<>(rootItem);
int nItems = 0;
while (iterator.hasNext()) {
nItems++;
iterator.next();
}
return nItems;
}
private long countExpandedItemsUsingStream(TreeItem<String> rootItem) {
return
TreeItemStreamSupport.stream(rootItem)
.filter(TreeItem::isExpanded)
.count();
}
// unused method demonstrating alternate Jens-Peter Haack solution.
private long countItemsUsingRecursion(TreeItem<?> node) {
int count = 1;
for (TreeItem child : node.getChildren()) {
count += countItemsUsingRecursion(child);
}
return count;
}
/**
* Random Tree generation algorithm.
*/
private static class TreeFactory {
private static final Random random = new Random(42);
static TreeItem<String> createTree(
int maxDepth,
int maxChildrenPerNode,
double expansionProbability
) {
TreeItem<String> root = new TreeItem<>("Root 0:0");
Stack<DepthTreeItem> itemStack = new Stack<>();
itemStack.push(new DepthTreeItem(root, 0));
while (!itemStack.isEmpty()) {
int numChildren = random.nextInt(maxChildrenPerNode + 1);
DepthTreeItem nextItem = itemStack.pop();
int childDepth = nextItem.depth + 1;
for (int i = 0; i < numChildren; i++) {
TreeItem<String> child = new TreeItem<>(
"Item " + childDepth + ":" + i
);
child.setExpanded(random.nextDouble() < expansionProbability);
nextItem.treeItem.getChildren().add(child);
if (childDepth < maxDepth) {
itemStack.push(new DepthTreeItem(child, childDepth));
}
}
}
return root;
}
static class DepthTreeItem {
DepthTreeItem(TreeItem<String> treeItem, int depth) {
this.treeItem = treeItem;
this.depth = depth;
}
TreeItem<String> treeItem;
int depth;
}
}
}
/**
* Provide a stream of tree items from a root tree item.
*/
class TreeItemStreamSupport {
public static <T> Stream<TreeItem<T>> stream(TreeItem<T> rootItem) {
return asStream(new TreeItemIterator<>(rootItem));
}
private static <T> Stream<TreeItem<T>> asStream(TreeItemIterator<T> iterator) {
Iterable<TreeItem<T>> iterable = () -> iterator;
return StreamSupport.stream(
iterable.spliterator(),
false
);
}
}
/**
* Iterate over items in a tree.
* The tree should not be modified while this iterator is being used.
*
* @param <T> the type of items stored in the tree.
*/
class TreeItemIterator<T> implements Iterator<TreeItem<T>> {
private Stack<TreeItem<T>> stack = new Stack<>();
public TreeItemIterator(TreeItem<T> root) {
stack.push(root);
}
@Override
public boolean hasNext() {
return !stack.isEmpty();
}
@Override
public TreeItem<T> next() {
TreeItem<T> nextItem = stack.pop();
nextItem.getChildren().forEach(stack::push);
return nextItem;
}
}
这篇关于TreeView - 如何计算所有孩子（包括折叠）的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
