Package eu.admire.gateway.location.simple

Examples of eu.admire.gateway.location.simple.SimplePartitioner

30
31
32
33
34
35
36
37
38
39
40
41
        ProcessingElementNode c = new ProcessingElementNode("C");
        c.addAnnotation(AnnotationKeys.GATEWAY, gw2);
        b.connectInput("in", 0, a.getOutput("out", 0));
        graph.add(a); graph.add(b); graph.add(c);
       
        SimplePartitioner partitioner = new SimplePartitioner();
        Map<GatewayLocation, Graph> partitions = partitioner.partition(graph);
        TestCase.assertEquals(2, partitions.size());
        Graph g = partitions.get(gw1);
        TestCase.assertTrue(g.getNodes().containsAll(Arrays.asList(a, b)));
        g = partitions.get(gw2);
        TestCase.assertTrue(g.getNodes().contains(c));
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
65
        c.addAnnotation(AnnotationKeys.GATEWAY, gw);
        b.connectInput("in", 0, a.getOutput("out", 0));
        c.connectInput("in", 0, b.getOutput("out", 0));
        graph.add(a); graph.add(b); graph.add(c);
       
        SimplePartitioner partitioner = new SimplePartitioner();
        Map<GatewayLocation, Graph> partitions = partitioner.partition(graph);
        TestCase.assertEquals(1, partitions.size());
        Graph g = partitions.get(gw);
        TestCase.assertEquals(3, g.getNodes().size());
        TestCase.assertTrue(g.getNodes().containsAll(Arrays.asList(a, b, c)));
    }
View Full Code Here
TOP

Related Classes of eu.admire.gateway.location.simple.SimplePartitioner

  • eu.admire.dispel.graph.Graph
  • eu.admire.dispel.graph.RequestNodeInput
  • eu.admire.gateway.location.GatewayLocation
  • eu.admire.gateway.location.SimplePartitionerTest
    • 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.