Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.Graph

948
949
950
951
952
953
954
955
956
957
958
959
960
        Reader dispel = dispelFromFile("insertTypeConverter.dispel");
       
        DispelEngineResult result = engine.processDispel(dispel);
        Collection<Graph> graphs = result.getExecutionGraphs();
        assertEquals("Expect a single execution graph", 1, graphs.size());
        Graph graph = graphs.iterator().next();
        RequestNode echo = null;
        for (RequestNode node : graph.getNodes())
        {
            if (node.getName().equals("uk.org.ogsadai.Echo"))
            {
                echo = node;
            }
View Full Code Here
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
        Reader dispel = dispelFromFile("ExternalOutputWithTee.dispel");
       
        DispelEngineResult result = engine.processDispel(dispel);
       
        assertEquals(1, result.getExecutionGraphs().size());
        Graph graph = result.getExecutionGraphs().iterator().next();
       
        for (RequestNode node : graph.getNodes())
        {
            if (node.getName().equals("uk.org.ogsadai.SQLQuery"))
            {
                Connection output = node.getOutput("result", 0);
                assertEquals(2, output.getTargets().size());
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
            "register B;";
        registry.registerProcessingElement(desc, implementation);
        insert.setAdmireRegistry(registry);
        insert.setDispelOptimiser(new SimpleDispelOptimiser());
        RequestContext context = new MockRequestContext();
        Graph graph = new Graph();
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        ProcessingElementNode b = new ProcessingElementNode("B");
        b.connectInput("in", 0, a.getOutput("out", 0));
        ProcessingElementNode c = new ProcessingElementNode("eu.admire.C");
        c.connectInput("in", 0, b.getOutput("out", 0));
        graph.add(a);
        graph.add(b);
        graph.add(c);
        Graph transformed = insert.transform(context, graph);
        List<RequestNode> nodes = transformed.getNodes();
        TestCase.assertTrue(nodes.remove(a));
        TestCase.assertTrue(nodes.remove(c));
        TestCase.assertTrue(!nodes.contains(b));
        TestCase.assertEquals(1, nodes.size());
        RequestNode node = nodes.get(0);
View Full Code Here
75
76
77
78
79
80
81
82
83
84
85
86
87
        InsertCompositeProcessingElements insert = new InsertCompositeProcessingElements();
        InMemoryAdmireRegistry registry = new InMemoryAdmireRegistry();
        insert.setAdmireRegistry(registry);
        insert.setDispelOptimiser(new SimpleDispelOptimiser());
        RequestContext context = new MockRequestContext();
        Graph graph = new Graph();
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        graph.add(a);
        try
        {
            insert.transform(context, graph);
            TestCase.fail("Expected a TransformationException.");
        }
View Full Code Here
41
42
43
44
45
46
47
48
49
50
51
52
            {
                // submit the first node that is found in a component
                if (!(node instanceof LiteralValuesNode))
                {
                    dispel.append("\nsubmit ").append(names.get(node)).append(";\n");
                    Graph component = GraphUtilities.getConnectedComponent(node);
                    notSubmitted.removeAll(component.getNodes());
                    break;
                }
            }
        }
View Full Code Here
59
60
61
62
63
64
65
66
67
68
69
70
     * @param composite processing element
     * @return DISPEL
     */
    public static String convertToDISPEL(String name, CompositeProcessingElement composite)
    {
        Graph graph = new Graph();
        graph.addAll(composite.getElements());
        Map<RequestNode, String> names = new HashMap<RequestNode, String>();
        StringBuilder dispel = new StringBuilder();
        writeDISPEL(dispel, names, graph);
        int length = dispel.length();
       
View Full Code Here
16
17
18
19
20
21
22
23
24
25
26
    }

    @Override
    public Graph optimise(Graph graph) throws TransformationException
    {
        Graph transformed = graph;
        for (Optimiser optimiser : mOptimisers)
        {
            transformed = optimiser.transform(null, transformed);
        }
        return transformed;
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
        expectedNodesAndGateways.put("admire.dataAccess.relational.DAS2", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleSelect", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleArithmeticProject", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleUnionAll", "g1");
       
        Graph graph = graphs.iterator().next();
        assertNodesAndAnnotations(
            expectedNodesAndGateways,
            graph,
            "gateway");
       
        TestExecutionEngineRegistry execEngineRegistry =
            new TestExecutionEngineRegistry();
       
        execEngineRegistry.addExecutionEngine("e1", new MockLocation("e1"));
        execEngineRegistry.addExecutionEngine("e2", new MockLocation("e2"));
        execEngineRegistry.addExecutionEngine("e3", new MockLocation("e3"));
        execEngineRegistry.addExecutionEngine("e4", new MockLocation("e4"));
       
        execEngineRegistry.addDataSourceMapping("res1", "e1");
        execEngineRegistry.addDataSourceMapping("res2", "e2");
       
        SimpleLocalOptimiser localOptimiser = new SimpleLocalOptimiser();
        List<Optimiser> localOptimisers = new ArrayList<Optimiser>();
        AddCandidateExecutionEngines addCandidateExecutionEngines = new AddCandidateExecutionEngines();
        addCandidateExecutionEngines.setExecutionEngineRegistry(execEngineRegistry);
       
        ProcessLocalDataSourceAnchors processLocalDataSourceAnchors = new ProcessLocalDataSourceAnchors();
        processLocalDataSourceAnchors.setExecutionEngineRegistry(execEngineRegistry);
       
        PropagateExecutionEngineAllocations propagateExecutionEngineAllocations = new PropagateExecutionEngineAllocations();
       
        localOptimisers.add(addCandidateExecutionEngines);
        localOptimisers.add(processLocalDataSourceAnchors);
        localOptimisers.add(propagateExecutionEngineAllocations);
       
        localOptimiser.setOptimisers(localOptimisers);
       
        Graph local = localOptimiser.optimise(graph);
        Map<String, List<String>> expectedNodesAndExecutionEngines =
            new HashMap<String, List<String>>();
        expectedNodesAndExecutionEngines.put("admire.dataAccess.relational.DAS1", Arrays.asList("e1"));
        expectedNodesAndExecutionEngines.put("admire.dataAccess.relational.DAS2", Arrays.asList("e2"));
        expectedNodesAndExecutionEngines.put("uk.org.ogsadai.TupleSelect", Arrays.asList("e1", "e2"));
View Full Code Here
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
        expectedNodesAndGateways.put("admire.dataAccess.relational.DAS2", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleSelect", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleArithmeticProject", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleUnionAll", "g1");
       
        Graph graph = graphs.iterator().next();
        assertNodesAndAnnotations(
            expectedNodesAndGateways,
            graph,
            "gateway");
       
        TestExecutionEngineRegistry execEngineRegistry =
            new TestExecutionEngineRegistry();
       
        execEngineRegistry.addExecutionEngine("e1", new MockLocation("e1"));
        execEngineRegistry.addExecutionEngine("e2", new MockLocation("e2"));
        execEngineRegistry.addExecutionEngine("e3", new MockLocation("e3"));
        execEngineRegistry.addExecutionEngine("e4", new MockLocation("e4"));
       
        execEngineRegistry.addDataSourceMapping("res1", "e1");
        execEngineRegistry.addDataSourceMapping("res2", "e2");
       
        SimpleLocalOptimiser localOptimiser = new SimpleLocalOptimiser();
        List<Optimiser> localOptimisers = new ArrayList<Optimiser>();
        AddCandidateExecutionEngines addCandidateExecutionEngines = new AddCandidateExecutionEngines();
        addCandidateExecutionEngines.setExecutionEngineRegistry(execEngineRegistry);
       
        ProcessLocalDataSourceAnchors processLocalDataSourceAnchors = new ProcessLocalDataSourceAnchors();
        processLocalDataSourceAnchors.setExecutionEngineRegistry(execEngineRegistry);
       
        PropagateExecutionEngineAllocations propagateExecutionEngineAllocations = new PropagateExecutionEngineAllocations();
       
        localOptimisers.add(addCandidateExecutionEngines);
        localOptimisers.add(processLocalDataSourceAnchors);
        localOptimisers.add(propagateExecutionEngineAllocations);
       
        localOptimiser.setOptimisers(localOptimisers);
       
        Graph local = localOptimiser.optimise(graph);
        Map<String, List<String>> expectedNodesAndExecutionEngines =
            new HashMap<String, List<String>>();
        expectedNodesAndExecutionEngines.put("admire.dataAccess.relational.DAS1", Arrays.asList("e1"));
        expectedNodesAndExecutionEngines.put("admire.dataAccess.relational.DAS2", Arrays.asList("e2"));
        expectedNodesAndExecutionEngines.put("uk.org.ogsadai.TupleSelect", Arrays.asList("e3"));
View Full Code Here
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
        expectedNodesAndGateways.put("admire.dataAccess.relational.DAS2", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleSelect", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleArithmeticProject", "g1");
        expectedNodesAndGateways.put("uk.org.ogsadai.TupleUnionAll", "g1");
       
        Graph graph = graphs.iterator().next();
        assertNodesAndAnnotations(
            expectedNodesAndGateways,
            graph,
            "gateway");
       
        TestExecutionEngineRegistry execEngineRegistry =
            new TestExecutionEngineRegistry();
       
        execEngineRegistry.addExecutionEngine("e1", new MockLocation("e1"));
        execEngineRegistry.addExecutionEngine("e2", new MockLocation("e2"));
        execEngineRegistry.addExecutionEngine("e3", new MockLocation("e3"));
        execEngineRegistry.addExecutionEngine("e4", new MockLocation("e4"));
       
        execEngineRegistry.addDataSourceMapping("res1", "e1");
        execEngineRegistry.addDataSourceMapping("res2", "e2");
       
        SimpleLocalOptimiser localOptimiser = new SimpleLocalOptimiser();
        List<Optimiser> localOptimisers = new ArrayList<Optimiser>();
        AddCandidateExecutionEngines addCandidateExecutionEngines = new AddCandidateExecutionEngines();
        addCandidateExecutionEngines.setExecutionEngineRegistry(execEngineRegistry);
       
        ProcessLocalDataSourceAnchors processLocalDataSourceAnchors = new ProcessLocalDataSourceAnchors();
        processLocalDataSourceAnchors.setExecutionEngineRegistry(execEngineRegistry);
       
        PropagateExecutionEngineAllocations propagateExecutionEngineAllocations = new PropagateExecutionEngineAllocations();
       
        localOptimisers.add(addCandidateExecutionEngines);
        localOptimisers.add(processLocalDataSourceAnchors);
        localOptimisers.add(propagateExecutionEngineAllocations);
       
        localOptimiser.setOptimisers(localOptimisers);
       
        Graph local = localOptimiser.optimise(graph);
        Map<String, List<String>> expectedNodesAndExecutionEngines =
            new HashMap<String, List<String>>();
        expectedNodesAndExecutionEngines.put("admire.dataAccess.relational.DAS1", Arrays.asList("e1"));
        expectedNodesAndExecutionEngines.put("admire.dataAccess.relational.DAS2", Arrays.asList("e2"));
        expectedNodesAndExecutionEngines.put("uk.org.ogsadai.TupleSelect", Arrays.asList("e2"));
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.