Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.Graph

407
408
409
410
411
412
413
414
415
416
417
418
        DISPELGraphBuilder builder =
            runDISPEL("use a.A; A a = new A; " +
                    "|- [ ] -|:[<Integer i; String s>] => a.b; " +
                    "submit a;");
        assertNull(mError);
        Graph graph = builder.getSubmittedGraphs().iterator().next();
        for (RequestNode requestNode : graph.getNodes())
        {
            if (requestNode instanceof LiteralValuesNode)
            {
                LiteralValuesNode literal = (LiteralValuesNode)requestNode;
                ProcessingElementOutputDescriptor outputDesc =
View Full Code Here
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
                "for (Integer i=0; i<4; i++)" +
                "   { A a = new A; |- i -| => a.input; a.output => b.input[i]; } " +
                "submit b;");
        assertNull(mError);
        assertEquals(1, builder.getSubmittedGraphs().size());
        Graph graph = builder.getSubmittedGraphs().iterator().next();
        List<Long> values = new ArrayList<Long>(Arrays.asList(0l,1l,2l,3l));
        int numAs = 0;
        boolean foundB = false;
        for (RequestNode node : graph.getNodes())
        {
            if (node instanceof LiteralValuesNode)
            {
                assertTrue(values.remove(((LiteralValuesNode) node).getValues().get(0)));
            }
View Full Code Here
740
741
742
743
744
745
746
747
748
749
750
751
752
            runDISPEL("use a.A; use b.B; " +
                "void f() {A a = new A; B b = new B; a.out => b.in; submit a;}" +
                "f();");
        assertNull(mError);
        assertTrue(!builder.getSubmittedGraphs().isEmpty());
        Graph graph = builder.getSubmittedGraphs().iterator().next();
        assertEquals(2, graph.getNodes().size());
        List<String> names = Arrays.asList("a.A", "b.B");
        for (RequestNode node : graph.getNodes())
        {
            assertTrue(names.contains(node.getName()));
        }
    }
View Full Code Here
22
23
24
25
26
27
28
29
30
31
    public void testTwoConnectedProcessingElements()
    {
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        ProcessingElementNode b = new ProcessingElementNode("eu.admire.B");
        a.connectOutput("out", 0, b.getInput("in", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
    public void testSimpleSequenceLiteral()
    {
        LiteralValuesNode literal = new LiteralValuesNode("x", "y", "<a href=\".\"/>", 1, 2);
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        a.connectInput("in", 0, literal.getOutput());
        Graph graph = new Graph();
        graph.add(a);
        graph.add(literal);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
47
48
49
50
51
52
53
54
55
56
            new LiteralValuesNode(
                    ListMarker.BEGIN, "x", "y", ListMarker.END,
                    ListMarker.BEGIN, 1, 2, ListMarker.END);
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        a.connectInput("in", 0, literal.getOutput());
        Graph graph = new Graph();
        graph.add(a);
        graph.add(literal);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
                    ListMarker.BEGIN, 0, 1, 2.3, ListMarker.END,
                    ListMarker.END
                    );
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        a.connectInput("in", 0, literal.getOutput());
        Graph graph = new Graph();
        graph.add(a);
        graph.add(literal);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
79
80
81
82
83
84
85
86
87
88
    {
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        ProcessingElementNode b = new ProcessingElementNode("eu.admire.B");
        a.connectOutput("out", 0, b.getInput("left", 0));
        a.connectOutput("out", 1, b.getInput("right", 0));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
92
93
94
95
96
97
98
99
100
101
    {
        ProcessingElementNode a = new ProcessingElementNode("eu.admire.A");
        ProcessingElementNode b = new ProcessingElementNode("eu.admire.B");
        a.connectOutput("left", 0, b.getInput("in", 0));
        a.connectOutput("right", 0, b.getInput("in", 1));
        Graph graph = new Graph();
        graph.add(a);
        graph.add(b);
//        System.out.println(GraphConverter.convertToDISPEL(graph));
    }
View Full Code Here
104
105
106
107
108
109
110
111
112
    {
        CompositeProcessingElement c = new CompositeProcessingElement("X");
        ProcessingElementNode a = c.add("eu.admire.A");
        ProcessingElementNode b = c.add("eu.admire.B");
        a.connectOutput("out", 0, b.getInput("in", 0));
        Graph graph = new Graph();
        graph.add(c);
//        System.out.println(GraphConverter.convertToDISPEL(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.