Package y.base

Examples of y.base.NodeList

543
544
545
546
547
548
549
550
551
552
553
554
555
556
     * @param parentNode The parent node
     *
     * @return List of descendant nodes (parent node is included)
     */
    public NodeList getVisibleDescendants(Node parentNode) {
        NodeList visibleDescendants = new NodeList();
        NodeList allDescendants = getDescendants(parentNode);
        for (NodeCursor nc = getHierarchyManager().getInnerGraph(parentNode).nodes(); nc.ok(); nc.next()) {
            if (allDescendants.contains(nc.node())) {
                visibleDescendants.add(nc.node());
            }
        }

        return visibleDescendants;
View Full Code Here
562
563
564
565
566
567
568
569
570
571
572
573
574
575
     * @param parentNode Parent node.
     *
     * @return List of all descendant nodes.
     */
    public NodeList getDescendants(Node parentNode) {
        NodeList descendants = new NodeList();

        descendants.add(parentNode);
        for (NodeCursor nc = getHierarchyManager().getChildren(parentNode); nc.ok(); nc.next()) {
            descendants.addAll(getDescendants(nc.node()));
        }

        return descendants;
    }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
        sLogger.debug("Expand folder node " + parentNode);

        getHierarchyManager().openFolder(parentNode);

        // reinsert low level edges
        NodeList visibleDescendants = fGraph.getVisibleDescendants(parentNode);
        List<Edge> reinsertedLowLevelEdges = new ArrayList<Edge>();
        for (Object node : visibleDescendants) {
//            reinsertLowLevelEdges((Node) node);
            for (Edge edge : reinsertLowLevelEdges((Node) node)) {
                if (!reinsertedLowLevelEdges.contains(edge)) {
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
130
            fAddedNodes.add(node);
        } else if (graphEvent.getType() == GraphEvent.POST_NODE_REMOVAL) {
            Node node = (Node) graphEvent.getData();
            fRemovedNodes.add(node);
        } else if (graphEvent.getType() == GraphEvent.SUBGRAPH_INSERTION) {
            NodeList nl = (NodeList) graphEvent.getData();
            for (NodeCursor nc = nl.nodes(); nc.ok(); nc.next()) {
                fAddedNodes.add(nc.node());
            }
        } else if (graphEvent.getType() == GraphEvent.EDGE_CREATION) {
            Edge edge = (Edge) graphEvent.getData();
            fAddedEdges.add(edge);
View Full Code Here
TOP

Related Classes of y.base.NodeList

  • org.evolizer.daforjava.graph.data.DependencyGraph
  • org.evolizer.daforjava.graph.data.EdgeGrouper
  • org.evolizer.daforjava.graph.panel.rendering.GraphReLayouter
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.