Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.Graph

162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
        System.out.println(dot);
    }

    public void testSameNameInputs() throws Exception
    {
        Graph graph = new Graph();
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        graph.add(nodeA);
        ProcessingElementNode nodeB = new ProcessingElementNode("uk.org.ogsadai.TupleToWebRowSetCharArrays");
        graph.add(nodeB);
        ProcessingElementNode nodeC = new ProcessingElementNode("uk.org.ogsadai.DeliverToRequestStatus");
        graph.add(nodeC);
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection connection2 = new TeeConnection();
        nodeB.connectOutput("data", 0, connection2);
View Full Code Here
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
        System.out.println(dot);
    }

    public void testLiteral() throws Exception
    {
        Graph graph = new Graph();
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        graph.add(nodeA);
        LiteralValuesNode nodeB = new LiteralValuesNode(1, 2, 3);
        graph.add(nodeB);
        LiteralValuesNode nodeC = new LiteralValuesNode(
                ListMarker.BEGIN,
                "this is a string that is too long",
                "another very long string that doesn't fit",
                "and a \\\"string\\\" with quotes",
                ListMarker.END,
                ListMarker.BEGIN,
                new Repeater(null, Arrays.asList(ListMarker.BEGIN, "X", "Y", 2, ListMarker.END)),
                ListMarker.END);
        graph.add(nodeC);
        nodeA.connectInput("in1", 0, nodeB.getOutput());
        nodeA.connectInput("in2", 0, nodeC.getOutput());
        String dot = DotGenerator.generate(graph);
//        writeFile(dot);
        System.out.println(dot);
View Full Code Here
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
        System.out.println(dot);
    }

    public void testComposite() throws Exception
    {
        Graph graph = new Graph();
        LiteralValuesNode nodeL = new LiteralValuesNode("VALUE");
        graph.add(nodeL);
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        nodeA.connectInput("expression", 0, nodeL.getOutput());
        ProcessingElementNode nodeB = new ProcessingElementNode("uk.org.ogsadai.TupleToWebRowSetCharArrays");
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection out = new TeeConnection();
        nodeB.connectOutput("out2", 0, out);
        CompositeProcessingElement nodeC = new CompositeProcessingElement(
                "Composite",
                Arrays.<RequestNode>asList(nodeA, nodeB));
        Map<String, Map<Integer, Connection>> inputs = new HashMap<String, Map<Integer, Connection>>();
        nodeC.setInputs(inputs);
        Map<String, Map<Integer, Connection>> outputs = new HashMap<String, Map<Integer, Connection>>();
        Map<Integer, Connection> map = new HashMap<Integer, Connection>();
        map.put(0, out);
        outputs.put("out2", map);
        nodeC.setOutputs(outputs);
        graph.add(nodeC);
        ProcessingElementNode nodeD = new ProcessingElementNode("uk.org.ogsadai.DeliverToRequestStatus");
        graph.add(nodeD);
        nodeD.connectInput("data", 0, out);
        String dot = DotGenerator.generate(graph);
//        writeFile(dot);
        System.out.println(dot);
    }
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
184
185
186
        DispelEngineResult result = engine.processDispel(dispel);
       
        Collection<Graph> graphs = result.getExecutionGraphs();
        assertEquals("Expect a single execution graph", 1, graphs.size());
       
        Graph graph = graphs.iterator().next();
       
        boolean foundQueryPE = false;
        for( RequestNode node : graph.getNodes())
        {
            if (node instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode = (ProcessingElementNode) node;
               
View Full Code Here
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
        System.out.println(dot);
    }
   
    public void testUnconnectedComposite() throws Exception
    {
        Graph graph = new Graph();
        LiteralValuesNode nodeL = new LiteralValuesNode("VALUE");
        graph.add(nodeL);
        ProcessingElementNode nodeA = new ProcessingElementNode("uk.org.ogsadai.SQLQuery");
        nodeA.connectInput("expression", 0, nodeL.getOutput());
        ProcessingElementNode nodeB = new ProcessingElementNode("uk.org.ogsadai.TupleToWebRowSetCharArrays");
        Connection connection = new TeeConnection();
        nodeA.connectOutput("out1", 0, connection);
        nodeB.connectInput("in1", 0, connection);
        Connection out = new TeeConnection();
        nodeB.connectOutput("out2", 0, out);
        CompositeProcessingElement nodeC = new CompositeProcessingElement(
                "Composite",
                Arrays.<RequestNode>asList(nodeA, nodeB));
        Map<String, Map<Integer, Connection>> inputs = new HashMap<String, Map<Integer, Connection>>();
        nodeC.setInputs(inputs);
        Map<String, Map<Integer, Connection>> outputs = new HashMap<String, Map<Integer, Connection>>();
        Map<Integer, Connection> map = new HashMap<Integer, Connection>();
        map.put(0, out);
        outputs.put("out2", map);
        nodeC.setOutputs(outputs);
        graph.add(nodeC);
        String dot = DotGenerator.generate(graph);
//        writeFile(dot);
        System.out.println(dot);
    }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
       
        // A -> B -> C ---v
        //      | -> D -> E
        //      
       
        Graph graph = new Graph();
        ProcessingElementNode a = new ProcessingElementNode("A");
        ProcessingElementNode b = new ProcessingElementNode("B");
        b.connectInput("in", 0, a.getOutput("out", 0));
        ProcessingElementNode c = new ProcessingElementNode("C");
        c.connectInput("in", 0, b.getOutput("out", 0));
        ProcessingElementNode d = new ProcessingElementNode("D");
        d.connectInput("in", 0, b.getOutput("out", 0));
        ProcessingElementNode e = new ProcessingElementNode("E");
        e.connectInput("in", 0, c.getOutput("out", 0));
        e.connectInput("in", 1, d.getOutput("out", 0));
       
        graph.add(a);
        graph.add(b);
        graph.add(c);
        graph.add(d);
        graph.add(e);
        
        Graph transformed = insert.transform(context, graph);
       
        System.out.println(transformed);
       
        List<RequestNode> nodes = transformed.getNodes();

        // 5 PE + 5 Observers + 1 Gatherer
        TestCase.assertEquals(11, nodes.size());
       
        //Gatherer should have 1 input with 5 indexes
View Full Code Here
216
217
218
219
220
221
222
223
224
225
226
227
228
229
        DispelEngineResult result = engine.processDispel(dispel);
       
        Collection<Graph> graphs = result.getExecutionGraphs();
        assertEquals("Expect a single execution graph", 1, graphs.size());
       
        Graph graph = graphs.iterator().next();
       
        int numQueryPE = 0;
        for( RequestNode node : graph.getNodes())
        {
            if (node instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode = (ProcessingElementNode) node;
               
View Full Code Here
279
280
281
282
283
284
285
286
287
288
        DISPELGraphBuilder builder =
            new DISPELGraphBuilder(registry, new SimpleDispelOptimiser());
        compiler.setRequestBuilder(builder);
        compiler.parse(new FileReader(DISPEL_PATH + "FunctionCreatingPE.dispel"));
        assertTrue(!builder.getSubmittedGraphs().isEmpty());
        Graph graph = builder.getSubmittedGraphs().iterator().next();
        String dot = DotGenerator.generate(graph);
        System.out.println(dot);
//        writeFile(dot);
    }
View Full Code Here
287
288
289
290
291
292
293
294
295
296
297
298
        Collection<Graph> graphs = result.getExecutionGraphs();
        assertEquals("Expect a single execution graph", 1, graphs.size());

        // Find SQL query node
        boolean haveSQLQueryNode = false;
        Graph graph = graphs.iterator().next();
        for( RequestNode node : graph.getNodes())
        {
            if (node instanceof ProcessingElementNode)
            {
                if (node.getName().equals("uk.org.ogsadai.SQLQuery"))
                {
View Full Code Here
912
913
914
915
916
917
918
919
        assertEquals("Expect a single execution graph", 1, graphs.size());

        Set<String> expectedNodes = new HashSet<String>();
        expectedNodes.add("uk.org.ogsadai.Echo");
        expectedNodes.add("eu.admire.Results");
        Graph graph = graphs.iterator().next();
        assertNodes(expectedNodes, graph);
    }
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.