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

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

188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
   
    // try each of the given postfixes
    for(TestCaseGeneratorRunnerState oRunnerState : colInitialRunnerStates) {
      m_oTestCaseRunnerState = oRunnerState.copy();
      // determine last state
      TCGNode oStartNode = in_oNode;
      // a transition sequence was found?
      if(!m_oTestCaseRunnerState.getTestGoalsToSatisfy().isEmpty()) {
        TestGoalBase oTestGoal = m_oTestCaseRunnerState.getTestGoalsToSatisfy().get(0);
        if(oTestGoal instanceof TestGoalTransitionSequence) {
          TestGoalTransitionSequence oTestGoalTransitionSequence =
            (TestGoalTransitionSequence)oTestGoal;
          TCGNode oSequenceEndNode = oTestGoalTransitionSequence.getEndNode();
          if(oSequenceEndNode != null) {
            oStartNode = oSequenceEndNode;
          }
        }
      }
View Full Code Here
242
243
244
245
246
247
248
249
250
251
252
   
    // initial state - try this one if you find no other transitions
    TestCaseGeneratorRunnerState oRunnerState = new TestCaseGeneratorRunnerState();
//    colRunnerStates.add(oRunnerState);

    TCGNode oTargetNode = in_oNode;
    // only one transition is triggered -> prevent ambiguous test goals
    // the same holds if event and condition are null -> no transition could be found!
    if((colTransitions.size() == 1) || (in_oEvent == null && in_oConjunction == null)) {

      if(colTransitions.size() == 1) {
View Full Code Here
109
110
111
112
113
114
115
116
117
118
119
  //Amin Rezaee
  @Override
  public TestCase createTestCase(TestCaseGraphHelper in_oTCGHelper)
  {
    TCGNode oNode = (TCGNode)getElement();
    // if composite state: try test generation for each sub state
    if(TCGNodeHelperClass.nodeHasNoSubNodes(oNode)) {
      TestCaseGeneratorRunner oRunner = new TestCaseGeneratorRunner(in_oTCGHelper);
      // initialize the runtime state
      oRunner.searchBackwardsFromNodeWithEventConditionConjunction(
View Full Code Here
151
152
153
154
155
156
157
158
159
160
161
  @Override
  public boolean checkSatisfactionOfTestGoalWithAbstractPath(
      LinkedList<Pair<TCGTransition, TCGNode>> in_oPath) {

    TCGNode oNode = (TCGNode)getElement();
   
    setTargetNode(oNode);
    setEventToBeTrigger(null);
    set_DNF(null);
    set_bCreateConditionBasedTestGoal(false);
View Full Code Here
38
39
40
41
42
43
44
45
46
47
    getTestGoals().add(in_oTestGoal);
    if(in_oTestGoal.getElement() instanceof TCGNode) {
      getTestGoals(in_oTestGoal.getElement()).add(in_oTestGoal);
    }
    else if(in_oTestGoal.getElement() instanceof TCGTransition) {
      TCGNode oNode =
        (TCGNode)((TCGTransition)(in_oTestGoal.getElement())).getSourceNode();
      getTestGoals(oNode).add(in_oTestGoal);
    }
  }
View Full Code Here
225
226
227
228
229
230
231
232
233
234
235
                 
                  if(subGraph != null) { //node is composite state (1)
                    modelDepth++;
                       for (TestCaseRegion oRegion : subGraph.getRegions()) {
                      for (TCGIntermediateNode oInitNode : TCGRegionHelperClass.findInitialNodes(oRegion)) {
                        TCGNode targetNode = oInitNode.getOutgoingTransitions().get(0).getTargetNode();
                        currentPath.add(new Pair<TCGTransition, TCGNode>(oPair.getFirst(), targetNode));
                        visitedNodeByAlgorithm.add(targetNode);
                        fuelOfAlgorithms--;
                        checkSatisfactionOfTestGoals(currentPath);
                        if(!allTestGoalHasBeenSatisfied()){
View Full Code Here
585
586
587
588
589
590
591
592
593
594
595
    // faster approach: compare only the test goals whose base element
    // is the source node of the current transition instance
    for(int i = 0; i < in_oTestCase.getTransitionInstances().size(); ++i) {
      TransitionInstance oTransitionInstance = in_oTestCase.getTransitionInstances().get(i);
//      TCGNode oSourceNode = oTransitionInstance.getSourceNode();
      TCGNode oSourceNode = oTransitionInstance.findLastVisitedNodeContainedOrEqualToCurrentNode();
      checkSatisfactionForNodeAndTransitionInstance(
          oTransitionInstance, oSourceNode, in_oTestCase);
      checkSatisfactionForNodeAndTransitionInstance(
          oTransitionInstance, oTransitionInstance.getTargetNode(), in_oTestCase);
    }
View Full Code Here
193
194
195
196
197
198
199
200
201
202
203
    if(getSourceNode() != null) {
      TransitionInstance oCurrentTransitionInstance =
        getPrecedingTransitionInstance();
      while(oCurrentTransitionInstance != null) {
        if(oCurrentTransitionInstance.getTransition() != null) {
          TCGNode oLastNode = oCurrentTransitionInstance.getTransition().getTargetNode();
          if(TCGNodeHelperClass.getAllSuperStatesIncludingThis(oLastNode).contains(getSourceNode())) {
            return oLastNode;
          }
        }
        oCurrentTransitionInstance =
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
  public static List<TCGIntermediateNode> findEntryNodes(TestCaseRegion in_oRegion)
  {
    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
74
75
76
77
78
79
80
81
82
83
84
85
86
        in_oLogger.getFormattedOutput().appendln(in_sPrefix + " (test goal #" + in_nTestGoalNumber + " - transition) ");
        in_oLogger.getFormattedOutput().appendln("   from " + oTransitionGoal.getSourceNode().getName());
        in_oLogger.getFormattedOutput().appendln("   to   " + oTransitionGoal.getTargetNode().getName());
      }
      else if(oTestGoalElement.getElement() instanceof TCGNode) {
        TCGNode oNodeGoal = (TCGNode)oTestGoalElement.getElement();
        in_oLogger.getFormattedOutput().appendln(in_sPrefix + " (test goal #" + in_nTestGoalNumber + " - node) ");
        in_oLogger.getFormattedOutput().appendln("   reach state " + oNodeGoal.getName());
      }
    }
    else if(in_oTestGoal instanceof TestGoalGuardConditions) {
      TestGoalGuardConditions oTestGoalGuard = (TestGoalGuardConditions)in_oTestGoal;
      if(oTestGoalGuard.getElement() instanceof TCGNode) {
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.