javax.swing.tree.DefaultMutableTreeNode#breadthFirstEnumeration ( )源码实例Demo

下面列出了javax.swing.tree.DefaultMutableTreeNode#breadthFirstEnumeration ( ) 实例代码,或者点击链接到github查看源代码,也可以在右侧发表评论。

源代码1 项目: DiskBrowser   文件: AbstractFormattedDisk.java
protected DefaultMutableTreeNode findNode (DefaultMutableTreeNode node, String name)
// ---------------------------------------------------------------------------------//
{
  Enumeration<TreeNode> children = node.breadthFirstEnumeration ();
  if (children != null)
  {
    while (children.hasMoreElements ())
    {
      DefaultMutableTreeNode childNode =
          (DefaultMutableTreeNode) children.nextElement ();
      if (childNode.getUserObject ().toString ().indexOf (name) > 0)
        return childNode;
    }
  }
  return null;
}
 
源代码2 项目: DiskBrowser   文件: FileSystemTab.java
public void replaceDisk (FormattedDisk disk)
// ---------------------------------------------------------------------------------//
{
  // first check currently selected disk
  FileNode fn = (FileNode) getSelectedObject ();
  if (fn != null && fn.replaceDisk (disk))
    return;

  // find the old disk and replace it
  DefaultMutableTreeNode rootNode = getRootNode ();
  Enumeration<TreeNode> children = rootNode.breadthFirstEnumeration ();
  while (children.hasMoreElements ())
  {
    DefaultMutableTreeNode node = (DefaultMutableTreeNode) children.nextElement ();
    fn = (FileNode) node.getUserObject ();
    if (fn.replaceDisk (disk))
      break;
  }
}
 
源代码3 项目: jenetics   文件: TreeTestBase.java
@Test
public void getPath() {
	final T tree = newTree(5, new Random(123));
	final DefaultMutableTreeNode stree = newSwingTree(5, new Random(123));

	final Iterator<T> treeIt = tree.breadthFirstIterator();
	final Enumeration<?> streeIt = stree.breadthFirstEnumeration();

	while (treeIt.hasNext()) {
		final T node = treeIt.next();
		final DefaultMutableTreeNode snode = (DefaultMutableTreeNode)streeIt.nextElement();

		Assert.assertEquals(
			node.pathElements().map(t -> t.value()),
			ISeq.of(snode.getUserObjectPath())
		);
	}
}
 
源代码4 项目: jenetics   文件: TreeTestBase.java
@Test(dataProvider = "nodeQueryMethods")
public void nodeQueryMethod(final QueryMethod method) {
	final Iterator<T> tree = newTree(5, new Random(123))
		.breadthFirstIterator();
	final Enumeration<?> swing = newSwingTree(5, new Random(123))
		.breadthFirstEnumeration();

	while (tree.hasNext()) {
		final T node1 = tree.next();
		final DefaultMutableTreeNode node2 = (DefaultMutableTreeNode)swing.nextElement();

		final Iterator<T> tree1 = node1.breadthFirstIterator();
		final Enumeration<?> swing1 = node2.breadthFirstEnumeration();

		while (tree1.hasNext()) {
			final T node21 = tree1.next();
			final DefaultMutableTreeNode node22 = (DefaultMutableTreeNode)swing1.nextElement();

			assertEqualNodes(
				Try(() -> method._method1.apply(node1, node21)),
				Try(() -> method._method2.apply(node2, node22))
			);
		}
	}
}
 
源代码5 项目: openjdk-jdk9   文件: LastNodeLowerHalfDrop.java
private void expandTree(JTree tree) {
    DefaultMutableTreeNode root = (DefaultMutableTreeNode) tree.getModel()
            .getRoot();
    Enumeration e = root.breadthFirstEnumeration();
    while (e.hasMoreElements()) {
        DefaultMutableTreeNode node = (DefaultMutableTreeNode) e.nextElement();
        if (node.isLeaf()) {
            continue;
        }
        int row = tree.getRowForPath(new TreePath(node.getPath()));
        tree.expandRow(row);
    }
}
 
源代码6 项目: binnavi   文件: TypesTreeModel.java
private List<DefaultMutableTreeNode> collectSubtreeNodes(final DefaultMutableTreeNode node) {
  final List<DefaultMutableTreeNode> nodes = new ArrayList<DefaultMutableTreeNode>();
  for (final Enumeration<?> e = node.breadthFirstEnumeration(); e.hasMoreElements();) {
    nodes.add((DefaultMutableTreeNode) e.nextElement());
  }
  return nodes;
}
 
源代码7 项目: binnavi   文件: TypesTreeModelTests.java
private static Multimap<Integer, DefaultMutableTreeNode> getNodesByLevel(
    final DefaultMutableTreeNode root) {
  final Multimap<Integer, DefaultMutableTreeNode> nodesByLevel = HashMultimap.create();
  for (final Enumeration<?> e = root.breadthFirstEnumeration(); e.hasMoreElements();) {
    final DefaultMutableTreeNode node = (DefaultMutableTreeNode) e.nextElement();
    nodesByLevel.put(node.getLevel(), node);
  }
  return nodesByLevel;
}
 
源代码8 项目: java-swing-tips   文件: MainPanel.java
public static void collapseFirstHierarchy(JTree tree) {
  TreeModel model = tree.getModel();
  DefaultMutableTreeNode root = (DefaultMutableTreeNode) model.getRoot();

  // // Java 9:
  // Collections.list(root.breadthFirstEnumeration()).stream()
  //   .filter(DefaultMutableTreeNode.class::isInstance)
  //   .map(DefaultMutableTreeNode.class::cast)
  //   .takeWhile(node -> node.getLevel() <= 1)
  //   .dropWhile(DefaultMutableTreeNode::isRoot)
  //   .dropWhile(DefaultMutableTreeNode::isLeaf)
  //   .map(DefaultMutableTreeNode::getPath)
  //   .map(TreePath::new)
  //   .forEach(tree::collapsePath);

  // Java 9: Enumeration<TreeNode> e = root.breadthFirstEnumeration();
  Enumeration<?> e = root.breadthFirstEnumeration();
  while (e.hasMoreElements()) {
    DefaultMutableTreeNode node = (DefaultMutableTreeNode) e.nextElement();
    boolean isOverFirstLevel = node.getLevel() > 1;
    if (isOverFirstLevel) { // Collapse only nodes in the first hierarchy
      return;
    } else if (node.isLeaf() || node.isRoot()) {
      continue;
    }
    collapseNode(tree, node);
  }
}
 
源代码9 项目: java-swing-tips   文件: MainPanel.java
private void updateAllChildrenUserObject(DefaultMutableTreeNode root, boolean match) {
  Enumeration<?> breadth = root.breadthFirstEnumeration();
  while (breadth.hasMoreElements()) {
    DefaultMutableTreeNode node = (DefaultMutableTreeNode) breadth.nextElement();
    if (Objects.equals(root, node)) {
      continue;
    }
    FilterableNode uo = (FilterableNode) node.getUserObject();
    uo.status = match;
  }
}
 
源代码10 项目: jenetics   文件: TreeTestBase.java
@Test
public void breathFirstIterator() {
	final T tree = newTree(5, new Random(123));
	final DefaultMutableTreeNode stree = newSwingTree(5, new Random(123));

	final Iterator<T> treeIt = tree.breadthFirstIterator();
	final Enumeration<?> streeIt = stree.breadthFirstEnumeration();

	while (treeIt.hasNext()) {
		final T node = treeIt.next();
		final DefaultMutableTreeNode snode = (DefaultMutableTreeNode)streeIt.nextElement();

		Assert.assertEquals(node.value(), snode.getUserObject());
	}
}
 
源代码11 项目: MavenHelper   文件: TreeUtils.java
public static void nodesChanged(DefaultTreeModel rightTreeModel) {
	DefaultMutableTreeNode root = (DefaultMutableTreeNode) rightTreeModel.getRoot();
	Enumeration enumeration = root.breadthFirstEnumeration();
	while (enumeration.hasMoreElements()) {
		DefaultMutableTreeNode defaultMutableTreeNode = (DefaultMutableTreeNode) enumeration.nextElement();
		rightTreeModel.nodeChanged(defaultMutableTreeNode);
	}
}