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

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

548
549
550
551
552
553
554
555
556
557
558
      if(m == 20) {
      }
      if(oTestGoal instanceof TestGoalGuardConditions) {
        TestGoalGuardConditions oTestGoalGuard =
          (TestGoalGuardConditions)oTestGoal;
        TCGNode oNode = (TCGNode)oTestGoalGuard.getElement();
        TCGEvent oEvent = oTestGoalGuard.getEventToBeCalled();
        TCGDisjunctiveNormalForm oDNF = oTestGoalGuard.getDNFToBeSatisfied();

        ArrayList<TCGConjunction> colConjunctionsToTheFront =
          new ArrayList<TCGConjunction>();
View Full Code Here
665
666
667
668
669
670
671
672
673
674
675
//        ++x;
//      }
      if(oTestGoal instanceof TestGoalGuardConditions) {
        TestGoalGuardConditions oTestGoalGuard =
          (TestGoalGuardConditions)oTestGoal;
        TCGNode oNode = (TCGNode)oTestGoalGuard.getElement();
        TCGEvent oEvent = oTestGoalGuard.getEventToBeCalled();
        TCGDisjunctiveNormalForm oDNF = oTestGoalGuard.getDNFToBeSatisfied();

        ArrayList<TCGConjunction> colConjunctionsToTheFront =
          new ArrayList<TCGConjunction>();
View Full Code Here
707
708
709
710
711
712
713
714
715
716
717
      TCGEvent in_oEvent,
      TCGConjunction in_oConjunction) {
    List<TCGTransition> colTransitions =
      TCGTransitionHelperClass.findResultingTransitions(
        in_oNode, in_oEvent, in_oConjunction);
    TCGNode oTargetState = null;
    if(colTransitions.size() != 1) {
      oTargetState = in_oNode;
    }
    else {
      oTargetState = colTransitions.get(0).getTargetNode();
View Full Code Here
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
    for(TestGoalBase oTestGoal : io_colGoals) {
      Double nBranchingFactor = 1.0;
      if(oTestGoal instanceof TestGoalGuardConditions) {
        TestGoalGuardConditions oGoalGuard = (TestGoalGuardConditions)oTestGoal;
        nBranchingFactor = 0.0;
        TCGNode oBranchingNode = (TCGNode)oGoalGuard.getElement();
       
        // collect branching factor of transition's target node
        if(oGoalGuard.getDNFToBeSatisfied().getConjunctions().isEmpty()) {
          List<TCGTransition> colTransitions = TCGTransitionHelperClass.findResultingTransitions(
              oBranchingNode, oGoalGuard.getEventToBeCalled(), null);
          if(!colTransitions.isEmpty()) {
            oBranchingNode = colTransitions.get(0).getTargetNode();
          }
          nBranchingFactor = getBranchingFactor(oBranchingNode);
        }
        else {
          for(TCGConjunction oConjunction : oGoalGuard.getDNFToBeSatisfied().getConjunctions()) {
            oBranchingNode = (TCGNode)oGoalGuard.getElement();
            List<TCGTransition> colTransitions = TCGTransitionHelperClass.findResultingTransitions(
                oBranchingNode, oGoalGuard.getEventToBeCalled(), oConjunction);
            if(!colTransitions.isEmpty()) {
              oBranchingNode = colTransitions.get(0).getTargetNode();
            }
            Double nBranching = getBranchingFactor(oBranchingNode);
            nBranchingFactor += nBranching;
          }
          nBranchingFactor /= Double.valueOf(
              (double)oGoalGuard.getDNFToBeSatisfied().getConjunctions().size());
        }
      }
      else {
        TCGNode oBranchingNode = (TCGNode)oTestGoal.getElement();
        nBranchingFactor = getBranchingFactor(oBranchingNode);
      }
      oTestGoal.setPriority(nBranchingFactor);
      colGoalsBranchingFactor.put(oTestGoal, nBranchingFactor);
    }
View Full Code Here
69
70
71
72
73
74
75
76
77
78
79
    }
   
    // select node from regions (no initial node)
    for(TestCaseRegion oRegion : in_oRuntimeState.getAllRegions())
    {
      TCGNode oNode = in_oRuntimeState.getActiveNode(oRegion);
      if((oNode instanceof TCGRealNode ||
          !((TCGIntermediateNode)oNode).getNodeType().equals(TCGNodeType.INITIAL))) {
        out_oSelectedNodeList.add(oNode);
      }
    }
View Full Code Here
136
137
138
139
140
141
142
143
144
145
146
              oTransition = (TCGTransition)oElement;
              oRegion = oTransition.getContainer();
            }
           
            // found matching region for expression           
            TCGNode oNewActiveNode = in_oRuntimeState.getActiveNode(oRegion);
           
            // is the found state included in the region of one active state or vice versa?
            for(TCGNode oActiveNode : in_oRuntimeState.getAllActiveNodes()) {
              if(oActiveNode instanceof TCGRealNode)
                if(TCGRegionHelperClass.regionsAreInHierarchicalOrder(
View Full Code Here
85
86
87
88
89
90
91
92
93
94
95
    {
      // since this test goal includes a subsequent execution of a transition
      // it is sufficient to check only the source states of all transitions
      for(TransitionInstance oTransitionInstance : in_oTestCase.getTransitionInstances())
      {
        TCGNode oNode = oTransitionInstance.getSourceNode();
        // oNode (source node of transition) has to be included in
        // getElement() (source node of the test goal) or be equal
        // alternative: the state of the test goal is contained in the
        // source node of the transition -> search for the last visited node
        // and compare!
View Full Code Here
113
114
115
116
117
118
119
120
121
122
123
  @Override
  public boolean checkSatisfactionByTransitionInstance(
      TransitionInstance in_oTransitionInstance) {
    // checks nodes if test goal is a node
    if(getElement() instanceof TCGNode) {
      TCGNode oNode = in_oTransitionInstance.getSourceNode();
      // oNode (source node of transition) has to be included in
      // getElement() (source node of the test goal) or be equal
      // alternative: the state of the test goal is contained in the
      // source node of the transition -> search for the last visited node
      // and compare!
View Full Code Here
359
360
361
362
363
364
365
366
367
368
369
  }

  @Override
  public TestCase createTestCase(TestCaseGraphHelper in_oTCGHelper)
  {
    TCGNode oNode = (TCGNode)getElement();

    TestCaseGeneratorRunner oRunner = new TestCaseGeneratorRunner(in_oTCGHelper);
    //oRunner.getRuntimeState().setActiveNode(oNode); // delayed until postfix determination
    oRunner.searchBackwardsFromNodeWithEventConditionConjunction(
        oNode, getEventToBeCalled(), getDNFToBeSatisfied(), true);
View Full Code Here
393
394
395
396
397
398
399
400
401
402
403
  //Amin Rezaee
  @Override
  public boolean checkSatisfactionOfTestGoalWithAbstractPath(
      LinkedList<Pair<TCGTransition, TCGNode>> in_oPath) {

    TCGNode oNode = (TCGNode)getElement();
    setTargetNode(oNode);
    setEventToBeTrigger(getEventToBeCalled());
    set_DNF(getDNFToBeSatisfied());
    set_bCreateConditionBasedTestGoal(true);
    ////////////
View Full Code Here
TOP

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

  • net.amin.mobateg.helper.ampl.PathToAMPLData
  • net.amin.mobateg.helper.generatennittest.GenerateJUnitTest
  • net.sf.parteg.base.testcasegraph.generated.impl.TCGTransitionImpl
  • net.sf.parteg.base.testcasegraph.generated.util.GeneratedSwitch
  • net.sf.parteg.base.testcasegraph.helperclasses.DecisionNodeSplitter
  • net.sf.parteg.base.testcasegraph.helperclasses.LoggerHelperClass
  • 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.ocl.TestCaseGraphHelper
    • 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.