Current implementation is not very efficient and would actually first read the whole tree, before returning the first element from the iterator.
5657585960616263
* Creates a tree of Swing TreeNodes wrapping Cayenne project object. Returns the root * node of the tree. */ public static DefaultMutableTreeNode wrapProjectNode(Object node) { TraversalHelper helper = new TraversalHelper(); new ProjectTraversal(helper, true).traverse(node); return helper.getStartNode(); }
7677787980818283
ProjectPath path = new ProjectPath(); if (parentPath != null) { path = helper.registerNodes(parentPath.getPath()); } new ProjectTraversal(helper).traverse(node, path); return helper.getStartNode(); }
5556575859606162
7576777879808182