Package es.iiia.shapegrammar.execution

Examples of es.iiia.shapegrammar.execution.StateExecution

94
95
96
97
98
99
100
101
102
103
104
    this.shapeBasket.clear();

    // init start state
    ShapeModel startShape = this.getGrammar().getStartShape().clone();
    startShape.moveToCenter();
    this.startState = new StateExecution(startShape, new AffineTransform());

    // add first shape to the basket
    this.shapeBasket.add(getStartState().getShape());

    // init protocol
View Full Code Here
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
  protected void expandState(StateExecution state) {
    // set that this step has been expanded and executed
    state.setExecuted(true);

    StateExecution child;
   
    for (RuleModel rule : state.getShape().getGrammar().getRulesForShape(
        state.getShape().getId())) {
      child = new StateExecution(state.getShape(), rule, state
          .getAffineTransform());
     
      // add extended data
      if (state.getExtendedData() != null) {
        child.setExtendedData(state.getExtendedData());
      }
     
      // remember as child
      state.getChildren().add(child);
     
View Full Code Here
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
    ShapeModel shape = super.getShapeBasket().get(0).clone();
    shape.moveToCenter();
    shape.maximize();

    // get next state
    StateExecution state = this.getNext(monitor, shape);

    if (state == null) {
      monitor.done();
      return false;
    }
   
    // we test if the shape has changed
    // TODO: this will not work for replace   
    ShapeModel newShape = this.execute(shape, state, true);   
    if (newShape == null) {
      Debugger.getInstance().addMessage("Restarting process, no change in shape!");
      return this.executeNext(monitor);
    }
    Debugger.getInstance().addMessage("EXECUTED: " + state.toString());
   
    this.getShapeBasket().clear();
    this.getShapeBasket().add(newShape);
   
    return true;
View Full Code Here
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
    public TreeSearchProtocol(ShapeGrammarModel grammar, int randomizationLevel) {
        super(grammar, randomizationLevel);
    }
   
    public boolean executeNext(IProgressMonitor monitor) {
        StateExecution state = this.getNext();

        if (state == null) {
            Debugger.getInstance().addMessage("No possible step found!");
            return false;
        }

        // execute current rule
        ShapeModel currentShape = state.getRule().execute(state);
        this.getShapeBasket().add(currentShape);
       
        state.setExecuted(true);

        // this is the code for finding symmetries in object
//        try {
//          ArrayList<ShapeModel> shapes =
//        ShapeTools.findSubShape(currentShape, currentShape, new ArrayList<ShapeModel>(), 1, this
//            .isUseMarkers(), monitor, 100);
//         
//          System.out.println("Found subshapes: " + shapes.size());
//          for (ShapeModel shape : shapes) {
//            AffineTransform trans = new AffineTransform(state.getAffineTransform());
//            trans.preConcatenate(shape.getInitialTransform());
//            StateExecution newState = new StateExecution(
//                shape, trans);
//
//                // create child of current state
//                state.getChildren().add(newState);
//               
//                // insert this state into protocol
//                this.insertState(newState);
//          }
//         
//    } catch (Exception e) {
//      e.printStackTrace();
//    }
       
        // do postprocessing
        // now insert new "shape" state to the execution protocol remembering last transformation
        StateExecution newState = new StateExecution(
                currentShape, new AffineTransform(state.getAffineTransform()));

        // create child of current state
        state.getChildren().add(newState);
View Full Code Here
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
        return true;
    }

    // Randomization allows us to skip some steps, but always it returns at least one step
    private StateExecution getNext() {
        StateExecution currentState;
        while (true) {

            // get first element
          while ((currentState = getState()) != null) {
            if (!currentState.isExecuted()) {
              break;
            }
          }
           
            // we can have no possibilities
            if (currentState == null)
                    return null;

            // shape nodes expands with possible rules
            if (currentState.getStateType().equals(ExecutionStateTypes.Shape)) {
                this.expandState(currentState);
            }
            else {
                // decide if continue
                if (this.getRandomization() == 1 ||
                        !this.exists() ||
                        super.getRandom().nextInt(maxRandom) % super.getRandomization() == 0) {
                    // if we've found our node we put into collection output shape
                    break;
                }
                else {
                  ExecutionReport.skipNode();
                 
                    if (Debugger.isDebuggerOn()) {
                        Debugger.getInstance().addMessage("SKIPPING: " + currentState.toString());
                    }
                }
            }
        }
        return currentState;
View Full Code Here
TOP

Related Classes of es.iiia.shapegrammar.execution.StateExecution

  • es.iiia.shapegrammar.execution.protocols.ExecutionProtocol
  • es.iiia.shapegrammar.execution.protocols.SubShapeProtocol
  • es.iiia.shapegrammar.execution.protocols.TreeSearchProtocol
  • java.awt.geom.AffineTransform
    • 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.