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

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

119
120
121
122
123
124
125
126
127
128
129
130
131
132
 
  private void createTestCasesByForwardSearch() {
   
    visitedNodeByAlgorithm = new ArrayList<TCGNode>();
    LinkedList<Pair<TCGTransition, TCGNode>> visited = new LinkedList<Pair<TCGTransition,TCGNode>>();
    TCGIntermediateNode topmostInitial = topmostInitialNode();
    visitedNodeByAlgorithm.add(topmostInitial);
   
    for (TCGTransition oTran : topmostInitial.getOutgoingTransitions()) {
      visited.add(new Pair<TCGTransition, TCGNode>(oTran, oTran.getTargetNode()));
      visitedNodeByAlgorithm.add(oTran.getTargetNode());
    }

      checkSatisfactionOfTestGoals(visited);
View Full Code Here
202
203
204
205
206
207
208
209
210
211
212
213
214
                 moderateEntryAndExitPoint(oPair);
                 currentPath.add(oPair);
                  visitedNodeByAlgorithm.add(oPair.getSecond());
                  fuelOfAlgorithms--;
                  //add next transition and state if current node is temp node
                  TCGIntermediateNode oImNode = (TCGIntermediateNode) oPair.getSecond();
                  if(oImNode.getNodeType() == TCGNodeType.TEMPORARY){
                    TCGTransition nextTran = oImNode.getOutgoingTransitions().get(0);
                    if(nextTran != null)
                      currentPath.add(new Pair<TCGTransition, TCGNode>(nextTran, nextTran.getTargetNode()));
                  }
                  //
                  checkSatisfactionOfTestGoals(currentPath);
View Full Code Here
256
257
258
259
260
261
262
263
264
265
266
  public TCGIntermediateNode topmostInitialNode()
  {
    for(TCGNode tcgNode : m_oTCGHelper.getAllNodes())
    {
      if(tcgNode instanceof TCGIntermediateNode) {
        TCGIntermediateNode oInterNode = (TCGIntermediateNode)tcgNode;
        if (TCGNodeHelperClass.isTopmostInitialNode(oInterNode))
          return oInterNode;
      }
    }
    return null;
View Full Code Here
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
    return null;
 
  }
   
    private void moderateEntryAndExitPoint(Pair<TCGTransition, TCGNode> oPair){
      TCGIntermediateNode oIN = (TCGIntermediateNode) oPair.getSecond();
      if(oIN.getNodeType() == TCGNodeType.EXIT){
        if(oIN.getOutgoingTransitions().size() == 0){
          //TODO: Find related composite state and outgoing transitions of it
          System.out.println("Exit Point must have at least one outgoing transition");
          return;
        }
      }
      if(oIN.getNodeType() == TCGNodeType.ENTRY){
         if(oIN.getOutgoingTransitions().size() == 0){
          //TODO: Find related composite state and initial states of it
          System.out.println("Entry Point must have at least one outgoing transition");
          return;
        }
      }
View Full Code Here
45
46
47
48
49
50
51
52
53
54
55
56
57
  public static List<TCGIntermediateNode> findInitialNodes(TestCaseRegion in_oRegion)
  {
    List<TCGIntermediateNode> colRetList = new ArrayList<TCGIntermediateNode>();
    for(TCGNode oNode : in_oRegion.getNodes()) {
      if(oNode instanceof TCGIntermediateNode) {
        TCGIntermediateNode oIntNode = (TCGIntermediateNode)oNode;
        // initial node
        if(oIntNode.getNodeType().equals(TCGNodeType.INITIAL)) {
          colRetList.add(oIntNode);
          continue;
        }
      }
    }
View Full Code Here
63
64
65
66
67
68
69
70
71
72
73
74
75
    List<TCGIntermediateNode> colRetList = new ArrayList<TCGIntermediateNode>();
    for(TCGNode oNode : in_oRegion.getNodes()) {
      for(TCGTransition oTransition : oNode.getIncomingTransitions()) {
        TCGNode oSourceNode = oTransition.getSourceNode();
        if(oSourceNode instanceof TCGIntermediateNode) {
          TCGIntermediateNode oIntNode = (TCGIntermediateNode)oSourceNode;
          if(oIntNode.getNodeType().equals(TCGNodeType.ENTRY)
              && !oIntNode.getContainer().equals(in_oRegion)) {
            colRetList.add(oIntNode);
          }
        }
      }
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
      TCGTransition in_oTransition)
  {
    List<TCGNode> colRetNodes = new ArrayList<TCGNode>();
    TCGNode oOriginallyReferencedNode = in_oTransition.getSourceNode();
    if(oOriginallyReferencedNode instanceof TCGIntermediateNode) {
      TCGIntermediateNode oIntNode = (TCGIntermediateNode)oOriginallyReferencedNode;
      colRetNodes.add(oOriginallyReferencedNode);
      // connection point: add connection point references
      if(!oIntNode.getReferencedConnectionPointReferences().isEmpty()) {
        colRetNodes.addAll(oIntNode.getReferencedConnectionPointReferences());
      }
      // connection point reference: add connection points
      else if(!oIntNode.getReferencedConnectionPoints().isEmpty()) {
        colRetNodes.addAll(oIntNode.getReferencedConnectionPoints());
      }
    }
    else
      colRetNodes = TCGNodeHelperClass.getPossibleSubNodes(
        oOriginallyReferencedNode, in_oTransition.getEvents());
View Full Code Here
244
245
246
247
248
249
250
251
252
253
254
      TCGTransition in_oOutgoingTransition) throws Exception
  {
    TCGNode oSourceNode = in_oIncomingTransition.getSourceNode();
    TCGNode oTargetNode = in_oOutgoingTransition.getTargetNode();
   
    TCGIntermediateNode oNewNode =
      in_oTCGHelper.addIntermediateNode(in_oRegion, TCGNodeType.UNKNOWN);
   
    TCGTransition oTCGTransition1 =
      in_oTCGHelper.addTransition(oSourceNode, oNewNode);
    oTCGTransition1.getEvents().addAll(in_oIncomingTransition.getEvents());
View Full Code Here
204
205
206
207
208
209
210
211
212
213
214
215
216
    removeNodeTransitions(in_oRealNode);
  }

  public TCGIntermediateNode addIntermediateNode(EObject in_oContainer, TCGNodeType in_eType)
  {
    TCGIntermediateNode oNode = GeneratedFactory.eINSTANCE.createTCGIntermediateNode();
    oNode.setNodeType(in_eType);
    oNode.setContainer(in_oContainer);
    if(in_oContainer instanceof TestCaseRegion) {
      ((TestCaseRegion)in_oContainer).getNodes().add(oNode);
    }
    else if(in_oContainer instanceof TCGRealNode) {
      if(in_eType.equals(TCGNodeType.ENTRY) || in_eType.equals(TCGNodeType.EXIT)) {
View Full Code Here
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
   * node of this existing transition
   */
  public TCGTransition insertTransitionBetweenTransitionAndTargetNode(
      TCGTransition in_oTransition) throws Exception
  {
    TCGIntermediateNode oNewNode =
      addIntermediateNode(in_oTransition.getContainer(), TCGNodeType.UNKNOWN);
    oNewNode.setNodeType(TCGNodeType.TEMPORARY);
   
    TCGNode oTCGOldTarget = in_oTransition.getTargetNode();
    in_oTransition.setTargetNode(oNewNode);
    oTCGOldTarget.getIncomingTransitions().remove(in_oTransition);
    oNewNode.getIncomingTransitions().add(in_oTransition);
    return addTransition(oNewNode, oTCGOldTarget);
  }
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.