Package eu.admire.dispel.graph

Examples of eu.admire.dispel.graph.ProcessingElementNode

308
309
310
311
312
313
314
315
316
317
318
319
320
321
        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
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
        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
437
438
439
440
441
442
443
444
445
446
447
448
449
450
        literal1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal1.add(new Repeater(5, "X"));
        LiteralValuesNode literal2 = new LiteralValuesNode();
        literal2.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal2.add(new Repeater(3, Arrays.asList(ListMarker.BEGIN, "Y", ListMarker.END)));
        ProcessingElementNode node1 = new ProcessingElementNode("1");
        node1.addAnnotation(AnnotationKeys.LOCATION, mLocation);
        literal1.connectOutput("output", 0, node1.getInput("input1", 0));
        literal2.connectOutput("output", 0, node1.getInput("input2", 0));
        Graph graph = new Graph();
        graph.add(literal1);
        graph.add(literal2);
        graph.add(node1);
        ExchangeFactory factory = new TestExchangeFactory();
View Full Code Here
478
479
480
481
482
483
484
485
486
487
488
489
490
        literal.add(ListMarker.BEGIN);
        literal.add(10);
        literal.add(20);
        literal.add(ListMarker.END);
        literal.setOutputDescriptor(AnySType.INSTANCE, 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
509
510
511
512
513
514
515
516
517
518
519
520
521
        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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
                for (RequestNodeInput target : output.getTargets())
                {
                    RequestNode targetNode = target.getRequestNode();
                    if (targetNode instanceof ProcessingElementNode)
                    {
                        ProcessingElementNode peNode = (ProcessingElementNode)targetNode;
                        String dataSourceName = (String)peNode.getAnnotation(AnnotationKeys.DATA_SOURCE_ANCHOR);
                        if (dataSourceName != null)
                        {
                            if (peNode.getProcessingElementDescriptor().getInput(target.getName()).getIsDataSourceInput())
                            {
                                String executionEngine = (String)peNode.getAnnotation(AnnotationKeys.EXECUTION_ENGINE);
                                String localDataSource;
                                try
                                {
                                    localDataSource = mExecutionEngineRegistry.getLocalDataSourceName(executionEngine, dataSourceName);
                                }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
            {
                return proc.getImplementation().createUnconnectedCopy();
            }
            else
            {
                ProcessingElementNode result =
                    new ProcessingElementNode(type.getName());
                result.setDescriptor(proc.getDescriptor());
                return result;
            }
        }
        else if (type instanceof ConnectionType)
        {
View Full Code Here
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
    {
        String name = node.getName();
       
        if (node instanceof ProcessingElementNode)
        {
            ProcessingElementNode pen = (ProcessingElementNode) node;
            Set<String> candidatePEs = pen.getCandidatePEs();
            if (candidatePEs != null && candidatePEs.size() == 1)
            {
                name = pen.getChosenPE();
            }
        }
       
        return name;
    }
View Full Code Here
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
       
        for( RequestNode graphNode : graph.getNodes())
        {
            if (graphNode instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode =
                    (ProcessingElementNode) graphNode;

                if (peNode.getName().equals(expectedNodeName))
                {
                    assertEquals(
                        "Node " + expectedNodeName + " should have single PE",
                        1, peNode.getCandidatePEs().size());
                   
                    assertEquals(
                        "Node " + expectedNodeName + " PE name",
                        expectedPEName,
                        peNode.getCandidatePEs().iterator().next());
                   
                    assertEquals(
                        "Node " + expectedNodeName +
                            " should have single gateway",
                        1,
                        peNode.getCandidateGateways().get(
                            expectedPEName).size());

                    assertEquals(
                        "Node " + expectedNodeName + "  gateway name",
                        expectedGatewayName,
                        peNode.getCandidateGateways().get(
                            expectedPEName).iterator().next());

                    found = true;
                    break;
                }
View Full Code Here
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
       
        for( RequestNode graphNode : graph.getNodes())
        {
            if (graphNode instanceof ProcessingElementNode)
            {
                ProcessingElementNode peNode =
                    (ProcessingElementNode) graphNode;

                if (peNode.getName().equals(expectedNodeName))
                {
                    assertEquals(
                        "Node " + expectedNodeName + " should have single PE",
                        1, peNode.getCandidatePEs().size());
                   
                    boolean expectedPEFound = false;
                    for( String peName : expectedPENames)
                    {
                        if (peNode.getCandidatePEs().contains(peName))
                        {
                            expectedPEFound = true;
                            break;
                        }
                    }
                   
                    assertTrue(
                        "Node " + expectedNodeName +
                            ": expected PE on of : " + expectedPENames +
                            " actual: " + peNode.getCandidatePEs(),
                        expectedPEFound);

                    found = true;
                    break;
                }
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.