Package net.sf.parteg.base.testcasegraph.generated

Examples of net.sf.parteg.base.testcasegraph.generated.TCGRealNode

622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
  private void replaceFinalStatesWithConnectionPointsInRegion(
      TestCaseRegion in_oRegion) {
    for(TCGNode oNode : in_oRegion.getNodes()) {
      if(oNode instanceof TCGRealNode) {
        TCGRealNode oRealNode = (TCGRealNode)oNode;
        List<TCGTransition> colSuperTransitions =
          TCGTransitionHelperClass.getDefaultTriggeredOutgoingTransitions(oNode);
        TestCaseGraph oSubGraph = oRealNode.getSubGraph();
        if(oSubGraph != null) {
          // check all sub-regions
          // TODO parallel sub-regions!!!
          if(!oSubGraph.getRegions().isEmpty()) {
            TestCaseRegion oSubRegion = oSubGraph.getRegions().get(0);
            if(!colSuperTransitions.isEmpty()) {
              List<TCGNode> colEndNodes = TCGRegionHelperClass.findNodesWithOutOutgoingTransitions(oSubRegion);
              // create outgoing connection point
              TCGIntermediateNode oOutNode = GeneratedFactory.eINSTANCE.createTCGIntermediateNode();
              oOutNode.setOriginalNode(null);
              oOutNode.setUseAllTransitionsInParallel(true);
              oRealNode.getContainedConnectionPoints().add(oOutNode);
              oOutNode.setContainer(oRealNode);
              // create additional connection to outgoing node
              for(TCGNode oEndNode : colEndNodes) {
                try {
                  addTransition(oEndNode, oOutNode);
                } catch (Exception e) {
                  Configuration.handleException(e);
                }
              }
              // redirect outgoing transitions of super node without triggers
              for(TCGTransition oSuperTransition : colSuperTransitions) {
                oSuperTransition.setSourceNode(oOutNode);
                oRealNode.getOutgoingTransitions().remove(oSuperTransition);
              }
            }
            // recursion
            replaceFinalStatesWithConnectionPointsInRegion(oSubRegion);
          }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
    boolean bOneStateWasFlattened = true;
    while(bOneStateWasFlattened) {
      bOneStateWasFlattened = false;
      for(TCGNode oNode : in_oRegion.getNodes()) {
        if(oNode instanceof TCGRealNode) {
          TCGRealNode oRealNode = (TCGRealNode)oNode;
          if(!m_AlreadyFlattenedRealNodes.contains(oRealNode)) {
            if(flattenRealNode(oRealNode)) {
              m_AlreadyFlattenedRealNodes.add(oRealNode);
              colRealNodes.add(oRealNode);
              bOneStateWasFlattened = true;
View Full Code Here
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
   
    if(in_oNode instanceof TCGIntermediateNode) {
      TCGIntermediateNode oIntNode = (TCGIntermediateNode)in_oNode;
      if(oIntNode.getNodeType().equals(TCGNodeType.ENTRY)) {
        // determining the super state
        TCGRealNode oSuperNode = null;
        if(oIntNode.getContainer() instanceof TCGRealNode)
          oSuperNode = (TCGRealNode)oIntNode.getContainer();
        else if(oIntNode.getContainer() instanceof TestCaseRegion) {
          TestCaseRegion oRegion = (TestCaseRegion)oIntNode.getContainer();
          if(oRegion.getContainer() != null)
            oSuperNode = (TCGRealNode)oRegion.getContainer().getCompositeSuperState();
        }
        int nRealNodeCounter = searchForMinDistanceFromNode(
            oSuperNode, in_nCounter);
        return Math.max(in_nCounter, nRealNodeCounter);
      }
      // stop at exit nodes
      if(oIntNode.getNodeType().equals(TCGNodeType.EXIT)) {
        return in_nCounter + 1;
      }
    }
    // in_oNode could have changed value
    if(in_oNode instanceof TCGRealNode) {
      TCGRealNode oRealNode = (TCGRealNode)in_oNode;
      TestCaseGraph oSubGraph = oRealNode.getSubGraph();
      if(oSubGraph != null) {
        for(TestCaseRegion oRegion : oSubGraph.getRegions()) {
          int nRegionCounter = searchForMinDistanceInRegion(
              oRegion, in_nCounter);
          if(nRegionCounter > nMaxCounter)
            nMaxCounter = nRegionCounter;
        }
      }
       
      TestCaseGraph oRefSubGraph = oRealNode.getReferencedSubmachine();
      if(oRefSubGraph != null) {
        System.err.println("BasicDistanceSetter does not support referenced submachines");
      }
    }
   
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
        return in_nCounter + 1;
      }
    }
    // in_oNode could have changed value
    if(in_oNode instanceof TCGRealNode) {
      TCGRealNode oRealNode = (TCGRealNode)in_oNode;
      TestCaseGraph oSubGraph = oRealNode.getSubGraph();
      if(oSubGraph != null) {
        for(TestCaseRegion oRegion : oSubGraph.getRegions()) {
          int nRegionCounter = searchForMaxDistanceInRegion(
              oRegion, in_nCounter, in_colVisitedNodes);
          if(nRegionCounter > nMaxCounter)
            nMaxCounter = nRegionCounter;
        }
      }
       
      TestCaseGraph oRefSubGraph = oRealNode.getReferencedSubmachine();
      if(oRefSubGraph != null) {
        System.err.println("BasicDistanceSetter does not support referenced submachines");
      }
    }
   
View Full Code Here
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
          + in_oNode.getMaxDistanceFromStart()
          + ") for node >"
          + in_oNode.getName() + "<");
    }
    if(in_oNode instanceof TCGRealNode) {
      TCGRealNode oRealNode = (TCGRealNode)in_oNode;
      List<TCGNode> colNodes = new ArrayList<TCGNode>();
      colNodes.addAll(oRealNode.getContainedConnectionPoints());
      colNodes.addAll(oRealNode.getContainedConnectionPointReferences());
      for(TCGNode oNode : colNodes) {
        checkNode(oNode);
      }
      if(oRealNode.getSubGraph() != null)
        checkTCG(oRealNode.getSubGraph());
      if(oRealNode.getReferencedSubmachine() != null)
        checkTCG(oRealNode.getReferencedSubmachine());
    }
  }
View Full Code Here
24
25
26
27
28
29
30
31
32
33
34
35
  public static List<TCGIntermediateNode> getInitialNodesOfState(TCGNode in_oCompositeNode) {
    List<TCGIntermediateNode> colIntNodes = new ArrayList<TCGIntermediateNode>();
   
    if(in_oCompositeNode instanceof TCGRealNode) {
      TCGRealNode oRealNode = (TCGRealNode)in_oCompositeNode;
      TestCaseGraph oSubGraph = oRealNode.getSubGraph();
      if(oSubGraph != null) {
        for(TestCaseRegion oRegion : oSubGraph.getRegions()) {
          for(TCGNode oNode : oRegion.getNodes()) {
            if(oNode instanceof TCGIntermediateNode) {
              TCGIntermediateNode oIntMedNode = (TCGIntermediateNode)oNode;
View Full Code Here
92
93
94
95
96
97
98
99
100
101
102
103
  // returns all transitions that are leading to this node (also via connection points, ...)
  public static List<TCGTransition> getAllIncomingTransitionsPlusCPR(TCGNode in_oNode)
  {
    List<TCGTransition> colRetValues = getIncomingTransitions(in_oNode);
    if(in_oNode instanceof TCGRealNode) {
      TCGRealNode oRealNode = (TCGRealNode)in_oNode;
      for(TCGIntermediateNode oConnectionPoint : oRealNode.getContainedConnectionPoints()) {
        if(oConnectionPoint.getNodeType().equals(TCGNodeType.ENTRY))
          colRetValues.addAll(oConnectionPoint.getIncomingTransitions());
      }
    }   
   
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
  // returns all transitions that are leaving from this node (also via connection points, ...)
  public static List<TCGTransition> getAllOutgoingTransitionsPlusCPR(TCGNode in_oNode)
  {
    List<TCGTransition> colRetValues = getOutgoingTransitions(in_oNode);
    if(in_oNode instanceof TCGRealNode) {
      TCGRealNode oRealNode = (TCGRealNode)in_oNode;
      for(TCGIntermediateNode oConnectionPoint : oRealNode.getContainedConnectionPoints()) {
        if(oConnectionPoint.getNodeType().equals(TCGNodeType.EXIT))
          colRetValues.addAll(oConnectionPoint.getIncomingTransitions());
      }
    }   
   
View Full Code Here
126
127
128
129
130
131
132
133
134
135
136
137
138
        ((TCGIntermediateNode)in_oNode).getNodeType().equals(TCGNodeType.INITIAL)) {
      List<TCGTransition> colRetValues = new ArrayList<TCGTransition>();
      TCGIntermediateNode oNode = (TCGIntermediateNode)in_oNode;
      if(oNode.getNodeType().equals(TCGNodeType.INITIAL)) {
       
        TCGRealNode oSuperNode = getSuperState(oNode);
        if(oSuperNode != null) {
          colRetValues.addAll(oSuperNode.getIncomingTransitions());
        }
        else if(in_oNode instanceof TCGIntermediateNode) {
          for(TCGIntermediateNode oIntNode : ((TCGIntermediateNode)in_oNode).getReferencedConnectionPointReferences()) {
            colRetValues.addAll(oIntNode.getIncomingTransitions());
          }
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
    colRetValues.addAll(in_oNode.getOutgoingTransitions());
   
    // add transitions of super states if they are triggered by a real event
    // if they are default-triggered then just add if node has no outgoing transitions
    if(in_oNode instanceof TCGRealNode) {
      TCGRealNode oNode = (TCGRealNode)in_oNode;
      boolean bNodeHasNoOutgoingTransitions = in_oNode.getOutgoingTransitions().isEmpty();
     
      // all super states (hierarchical)
      for(TCGRealNode oSuperNode : getSuperStates(oNode)) {
        for(TCGTransition oTransition : oSuperNode.getOutgoingTransitions()) {
View Full Code Here
TOP

Related Classes of net.sf.parteg.base.testcasegraph.generated.TCGRealNode

  • net.amin.mobateg.ampl.SmToAMPLModel
  • net.amin.mobateg.ampl.visitor.ModelVisitor
  • net.amin.mobateg.helper.ampl.PathToAMPLData
  • net.amin.mobateg.helper.generatennittest.GenerateJUnitTest
  • net.sf.parteg.base.testcasegraph.generated.impl.TestCaseGraphImpl
  • net.sf.parteg.base.testcasegraph.helperclasses.BasicDistanceSetter
  • net.sf.parteg.base.testcasegraph.helperclasses.DecisionNodeSplitter
  • net.sf.parteg.base.testcasegraph.helperclasses.TCGNodeHelperClass
  • net.sf.parteg.base.testcasegraph.helperclasses.TCGRegionHelperClass
  • net.sf.parteg.base.testcasegraph.helperclasses.TCGTransitionHelperClass
    • 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.