Examples of AbstractNode

ca.nengo.model.impl.AbstractNode
A base implementation of Node. @author Bryan Tripp
com.github.jknack.antlr4ide.ui.railroad.figures.primitives.AbstractNode
com.halware.nakedide.eclipse.ext.annot.common.AbstractNode
Common to an object spec, or to any member.
com.vividsolutions.jts.index.strtree.AbstractNode
A node of the STR tree. The children of this node are either more nodes (AbstractNodes) or real data (ItemBoundables). If this node contains real data (rather than nodes), then we say that this node is a "leaf node". @version 1.7
org.apache.batik.dom.AbstractNode
This class implements the {@link org.w3c.dom.Node} interface. @author Stephane Hillion @version $Id: AbstractNode.java,v 1.12 2002/08/14 14:12:22 hillion Exp $
org.apache.flex.forks.batik.dom.AbstractNode
This class implements the {@link org.w3c.dom.Node} interface. @author Stephane Hillion @version $Id: AbstractNode.java,v 1.19 2005/03/27 08:58:32 cam Exp $
org.apache.jetspeed.page.document.AbstractNode

AbstractNode

@author Scott T. Weaver @version $Id: AbstractNode.java,v 1.9 2005/01/25 00:56:38 rwatler Exp $
org.eclipse.xtext.nodemodel.impl.AbstractNode
org.fusesource.ide.camel.model.AbstractNode
@author lhein
org.gephi.graph.dhns.node.AbstractNode
Implementation of node with default behaviour. @author Mathieu Bastian
org.htmlparser.nodes.AbstractNode
The concrete base class for all types of nodes (tags, text remarks). This class provides basic functionality to hold the {@link Page}, the starting and ending position in the page, the parent and the list of {@link NodeList children}.
org.jboss.dashboard.ui.config.AbstractNode
org.openbp.jaspira.propertybrowser.nodes.AbstractNode
Base class for all nodes of the property browser tree. @author Erich Lauterbach
org.openide.nodes.AbstractNode
org.rascalmpl.parser.gtd.result.AbstractNode
All nodes in the resulting tree are a subtype of this class.
org.structr.core.entity.AbstractNode
Abstract base class for all node entities in structr. @author Axel Morgner @author Christian Morgner
org.woped.qualanalysis.soundness.datamodel.AbstractNode
this abstract class represents a node in a low level petri net all nodes e.g transitions, places should be extend @author Patrick Spies, Patrick Kirchgaessner, Joern Liebau, Enrico Moeller, Sebastian Fuss

Examples of org.gephi.graph.dhns.node.AbstractNode

        return dhns.newEdgeIterable(new EdgeAndMetaEdgeIterator(structure, new TreeIterator(structure, true, Tautology.instance), false, enabledNodePredicate, Tautology.instance));
    }


    public EdgeIterable getMetaEdges(Node node) {
        readLock();
        AbstractNode absNode = checkNode(node);
        return dhns.newEdgeIterable(new MetaEdgeNodeIterator(absNode.getMetaEdgesOutTree(), absNode.getMetaEdgesInTree(), MetaEdgeNodeIterator.EdgeNodeIteratorMode.BOTH, false));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        return dhns.newEdgeIterable(new MetaEdgeNodeIterator(absNode.getMetaEdgesOutTree(), absNode.getMetaEdgesInTree(), MetaEdgeNodeIterator.EdgeNodeIteratorMode.BOTH, false));
    }


    public EdgeIterable getEdgesAndMetaEdges(Node node) {
        readLock();
        AbstractNode absNode = checkNode(node);
        EdgeNodeIterator std = new EdgeNodeIterator(absNode, EdgeNodeIterator.EdgeNodeIteratorMode.BOTH, false, enabledNodePredicate, Tautology.instance);
        MetaEdgeNodeIterator meta = new MetaEdgeNodeIterator(absNode.getMetaEdgesOutTree(), absNode.getMetaEdgesInTree(), MetaEdgeNodeIterator.EdgeNodeIteratorMode.BOTH, false);
        return dhns.newEdgeIterable(new BiEdgeIterator(std, meta));
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    @Test
    public void testMoveToGroup() {


        TreeStructure treeStructure = dhnsGlobal.getGraphStructure().getMainView().getStructure();


        AbstractNode target = (AbstractNode) nodeMap.get("Node 10");
        for (int i = 1; i < 5; i++) {
            AbstractNode ch = (AbstractNode) nodeMap.get("Node " + i);
            int oldSize = target.size;


            graphGlobal.moveToGroup(ch, target);


            assertEquals(oldSize + 1, target.size);
            assertEquals(ch.parent, target);
            assertEquals(target.getPre() + target.size, ch.getPre());
        }


        for (int i = 1; i < 5; i++) {
            AbstractNode ch = (AbstractNode) nodeMap.get("Node " + i);
            int oldSize = target.size;
            graphGlobal.removeFromGroup(ch);


            assertEquals(oldSize - 1, target.size);
            assertEquals(ch.parent, target.parent);

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    public MetaEdge getMetaEdge(Node node1, Node node2) {
        if (node1 == null || node2 == null) {
            return null;
        }
        readLock();
        AbstractNode sourceNode = checkNode(node1);
        AbstractNode targetNode = checkNode(node2);
        AbstractEdge res = sourceNode.getMetaEdgesOutTree().getItem(targetNode.getNumber());
        if (res == null) {
            res = sourceNode.getMetaEdgesInTree().getItem(targetNode.getNumber());
        }
        readUnlock();
        return (MetaEdge) res;
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        Node[] groupArray = new Node[5];
        for (int i = 1; i < 6; i++) {
            groupArray[i - 1] = nodeMap.get("Node " + i);
        }


        AbstractNode group = (AbstractNode) graphGlobal.groupNodes(groupArray);


        assertEquals(oldSize + 1 - groupArray.length, graphGlobal.getNodeCount());
        assertEquals(groupArray.length, group.size);
        assertEquals(graphGlobal.getHeight(), 1);


        int i = 0;
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), group.getPre()); itr.hasNext();) {
            AbstractNode node = itr.next();
            assertEquals(group.pre + i, node.getPre());
            i++;
        }
        try {
            checkHierarchy(treeStructure);
        } catch (Exception ex) {

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        readUnlock();
        return (MetaEdge) res;
    }


    public int getMetaDegree(Node node) {
        AbstractNode absNode = checkNode(node);
        int count = absNode.getMetaEdgesInTree().getCount() + absNode.getMetaEdgesOutTree().getCount();
        return count;
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        Node[] groupArray = new Node[5];
        for (int i = 1; i < 6; i++) {
            groupArray[i - 1] = nodeMap.get("Node " + i);
        }


        AbstractNode group = (AbstractNode) graphGlobal.groupNodes(groupArray);


        graphGlobal.ungroupNodes(group);


        assertEquals(0, group.size);
        for (Node n : groupArray) {
            AbstractNode pn = (AbstractNode) n;
            assertEquals(1, pn.level);
            assertSame(treeStructure.getRoot(), pn.parent);
        }
        //treeStructure.showTreeAsTable();
        assertEquals(oldSize, graphGlobal.getNodeCount());

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        graphGlobal2Directed.resetViewToLeaves();
        assertEquals(2, view.getMutualEdgesEnabled());
        assertEquals(10, view.getEdgesCountEnabled());
        LevelIterator lvlIterator = new LevelIterator(view.getStructure(), 2, Tautology.instance);
        for (; lvlIterator.hasNext();) {
            AbstractNode node = lvlIterator.next();
            assertEquals(node.getEdgesInTree().getCount(), node.getEnabledInDegree());
            assertEquals(node.getEdgesOutTree().getCount(), node.getEnabledOutDegree());
            int expectedMutual = 0;
            ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
            for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                AbstractEdge edge = edgeIterator.next();
                AbstractNode target = edge.getTarget(view.getViewId());
                if (node != target && target.getEdgesOutTree().hasNeighbour(node)) {
                    expectedMutual++;
                }
            }
            assertEquals(expectedMutual, node.getEnabledMutualDegree());
        }
        graphGlobal2Directed.resetViewToTopNodes();
        assertEquals(0, view.getMutualEdgesEnabled());
        assertEquals(0, view.getEdgesCountEnabled());
        graphGlobal2Directed.resetViewToLevel(1);
        assertEquals(2, view.getMutualEdgesEnabled());
        assertEquals(10, view.getEdgesCountEnabled());
        LevelIterator lvlIterator2 = new LevelIterator(view.getStructure(), 2, Tautology.instance);
        for (; lvlIterator2.hasNext();) {
            AbstractNode node = lvlIterator2.next();
            assertEquals(node.getEdgesInTree().getCount(), node.getEnabledInDegree());
            assertEquals(node.getEdgesOutTree().getCount(), node.getEnabledOutDegree());
            int expectedMutual = 0;
            ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
            for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                AbstractEdge edge = edgeIterator.next();
                AbstractNode target = edge.getTarget(view.getViewId());
                if (node != target && target.getEdgesOutTree().hasNeighbour(node)) {
                    expectedMutual++;
                }
            }
            assertEquals(expectedMutual, node.getEnabledMutualDegree());
        }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

        int count = absNode.getMetaEdgesInTree().getCount() + absNode.getMetaEdgesOutTree().getCount();
        return count;
    }


    public int getTotalDegree(Node node) {
        AbstractNode absNode = checkNode(node);
        int count = absNode.getEdgesInTree().getCount()
                + absNode.getEdgesOutTree().getCount()
                + absNode.getMetaEdgesInTree().getCount()
                + absNode.getMetaEdgesOutTree().getCount();
        return count;
    }

View Full Code Here

Examples of org.gephi.graph.dhns.node.AbstractNode

    public void writeEdges(XMLStreamWriter writer, TreeStructure treeStructure) throws XMLStreamException {
        writer.writeStartElement(ELEMENT_EDGES);


        ParamAVLIterator<AbstractEdge> edgeIterator = new ParamAVLIterator<AbstractEdge>();
        for (TreeListIterator itr = new TreeListIterator(treeStructure.getTree(), 1); itr.hasNext();) {
            AbstractNode node = itr.next();
            for (edgeIterator.setNode(node.getEdgesOutTree()); edgeIterator.hasNext();) {
                AbstractEdge edge = edgeIterator.next();
                if (edge.isSelfLoop()) {
                    writer.writeStartElement(ELEMENT_EDGES_SELFLOOP);
                } else if (edge.isMixed()) {
                    writer.writeStartElement(ELEMENT_EDGES_MIXED);

View Full Code Here

0 1 2 3 4 5 6

TOP

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.