Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.LiteralValuesNode

210
211
212
213
214
215
216
217
218
219
220
221
222
223
    }

    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();
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
253
254
255
    }
   
    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();
View Full Code Here
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
        assertEquals(1, activities.size());
    }
   
    public void testLiteralTupleTypeWithRest() throws Exception
    {
        LiteralValuesNode literal = new LiteralValuesNode();
        literal.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.add(ListMarker.END);
        Map<String, Object> tuple = new HashMap<String, Object>();
        tuple.put("a", 10);
        tuple.put("b", "test");
        literal.add(tuple);
        literal.add(ListMarker.END);
        TupleSType stype = new TupleSType();
        stype.setRest(true);
        literal.setOutputDescriptor(new ListSType(stype), null);
        ProcessingElementNode node2 = new ProcessingElementNode("2");
        node2.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.connectOutput("output", 0, node2.getInput("input", 0));
        Graph graph = new Graph();
        graph.add(literal);
        graph.add(node2);
        ExchangeFactory factory = new TestExchangeFactory();
        ProcessingElementMapper mapper = new SimpleProcessingElementMapper();
View Full Code Here
164
165
166
167
168
169
170
171
172
173
174
175
176
    {
        for (RequestNode node : nodes)
        {
            if (node instanceof LiteralValuesNode)
            {
                LiteralValuesNode literal = (LiteralValuesNode)node;
                List<Object> values = literal.getValues();
                Connection output = literal.getOutput();
                for (RequestNodeInput target : output.getTargets())
                {
                    RequestNode targetNode = target.getRequestNode();
                    if (targetNode instanceof ProcessingElementNode)
                    {
View Full Code Here
442
443
444
445
446
447
448
449
450
451
452
453
454
455
    {
        for (RequestNode node : nodes)
        {
            if (node instanceof LiteralValuesNode)
            {
                LiteralValuesNode literal = (LiteralValuesNode)node;
                if (InfiniteRepeat.isInfiniteRepeater(literal.getValues()))
                {
                    for (RequestNodeInput target : literal.getOutput().getTargets())
                    {
                        InfiniteRepeat.addControlledRepeater(literal, target, mPEs, mWorkflows);
                    }
                }
            }
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
        assertEquals(1, toWF.getResultSources().size());
    }
       
    public void testLiteralTupleInput() throws Exception
    {
        LiteralValuesNode literal = new LiteralValuesNode();
        literal.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.add(ListMarker.BEGIN);
        Map<String, Object> tuple = new HashMap<String, Object>();
        tuple.put("a", 10);
        tuple.put("b", "test");
        literal.add(tuple);
        literal.add(ListMarker.END);
        TupleSType stype = new TupleSType();
        stype.addElement("a", new PrimitiveSType("Integer"));
        stype.addElement("b", new PrimitiveSType("String"));
        literal.setOutputDescriptor(new ListSType(stype), null);
        ProcessingElementNode node2 = new ProcessingElementNode("2");
        node2.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.connectOutput("output", 0, node2.getInput("input", 0));
        Graph graph = new Graph();
        graph.add(literal);
        graph.add(node2);
        ExchangeFactory factory = new TestExchangeFactory();
        ProcessingElementMapper mapper = new SimpleProcessingElementMapper();
View Full Code Here
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
        assertEquals(2, activities.size());
    }
   
    public void testRepeatEnough() throws Exception
    {
        LiteralValuesNode literal = new LiteralValuesNode();
        literal.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.add(new Repeater(null, "X"));
        ProcessingElementNode node1 = new ProcessingElementNode("1");
        node1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.connectOutput("output", 0, node1.getInput("input", 0));
        ProcessingElementNode node2 = new ProcessingElementNode("2");
        node2.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        node2.connectOutput("output", 0, node1.getInput("control", 0));
        Graph graph = new Graph();
        graph.add(literal);
View Full Code Here
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
        }
    }
   
    public void testRepeatEnoughWithTee() throws Exception
    {
        LiteralValuesNode literal = new LiteralValuesNode();
        literal.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.add(new Repeater(null, "X"));
        ProcessingElementNode node1 = new ProcessingElementNode("1");
        node1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.connectOutput("output", 0, node1.getInput("input", 0));
        ProcessingElementNode node2 = new ProcessingElementNode("2");
        node2.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        node2.connectOutput("output", 0, node1.getInput("control", 0));
        ProcessingElementNode node3 = new ProcessingElementNode("3");
        node3.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        node3.connectInput("input", 0, literal.getOutput());
        ProcessingElementNode node4 = new ProcessingElementNode("4");
        node4.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        node4.connectOutput("output", 0, node3.getInput("control", 0));
        Graph graph = new Graph();
        graph.add(literal);
View Full Code Here
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
        }
    }
   
    public void testRepeatEnoughWithLiteralControl() throws Exception
    {
        LiteralValuesNode literal = new LiteralValuesNode();
        literal.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.add(new Repeater(null, "X"));
        LiteralValuesNode control = new LiteralValuesNode();
        control.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        control.add("Y");
        control.add("Z");
        ProcessingElementNode node1 = new ProcessingElementNode("1");
        node1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal.connectOutput("output", 0, node1.getInput("input", 0));
        control.connectOutput("output", 0, node1.getInput("control", 0));
        Graph graph = new Graph();
        graph.add(literal);
        graph.add(node1);
        graph.add(control);
        ExchangeFactory factory = new TestExchangeFactory();
View Full Code Here
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
        }
    }
   
    public void testDoubleRepeatEnough() throws Exception
    {
        LiteralValuesNode repeat1 = new LiteralValuesNode();
        repeat1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        repeat1.add(new Repeater(null, "X"));
        LiteralValuesNode repeat2 = new LiteralValuesNode();
        repeat2.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        repeat2.add(new Repeater(null, "Y"));
        LiteralValuesNode control = new LiteralValuesNode();
        control.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        control.add("1");
        control.add("2");
        ProcessingElementNode node1 = new ProcessingElementNode("1");
        node1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        repeat1.connectOutput("output", 0, node1.getInput("input1", 0));
        repeat2.connectOutput("output", 0, node1.getInput("input2", 0));
        control.connectOutput("output", 0, node1.getInput("control", 0));
        Graph graph = new Graph();
        graph.add(repeat1);
        graph.add(repeat2);
        graph.add(control);
        graph.add(node1);
View Full Code Here
TOP

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

  • eu.admire.dispel.parser.v4.builder.ConnectionStrategy
  • eu.admire.dispel.parser.v4.builder.DISPELGraphBuilderTest
  • eu.admire.gateway.dmil.graph.converter.GraphConverterTest
  • eu.admire.gateway.dmil.graph.visualisation.DotGeneratorTest
  • eu.admire.gateway.engine.ogsadai.InfiniteRepeat
  • eu.admire.gateway.engine.ogsadai.PartitionedGraphToWorkflows
  • eu.admire.gateway.engine.ogsadai.PartitionedGraphToWorkflowsTest
  • eu.admire.gateway.types.SimpleDTypeConverter
  • eu.admire.gateway.types.SimpleTupleTypeConverter
  • eu.admire.gateway.types.TypeValidator
    • 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.