Package org.encog.ml.prg

Examples of org.encog.ml.prg.ProgramNode

45
46
47
48
49
50
51
52
53
54
55
56
   */
  @Override
  public boolean rewrite(Genome g) {
    EncogProgram program = ((EncogProgram)g);
    this.rewritten = false;
    ProgramNode rootNode = program.getRootNode();
    ProgramNode rewrite = rewriteNode(rootNode);
    if (rewrite != null) {
      program.setRootNode(rewrite);
    }
    return this.rewritten;
  }
View Full Code Here
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
   * @return The rewritten node, the original node, if no rewrite occured.
   */
  private ProgramNode rewriteNode(ProgramNode node) {

    // first try to rewrite the child node
    ProgramNode rewrite = tryNodeRewrite(node);
    if (rewrite != null) {
      return rewrite;
    }

    // if we could not rewrite the entire node, rewrite as many children as
    // we can
    for (int i = 0; i < node.getChildNodes().size(); i++) {
      ProgramNode childNode = (ProgramNode)node.getChildNodes().get(i);
      rewrite = rewriteNode(childNode);
      if (rewrite != null) {
        node.getChildNodes().remove(i);
        node.getChildNodes().add(i, rewrite);
        this.rewritten = true;
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
   * Try to rewrite the specified node.
   * @param parentNode The node to attempt rewrite.
   * @return The rewritten node, or original node, if no rewrite could happen.
   */
  private ProgramNode tryNodeRewrite(ProgramNode parentNode) {
    ProgramNode result = null;

    if (parentNode.isLeaf()) {
      return null;
    }

    if (parentNode.allConstDescendants()) {
      ExpressionValue v = parentNode.evaluate();
      double ck = v.toFloatValue();
     
      // do not rewrite if it produces a div by 0 or other bad result.
      if( Double.isNaN(ck) || Double.isInfinite(ck) ) {
        return result;
      }
     
      result = parentNode
          .getOwner()
          .getContext()
          .getFunctions()
          .factorProgramNode("#const", parentNode.getOwner(),
              new ProgramNode[] {});
     
      // is it an integer?
      if( Math.abs( ck- ((int)ck))<Encog.DEFAULT_DOUBLE_EQUAL) {
        result.getData()[0] = new ExpressionValue((int)ck);
      } else {
        result.getData()[0] = v;
      }
    }
    return result;
  }
View Full Code Here
66
67
68
69
70
71
72
73
74
75
76
77
    final int node2Size = node2.getChildNodes().size();
    final int childNodeCount = Math.max(node1Size, node2Size);

    for (int i = 0; i < childNodeCount; i++) {
      if (i < node1Size && i < node2Size) {
        final ProgramNode childNode1 = node1.getChildNode(i);
        final ProgramNode childNode2 = node2.getChildNode(i);
        newResult = compareNode(newResult, childNode1, childNode2);
      } else {
        newResult++;
      }
    }
View Full Code Here
108
109
110
111
112
113
114
   *            The arguments for this node.
   * @return The newly created ProgramNode.
   */
  public ProgramNode factorProgramNode(final ProgramExtensionTemplate temp,
      final EncogProgram program, final ProgramNode[] args) {
    return new ProgramNode(program, temp, args);
  }
View Full Code Here
133
134
135
136
137
138
139
      throw new EACompileError("Undefined function/operator: " + name
          + " with " + args.length + " args.");
    }

    final ProgramExtensionTemplate temp = this.templateMap.get(key);
    return new ProgramNode(program, temp, args);
  }
View Full Code Here
64
65
66
67
68
69
70
71
72
73
74
      holder.setTypes(types);
      holder.setNodeFound(parentNode);
    } else {
      holder.decreaseLevel();
      for (int i = 0; i < parentNode.getTemplate().getChildNodeCount(); i++) {
        final ProgramNode childNode = parentNode.getChildNode(i);
        final List<ValueType> childTypes = parentNode.getTemplate()
            .getParams().get(i).determineArgumentTypes(types);
        findNode(rnd, childNode, childTypes, holder);
      }
    }
View Full Code Here
131
132
133
134
135
136
137
138
139
140
141
142
143
      findNode(rnd, parent2.getRootNode(), types, holder2);

      if (LevelHolder.compatibleTypes(holder1.getTypes(),
          holder2.getTypes())) {
        final EncogProgram result = context.cloneProgram(parent1);
        final ProgramNode resultNode = parent1.findNode(p1Index);
        final ProgramNode p2Node = parent2.findNode(p2Index);
        final ProgramNode newInsert = context.cloneBranch(result,
            p2Node);
        result.replaceNode(resultNode, newInsert);
        offspring[0] = result;
        done = true;
      } else {
View Full Code Here
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
      final ProgramNode parentNode, final List<ValueType> types,
      final int[] globalIndex) {
    if (globalIndex[0] == 0) {
      globalIndex[0]--;

      final ProgramNode newInsert = this.generator.createNode(rnd,
          result, this.maxDepth, types);
      result.replaceNode(parentNode, newInsert);
    } else {
      globalIndex[0]--;
      for (int i = 0; i < parentNode.getTemplate().getChildNodeCount(); i++) {
        final ProgramNode childNode = parentNode.getChildNode(i);
        final List<ValueType> childTypes = parentNode.getTemplate()
            .getParams().get(i).determineArgumentTypes(types);
        findNode(rnd, result, childNode, childTypes, globalIndex);
      }
    }
View Full Code Here
33
34
35
36
37
38
39
40
41
public class TestSubtreeCrossover extends TestCase {
  public void testCrossoverOperation() {
    RenderCommonExpression render = new RenderCommonExpression();
    EncogProgram prg = new EncogProgram("1+2");
    EncogProgram prg2 = new EncogProgram("4+5");
    ProgramNode node = prg.findNode(2);
    prg.replaceNode(node, prg2.getRootNode());
    Assert.assertEquals("(1+(4+5))",render.render(prg));
  }
View Full Code Here
TOP

Related Classes of org.encog.ml.prg.ProgramNode

  • org.encog.ml.prg.expvalue.ExpressionValue
  • org.encog.ml.prg.extension.FunctionFactory
  • org.encog.ml.prg.generator.AbstractPrgGenerator
  • org.encog.ml.prg.opp.ConstMutation
  • org.encog.ml.prg.opp.SubtreeCrossover
  • org.encog.ml.prg.opp.SubtreeMutation
  • org.encog.ml.prg.species.CompareEncogProgram
  • org.encog.ml.prg.train.crossover.TestSubtreeCrossover
  • org.encog.ml.prg.train.rewrite.RewriteAlgebraic
  • org.encog.ml.prg.train.rewrite.RewriteBoolean
    • 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.