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

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

588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
          if(!oSubGraph.getRegions().isEmpty()) {
            TestCaseRegion oSubRegion = oSubGraph.getRegions().get(0);
            List<TCGIntermediateNode> colInitialNodes = TCGRegionHelperClass.findInitialNodes(oSubRegion);
            if(!colInitialNodes.isEmpty()) {
              // each region is allowed to have at most one initial node
              TCGIntermediateNode oInitialNode = colInitialNodes.get(0);
              // convert initial node into connection point
              oInitialNode.setNodeType(TCGNodeType.ENTRY);
              oInitialNode.setContainer(oRealNode);
              oRealNode.getContainedConnectionPoints().add(oInitialNode);
              oInitialNode.setOriginalNode(null);
              oInitialNode.setUseAllTransitionsInParallel(true);
              // outgoing transitions are the same ...
              // change all incoming transitions of the composite state
              for(TCGTransition oTransition : oRealNode.getIncomingTransitions()) {
                oTransition.setTargetNode(oInitialNode);
                oInitialNode.getIncomingTransitions().add(oTransition);
              }
              oRealNode.getIncomingTransitions().clear();
            }
            // recursion
            replaceInitialNodesWithConnectionPointsInRegion(oSubRegion);
View Full Code Here
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
          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) {
View Full Code Here
175
176
177
178
179
180
181
182
183
  }
 
  private void removeAllConnectionPoints(TCGRealNode in_oRealNode) throws Exception
  {
    while(!in_oRealNode.getContainedConnectionPoints().isEmpty()) {
      TCGIntermediateNode oNode = in_oRealNode.getContainedConnectionPoints().get(0);
      m_oTCGHelper.removeIntermediateNode(oNode);
    }
  }
View Full Code Here
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
   
    int nMaxCounter = 0;
    in_oNode.setMinDistanceFromStart(in_nCounter);
   
    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) {
View Full Code Here
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
    int nMaxCounter = 0;
    in_oNode.setMaxDistanceFromStart(in_nCounter);
    in_colVisitedNodes.add(in_oNode);
   
    if(in_oNode instanceof TCGIntermediateNode) {
      TCGIntermediateNode oIntNode = (TCGIntermediateNode)in_oNode;
      if(oIntNode.getNodeType().equals(TCGNodeType.ENTRY)) {
        int nRealNodeCounter = searchForMaxDistanceFromNode(
            (TCGRealNode)oIntNode.getContainer(), in_nCounter,
            in_colVisitedNodes);
        in_colVisitedNodes.remove(in_oNode);
        return Math.max(in_nCounter, nRealNodeCounter);
      }
      // stop at exit nodes
      if(oIntNode.getNodeType().equals(TCGNodeType.EXIT)) {
        in_colVisitedNodes.remove(in_oNode);
        return in_nCounter + 1;
      }
    }
    // in_oNode could have changed value
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
      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;
              if(oIntMedNode.getNodeType().equals(TCGNodeType.INITIAL)) {
                colIntNodes.add(oIntMedNode);
              }
            }
          }
        }
View Full Code Here
123
124
125
126
127
128
129
130
131
132
133
134
  public static List<TCGTransition> getIncomingTransitions(TCGNode in_oNode)
  {
    if(in_oNode instanceof TCGIntermediateNode &&
        ((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());
        }
View Full Code Here
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
  public static TestCaseGraph getContainingTestGraph(TCGNode in_oNode) {
    if(in_oNode instanceof TCGRealNode) {
      return ((TCGRealNode)in_oNode).getContainer().getContainer();
    }
    else {
      TCGIntermediateNode oNode = (TCGIntermediateNode)in_oNode;
      if(oNode == null) {
      }
      if(oNode.getContainer() instanceof TestCaseGraph) {
        return ((TestCaseGraph)oNode.getContainer());
      }
      else if(oNode.getContainer() instanceof TestCaseRegion) {
        return ((TestCaseRegion)oNode.getContainer()).getContainer();
      }
      else if(oNode.getContainer() instanceof TCGRealNode) {
        return ((TCGRealNode)oNode.getContainer()).getContainer().getContainer();
      }
    }
    return null;
  }
View Full Code Here
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
  public static TestCaseRegion getContainingRegion(TCGNode in_oNode) {
    if(in_oNode instanceof TCGRealNode) {
      return ((TCGRealNode)in_oNode).getContainer();
    }
    else {
      TCGIntermediateNode oNode = (TCGIntermediateNode)in_oNode;
      if(oNode == null) {
      }
      if(oNode.getContainer() instanceof TestCaseGraph) {
        TCGRealNode oRetNode = ((TestCaseGraph)oNode.getContainer()).getCompositeSuperState();
        if(oRetNode != null)
          return oRetNode.getContainer();
      }
      else if(oNode.getContainer() instanceof TestCaseRegion) {
        return ((TestCaseRegion)oNode.getContainer());
      }
      else if(oNode.getContainer() instanceof TCGRealNode) {
        return ((TCGRealNode)oNode.getContainer()).getContainer();
      }
    }
    return null;
   
  }
View Full Code Here
377
378
379
380
381
382
383
384
385
386
387
388
389
390
  public static boolean isTopmostInitialNode(TCGNode in_oNode)
  {
    boolean bIsSuperInitialNode = false;
    if(in_oNode instanceof TCGIntermediateNode) {
      TCGIntermediateNode oInterNode = (TCGIntermediateNode)in_oNode;
      TestCaseGraph oTCG = TCGNodeHelperClass.getContainingTestGraph(oInterNode);
      if(oTCG != null) {
        if(oInterNode.getNodeType().equals(TCGNodeType.INITIAL) &&
            oTCG.getCompositeSuperState() == null)
          bIsSuperInitialNode = true;
      }
    }
    return bIsSuperInitialNode;
View Full Code Here
TOP

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

  • 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
  • net.sf.parteg.base.testcasegraph.helperclasses.TestCaseGraphFlattener
  • net.sf.parteg.base.testcasegraph.ocl.TestCaseGraphHelper
  • net.sf.parteg.base.testcasegraph.testgeneration.TestCaseGenerator
  • net.sf.parteg.input.statemachine.TestCaseGraphGenerator
    • 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.