List of nodes() Examples

Examples of nodes()

com.ibm.sbt.util.JsonNavigator.nodes()
com.jcabi.xml.XML.nodes()
com.jcabi.xml.XMLDocument.nodes()
com.tll.util.PropertyPath.nodes()
@return The atomic property "nodes" that makeup this property path.
E.g.: propA.propB returns { propA, propB }
com.xmlcalabash.model.InlineBinding.nodes()
diva.graph.GraphModel.nodes()
Provide an iterator over the nodes in the given graph or composite node. This iterator does not necessarily support removal operations.
net.kuujo.copycat.test.TestCluster.nodes()
Returns a list of test nodes. @return A list of test nodes.
org.apache.kafka.common.Cluster.nodes()
@return The known set of nodes
org.eclipse.jetty.deploy.graph.Path.nodes()
org.eclipse.sapphire.ui.forms.MasterDetailsContentNodePart.nodes()
org.elasticsearch.action.admin.cluster.node.info.NodesInfoResponse.nodes()
org.elasticsearch.action.admin.cluster.state.ClusterStateRequest.nodes()
org.elasticsearch.cluster.ClusterState.nodes()
org.elasticsearch.cluster.node.DiscoveryNodes.nodes()
org.evolizer.daforjava.graph.data.DependencyGraph.nodes()
org.gridgain.grid.cache.affinity.consistenthash.GridCacheConsistentHashAffinityFunction.nodes()
Assigns nodes to one partition. @param part Partition to assign nodes for. @param nodes Cache topology nodes. @return Assigned nodes, first node is primary, others are backups.
org.hornetq.core.client.impl.Topology.nodes()
org.neo4j.graphdb.Path.nodes()
Returns all the nodes in this path. The first node is the same as {@link #startNode()} and the last node is the same as {@link #endNode()}. In between those nodes there can be an arbitrary number of nodes. The shortest path possible is just one node, where also the the start node is the same as the end node. @return the nodes in this path.
org.neo4j.graphdb.traversal.Traverser.nodes()
Represents the traversal in the form of {@link Node}s. This is a convenient way to iterate over {@link Path}s and get the {@link Path#endNode()} for each position. @return the traversal in the form of {@link Node} objects.
org.qi4j.index.elasticsearch.ElasticSearchClusterConfiguration.nodes()
Coma separated list of nodes host:port. Defaults to '127.0.0.1:9300'.
org.renjin.sexp.PairList.nodes()
prefuse.data.Graph.nodes()
Get an iterator over all nodes in the graph. @return an iterator over Node instances
prefuse.data.Tree.nodes()
prefuse.visual.VisualGraph.nodes()
ptolemy.graph.DirectedGraph.nodes()
y.base.Graph.nodes()
y.base.NodeList.nodes()

Examples of y.base.Graph.nodes()

    public void groupAll() {
        List<Edge> allEdges = new ArrayList<Edge>();


        HierarchyManager hierarchyManager = getRootGraph().getHierarchyManager();
        Graph rootGraph = hierarchyManager.getRootGraph();
        for (NodeCursor nc = rootGraph.nodes(); nc.ok(); nc.next()) {
            Node v = nc.node();
            for (EdgeCursor ec = v.outEdges(); ec.ok(); ec.next()) {
                Edge e = ec.edge();
                allEdges.add(e);
            }

View Full Code Here

Examples of y.base.NodeList.nodes()

        } 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

0 1 2 3 4 5 6 7

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.