Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.ProcessingElementNode

38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
    {
        for (RequestNode node : graph.getNodes())
        {
            if (node instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode = (ProcessingElementNode) node;
                ProcessingElementDescriptor descriptor =
                    peNode.getProcessingElementDescriptor();
               
                if (descriptor == null)
                {
                    throw new TransformationException(
                        "No processing element descriptor for PE : " +
                        peNode.getName());
                }
               
                for( ProcessingElementInputDescriptor inputDesc :
                     descriptor.getInputs())
                {
                    if (inputDesc.getIsDataSourceInput())
                    {
                        // We have an anchor (that keeps the soul)
                       
                        // It is connected to a literal?
                        Connection conn =
                            peNode.getInput(inputDesc.getName(), 0);
                       
                        RequestNode source = conn.getSource();
                        if (source instanceof LiteralValuesNode)
                        {
                            List<Object> values =
View Full Code Here
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
    }
   
    @Test
    public void testTuple() throws Exception
    {
        ProcessingElementNode a = new ProcessingElementNode("A");
        ProcessingElementNode b = new ProcessingElementNode("B");
        ProcessingElementInputDescriptor inp = new ProcessingElementInputDescriptor("input");
        TupleSType t = new TupleSType();
        t.addElement("el1", new PrimitiveSType("String"));
        t.addElement("el2", new PrimitiveSType("Integer"));
        inp.setSType(t);
        ProcessingElementDescriptor desc =
            new SimpleProcessingElementDescriptor(
                    Arrays.asList(inp),
                    Collections.<ProcessingElementOutputDescriptor>emptyList(),
                    null);
        a.setDescriptor(desc);
        ProcessingElementOutputDescriptor outp = new ProcessingElementOutputDescriptor("output");
        t = new TupleSType();
        t.setRest(true);
        outp.setSType(t);
        desc = new SimpleProcessingElementDescriptor(
                    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());
View Full Code Here
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
    }

    @Test
    public void testTupleIncompatible() throws Exception
    {
        ProcessingElementNode a = new ProcessingElementNode("A");
        ProcessingElementNode b = new ProcessingElementNode("B");
        ProcessingElementInputDescriptor inp = new ProcessingElementInputDescriptor("input");
        TupleSType t = new TupleSType();
        t.addElement("a", new PrimitiveSType("String"));
        inp.setSType(t);
        ProcessingElementDescriptor desc =
            new SimpleProcessingElementDescriptor(
                    Arrays.asList(inp),
                    Collections.<ProcessingElementOutputDescriptor>emptyList(),
                    null);
        a.setDescriptor(desc);
        ProcessingElementOutputDescriptor outp = new ProcessingElementOutputDescriptor("output");
        t = new TupleSType();
        t.addElement("b", new PrimitiveSType("String"));
        outp.setSType(t);
        desc = new SimpleProcessingElementDescriptor(
                    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());
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
        // 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);
View Full Code Here
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
    }
   
    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);
        nodeB.connectInput("in2", 0, connection2);
        String dot = DotGenerator.generate(graph);
//        writeFile(dot);
        System.out.println(dot);
    }
View Full Code Here
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
        boolean foundQueryPE = false;
        for( RequestNode node : graph.getNodes())
        {
            if (node instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode = (ProcessingElementNode) node;
               
                if (peNode.getName().equals("uk.org.ogsadai.SQLQuery"))
                {
                    foundQueryPE = true;
                    assertEquals(
                        "Expected annotation",
                        "MyAnnotationValue",
                        peNode.getAnnotation("my.anno.key"));
                }
            }
        }
       
        assertTrue(
View Full Code Here
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
    }

    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);
View Full Code Here
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
    }

    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);
        nodeB.connectInput("in2", 0, connection2);
        String dot = DotGenerator.generate(graph);
//        writeFile(dot);
        System.out.println(dot);
    }
View Full Code Here
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
        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);
        nodeB.connectInput("in2", 0, connection2);
        String dot = DotGenerator.generate(graph);
//        writeFile(dot);
        System.out.println(dot);
    }
View Full Code Here
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
        int numQueryPE = 0;
        for( RequestNode node : graph.getNodes())
        {
            if (node instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode = (ProcessingElementNode) node;
               
                if (peNode.getName().equals("uk.org.ogsadai.SQLQuery"))
                {
                    numQueryPE++;
                    assertEquals(
                        "Expected annotation",
                        "MyAnnotationValue",
                        peNode.getAnnotation("my.anno.key"));
                }
            }
        }
       
        assertEquals(
View Full Code Here
TOP

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

  • eu.admire.dispel.engine.DispelEngineTest
  • eu.admire.dispel.graph.converter.GraphConverter
  • eu.admire.dispel.graph.visualisation.DotGenerator
  • eu.admire.dispel.parser.types.TypeUtils
  • eu.admire.dispel.parser.v4.builder.DISPELGraphBuilderTest
  • eu.admire.gateway.dmil.graph.CompositeProcessingElementTest
  • 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.PartitionedGraphToWorkflows
    • 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.