Package org.xilaew.atg.model.abstractTestCaseGraph

Examples of org.xilaew.atg.model.abstractTestCaseGraph.AbstractTCGEdge

88
89
90
91
92
93
94
95
96
97
   * <!-- begin-user-doc -->
   * <!-- end-user-doc -->
   * @generated
   */
  public void setEdges(AbstractTCGEdge newEdges) {
    AbstractTCGEdge oldEdges = edges;
    edges = newEdges;
    if (eNotificationRequired())
      eNotify(new ENotificationImpl(this, Notification.SET, TestCaseGraphRuntimePackage.AMPL_PATH__EDGES, oldEdges, edges));
  }
View Full Code Here
395
396
397
398
399
400
401
402
403
404
405
        tcgActivity.getNodes().add(tcgNode);
      }
    }
    // convert (UML) ActivityEdges to TCGEdges
    for (ActivityEdge umlEdge : umlActivity.getEdges()) {
      AbstractTCGEdge tcgEdge = (AbstractTCGEdge) transformElement(umlEdge);
      if (tcgEdge != null) {
        tcgActivity.getEdges().add(tcgEdge);
      }
    }
    tcgActivity.setClassName(UMLHelper.getNamespace(umlActivity).getName());
View Full Code Here
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
    Deque<SearchTree> stack = new ArrayDeque<SearchTree>();
    for (AbstractTCGEdge e : atcg.getInitialNode().getOutgoing()) {
      stack.addLast(new SearchTree(e, null, 0));
    }
    AbstractTCGNode currentNode = atcg.getInitialNode();
    AbstractTCGEdge currentEdge;
    SearchTree currentElement;
    while (!stack.isEmpty()) {
      currentElement = stack.removeFirst();
      currentEdge = currentElement.edge;
      currentNode = currentEdge.getTarget();

      for (AbstractTCGEdge outgoing : currentNode.getOutgoing()) {
        stack.addLast(new SearchTree(outgoing, currentElement,
            currentElement.depth + 1));
      }
View Full Code Here
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
    EList<Path> result = new BasicEList<Path>();
    Deque<AbstractTCGEdge> stack = new ArrayDeque<AbstractTCGEdge>();
   
    stack.addAll(atcg.getInitialNode().getOutgoing());
    AbstractTCGNode currentNode = atcg.getInitialNode();
    AbstractTCGEdge currentEdge ;
    Path currentPath = TestCaseGraphRuntimeFactory.eINSTANCE.createPath();
    while(!stack.isEmpty()){
      currentEdge = stack.removeFirst();
      while(!currentEdge.getSource().equals(currentNode)){
        //retreat
        currentNode = currentPath.getEdges().remove(currentPath.getEdges().size()-1).getSource();
      }
      currentNode = currentEdge.getTarget();
      currentPath.getEdges().add(currentEdge);
      for(AbstractTCGEdge outgoing:currentNode.getOutgoing()){
        stack.addFirst(outgoing);
      }
      if(currentNode.getOutgoing().size()==0){
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
      currentEdge = stack.removeFirst();
      // backtrack
      while (currentEdge.getSecond() != currentPath.getEdges().size()) {
        // System.out.println("BACKTRACK");
        EList<AbstractTCGEdge> l = currentPath.getEdges();
        AbstractTCGEdge e = l.remove(l.size() - 1);
        currentNode = e.getSource();
        if (currentNode.getOutgoing().size() >= 2) {
          passedDecisions--;
        }
      }
      passedDecisions = (passedDecisions < 0 ? 0 : passedDecisions);
View Full Code Here
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
    Deque<SearchTree> stack = new ArrayDeque<SearchTree>();
    for (AbstractTCGEdge e : atcg.getInitialNode().getOutgoing()) {
      stack.addLast(new SearchTree(e, null, 0));
    }
    AbstractTCGNode currentNode = atcg.getInitialNode();
    AbstractTCGEdge currentEdge;
    SearchTree currentElement;
    while (!stack.isEmpty() && (result.size() <= maxNoPaths || maxNoPaths==-1)) {
      currentElement = stack.removeFirst();
      currentEdge = currentElement.edge;
      currentNode = currentEdge.getTarget();

      if (currentElement.depth < maxDepth || maxDepth==-1) {
        for (AbstractTCGEdge outgoing : currentNode.getOutgoing()) {
          stack.addLast(new SearchTree(outgoing, currentElement,
              currentElement.depth + 1));
View Full Code Here
26
27
28
29
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
    EMap<Path, Witness> result = new BasicEMap<Path, Witness>();
    Deque<SearchTree> stack = new ArrayDeque<SearchTree>();
    ampl.setSolver(solver);
    ampl.loadModel(ActTCG2AMPLModel.transform(atcg));
    AbstractTCGNode currentNode = atcg.getInitialNode();
    AbstractTCGEdge currentEdge;
    SearchTree currentElement;
    // Add Initial Search Tree Nodes
    int pDInc = (currentNode.getOutgoing().size() >= 2 ? 1 : 0); // passed
                                    // Decissions
                                    // Increment
                                    // (set
                                    // to 1
                                    // whenever
                                    // the
                                    // current
                                    // node
                                    // has
                                    // multiple
                                    // outgoing
                                    // edges)
    for (AbstractTCGEdge e : atcg.getInitialNode().getOutgoing()) {
      stack.addLast(new SearchTree(e, null, 0, pDInc));
    }
    // Perform Breadth First Search
    while (!stack.isEmpty()
        && (result.size() < maxNoPaths || maxNoPaths == -1)) {
      pDInc = 0;
      currentElement = stack.removeFirst();
      currentEdge = currentElement.edge;
      currentNode = currentEdge.getTarget();

      if (currentElement.depth <= maxDepth || maxDepth == -1) {
        pDInc = (currentNode.getOutgoing().size() >= 2 ? 1 : 0);
        // Eliminate Infeasible Paths
        if (pDInc == 1
View Full Code Here
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
    while (!stack.isEmpty()
        && (result.size() <= maxNoPaths || maxNoPaths == -1)) {
      currentEdge = stack.removeFirst();
      while (currentEdge.getSecond() != currentPath.getEdges().size()) {
        EList<AbstractTCGEdge> l = currentPath.getEdges();
        AbstractTCGEdge e = l.remove(l.size() - 1);
        // retreat
        currentNode = e.getSource();
      }
      if (!currentNode.equals(currentEdge.getFirst().getSource())) {
        try {
          throw new YouShallNotDoThisException("bullshit");
        } catch (YouShallNotDoThisException e) {
          // TODO Auto-generated catch block
          e.printStackTrace();
        }
      }
      ;
      currentNode = currentEdge.getFirst().getTarget();
      currentPath.getEdges().add(currentEdge.getFirst());
View Full Code Here
TOP

Related Classes of org.xilaew.atg.model.abstractTestCaseGraph.AbstractTCGEdge

  • org.xilaew.atg.model.pathsearch.BFS
  • org.xilaew.atg.model.pathsearch.BoundedBFS
  • org.xilaew.atg.model.pathsearch.BoundedDFS
  • org.xilaew.atg.model.pathsearch.DFS
  • org.xilaew.atg.model.pathsearch.SolverBFS
  • org.xilaew.atg.model.pathsearch.SolverDFS
  • org.xilaew.atg.model.testCaseGraphRuntime.impl.AMPLPathImpl
  • org.xilaew.atg.transformations.uml2actTCG.UML2TCGActivity
    • 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.