Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.Graph

43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
    @Test
    public void testOneGraph() throws Exception
    {
        GatewayLocation gw = new SimpleGatewayLocation("GWA", "EPR");
        Graph graph = new Graph();
        ProcessingElementNode a = new ProcessingElementNode("A");
        a.addAnnotation(AnnotationKeys.GATEWAY, gw);
        ProcessingElementNode b = new ProcessingElementNode("B");
        b.addAnnotation(AnnotationKeys.GATEWAY, gw);
        ProcessingElementNode c = new ProcessingElementNode("C");
        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
93
94
95
96
97
98
99
100
101
102
103
104
        ProcessingElementNode c = new ProcessingElementNode("C");
        ProcessingElementNode d = new ProcessingElementNode("D");
        a.connectInput("in1", 0, b.getOutput("out", 0));
        a.connectInput("in2", 0, c.getOutput("out", 0));
        a.connectInput("in3", 0, d.getOutput("out", 0));
        Graph graph = GraphUtilities.getConnectedComponent(a);
        List<RequestNode> nodes = graph.getNodes();
        Assert.assertEquals(4, nodes.size());
        Assert.assertTrue(nodes.contains(a));
        Assert.assertTrue(nodes.contains(b));
        Assert.assertTrue(nodes.contains(c));
        Assert.assertTrue(nodes.contains(d));
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
       
        do
        {
            processedComposite = false;

            Graph newGraph = new Graph();
            for (RequestNode node : graph.getNodes())
            {
                // Don't process a CPE twice - the optimiser set includes
                // flatten then we will never get a CPE here.
                if (!(node instanceof CompositeProcessingElement))
                {
                    String impl = null;
                    if (node instanceof ProcessingElementNode)
                    {
                        String name = ((ProcessingElementNode)node).getChosenPEOrNodeName();
                        Map<String, Set<DispelObject>> reg;
                        try
                        {
                            reg = mAdmireRegistry.lookup(Collections.singleton(name));
                        }
                        catch (LookupFailedException e)
                        {
                            throw new TransformationException(e);
                        }
                        Iterator<DispelObject> iterator = reg.get(name).iterator();
                        // assume that there is at least one PE
                        if (!iterator.hasNext())
                        {
                            throw new TransformationException(
                                    new UnregisteredUsedObjectException(name));
                        }
                        impl = iterator.next().dispel;
                    }
                   
                    if (impl != null)
                    {
                        insertComposite(context, newGraph, node, impl);
                        processedComposite = true;
                    }
                    else
                    {
                        newGraph.add(node);
                    }
                }
                else
                {
                    newGraph.add(node);
                }
            }

            graph = newGraph;
View Full Code Here
59
60
61
62
63
64
65
66
67
68
    {
        DISPELGraphBuilder builder =
            runDISPEL(new StringReader(
                "Type A is PE(<Connection:String input> => <>); " +
                "A a = new A; |- \"xxxx\" -|:String => a.input; submit a; "));
        Graph graph = builder.getSubmittedGraphs().iterator().next();
        TypeValidator validator = new TypeValidator();
        validator.setTypeChecker(new StrictTypeChecker());
        validator.transform(null, graph);
    }
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
102
                    Collections.<ProcessingElementInputDescriptor>emptyList(),
                    Arrays.asList(outp),
                    null);
        b.setDescriptor(desc);
        b.connectOutput("output", 0, a.getInput("input", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
        TypeValidator validator = new TypeValidator();
        validator.setTypeChecker(new StrictTypeChecker());
        validator.transform(null, graph);
    }
View Full Code Here
124
125
126
127
128
129
130
131
132
133
134
135
136
                    Collections.<ProcessingElementInputDescriptor>emptyList(),
                    Arrays.asList(outp),
                    null);
        b.setDescriptor(desc);
        b.connectOutput("output", 0, a.getInput("input", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
        TypeValidator validator = new TypeValidator();
        validator.setTypeChecker(new StrictTypeChecker());
        try
        {
            validator.transform(null, graph);
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
        super.tearDown();
    }
   
    public void testSimple() throws Exception
    {
        Graph graph = new Graph();
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        graph.add(nodeA);
        ProcessingElementNode nodeB = new ProcessingElementNode("uk.org.ogsadai.DeliverToRequestStatus");
        graph.add(nodeB);
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection connection2 = new TeeConnection();
        nodeA.connectOutput("out2", 0, connection2);
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
        System.out.println(dot);
    }

    public void testSimpleWithVariableName() throws Exception
    {       
        Graph graph = new Graph();
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        graph.add(nodeA);
        ProcessingElementNode nodeB = new ProcessingElementNode("eu.admire.Results");
        graph.add(nodeB);
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection connection2 = new TeeConnection();
        nodeA.connectOutput("out2", 0, connection2);
        nodeB.connectInput("in2", 0, connection2);
        Map<String, Variable> variables = new HashMap<String, Variable>();
        variables.put("query", new Variable(new ProcessingElementType("uk.org.ogsadai.SQLQuery"), nodeA));
        variables.put("results", new Variable(new ProcessingElementType("eu.admire.Results"), nodeB));
        String dot = DotGenerator.generate(graph.getNodes(), variables);
        writeFile(dot);
        System.out.println(dot);
    }
View Full Code Here
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
        System.out.println(dot);
    }

    public void testMultipleInputs() throws Exception
    {
        Graph graph = new Graph();
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        graph.add(nodeA);
        ProcessingElementNode nodeB = new ProcessingElementNode("uk.org.ogsadai.DeliverToRequestStatus");
        graph.add(nodeB);
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection connection2 = new TeeConnection();
        nodeA.connectOutput("out1", 1, connection2);
View Full Code Here
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
        outputDesc.setSType(list);
        outputDescriptors.add(outputDesc);
        ProcessingElementDescriptor desc =
            new SimpleProcessingElementDescriptor(inputDescriptors, outputDescriptors, null);

        Graph graph = new Graph();
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        nodeA.setDescriptor(desc);
        graph.add(nodeA);
        ProcessingElementNode nodeB = new ProcessingElementNode("uk.org.ogsadai.DeliverToRequestStatus");
        nodeB.setDescriptor(desc);
        graph.add(nodeB);
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection connection2 = new TeeConnection();
        nodeA.connectOutput("out1", 1, connection2);
View Full Code Here
TOP

Related Classes of eu.admire.dispel.graph.Graph

  • eu.admire.dispel.engine.DispelEngineTest
  • eu.admire.dispel.engine.SimpleLocalOptimiser
  • eu.admire.dispel.graph.converter.GraphConverter
  • eu.admire.dispel.parser.v4.builder.CreatePETypeStrategy
  • eu.admire.dispel.parser.v4.builder.DISPELGraphBuilderTest
  • eu.admire.dispel.parser.v4.builder.RootStrategy
  • eu.admire.gateway.dmil.graph.converter.GraphConverterTest
  • eu.admire.gateway.dmil.graph.GraphUtilitiesTest
  • eu.admire.gateway.dmil.graph.visualisation.DotGeneratorTest
  • eu.admire.gateway.engine.ogsadai.PartitionedGraphToWorkflowsTest
    • 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.