Examples of nodes()

Examples of org.gridgain.grid.cache.affinity.consistenthash.GridCacheConsistentHashAffinityFunction.nodes()

199
200
201
202
203
204
205
206
207
208
209
        boolean ok = true;

        for (Map.Entry<Object, Integer> entry : data.entrySet()) {
            int part = aff.partition(entry.getKey());
            Collection<GridNode> affNodes = aff.nodes(part, nodes, 1);
            UUID act = F.<GridNode>first(affNodes).id();
            UUID exp = nodes.get(entry.getValue()).id();

            if (!exp.equals(act)) {
                ok = false;
View Full Code Here

Examples of org.hornetq.core.client.impl.Topology.nodes()

218
219
220
221
222
223
224
225
226
227
228
   private void waitForServerTopology(HornetQServer server, int nodes, int seconds)
         throws InterruptedException
   {
      Topology topology = server.getClusterManager().getTopology();
      long timeToWait = System.currentTimeMillis() + (seconds * 1000);
      while(topology.nodes()!= nodes)
      {
         Thread.sleep(100);
         if(System.currentTimeMillis() > timeToWait)
         {
            fail("timed out waiting for server topology");
View Full Code Here

Examples of org.neo4j.graphdb.Path.nodes()

107
108
109
110
111
112
113
114
115
116
117
        // END SNIPPET: shortestPathUsage
        Path path = paths.iterator().next();
        assertEquals( 2, path.length() );
        assertEquals( startNode, path.startNode() );
        assertEquals( endNode, path.endNode() );
        Iterator<Node> iterator = path.nodes().iterator();
        iterator.next();
        assertEquals( middleNode1, iterator.next() );
    }

    private void createRelationshipsBetween( final Node... nodes )
View Full Code Here

Examples of org.neo4j.graphdb.traversal.Traverser.nodes()

73
74
75
76
77
78
79
80
81
82
83
                .prune(Traversal.pruneAfterDepth(MAXIMUM_DEPTH))
                .filter(returnEval)
                .expand(Traversal.expanderForTypes(relType, Direction.BOTH));
        final Traverser traverser = traversalDescription
                .traverse(startNode);
        return traverser.nodes().iterator();
    }

    private static class PathReturnEval implements Predicate<Path> {
        private final Map<Node, Node> myNodes;
        private final Map<Node, Node> otherNodes;
View Full Code Here

Examples of org.qi4j.index.elasticsearch.ElasticSearchClusterConfiguration.nodes()

42
43
44
45
46
47
48
49
50
51
52
        String clusterName = config.clusterName().get() == null ? DEFAULT_CLUSTER_NAME : config.clusterName().get();
        index = config.index().get() == null ? DEFAULT_INDEX_NAME : config.index().get();
        indexNonAggregatedAssociations = config.indexNonAggregatedAssociations().get();

        String[] nodes = config.nodes().get() == null ? new String[]{ "localhost:9300" } : config.nodes().get().split( "," );
        boolean clusterSniff = config.clusterSniff().get();
        boolean ignoreClusterName = config.ignoreClusterName().get();
        String pingTimeout = config.pingTimeout().get() == null ? "5s" : config.pingTimeout().get();
        String samplerInterval = config.samplerInterval().get() == null ? "5s" : config.samplerInterval().get();
View Full Code Here

Examples of org.renjin.sexp.PairList.nodes()

315
316
317
318
319
320
321
322
323
324
325
    int found = 1; /* we "know" the class attribute is there */

    found++; // we also have our fake __S4_BIt for renjin

    PairList attrib = def.getAttributes().asPairList();
    for(PairList.Node s : attrib.nodes()) {
      SEXP t = s.getTag();
      if(t == R_target) {
        ev.setVariable(R_dot_target, s.getValue());
        found++;
      }
View Full Code Here

Examples of prefuse.data.Graph.nodes()

85
86
87
88
89
90
91
92
93
94
95
        init(g, bounds);

        for (int curIter=0; curIter < maxIter; curIter++ ) {

            // Calculate repulsion
            for (Iterator iter = g.nodes(); iter.hasNext();) {
                NodeItem n = (NodeItem)iter.next();
                if (n.isFixed()) continue;
                calcRepulsion(g, n);
            }
View Full Code Here

Examples of prefuse.data.Tree.nodes()

35
36
37
38
39
40
41
42
43
44
45
       
        assertEquals(true, t.isValidTree());
       
        Node[] nodelist = new Node[t.getNodeCount()];
       
        Iterator nodes = t.nodes();
        for ( int i=0; nodes.hasNext(); ++i ) {
            nodelist[i] = (Node)nodes.next();
        }
        assertEquals(false, nodes.hasNext());
    }
View Full Code Here

Examples of prefuse.visual.VisualGraph.nodes()

153
154
155
156
157
158
159
160
161
162
163
        at.addColumn(VisualItem.POLYGON, float[].class);
        at.addColumn("id", int.class);
       
        // add nodes to aggregates
        // create an aggregate for each 3-clique of nodes
        Iterator nodes = vg.nodes();
        for ( int i=0; i<3; ++i ) {
            AggregateItem aitem = (AggregateItem)at.addItem();
            aitem.setInt("id", i);
            for ( int j=0; j<3; ++j ) {
                aitem.addItem((VisualItem)nodes.next());
View Full Code Here

Examples of ptolemy.graph.DirectedGraph.nodes()

188
189
190
191
192
193
194
195
196
197
198
        //HashMap color = new HashMap();
        double[] distance = new double[graph.nodeCount()];
        _predecessor = new int[graph.nodeCount()];

        for (Iterator nodes = graph.nodes().iterator(); nodes.hasNext();) {
            Node node = (Node) nodes.next();

            if (node != _startNode) {
                //color.put(node, Color.white);
                distance[graph.nodeLabel(node)] = -Double.MIN_VALUE;
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.