Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/CutPoint.cs @ 11208

Last change on this file since 11208 was 11208, checked in by bburlacu, 8 years ago

#1772: Merged trunk changes.

File size: 2.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
4 *
5 * This file is part of HeuristicLab.
6 *
7 * HeuristicLab is free software: you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation, either version 3 of the License, or
10 * (at your option) any later version.
11 *
12 * HeuristicLab is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
19 */
20#endregion
21
22
23namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
24  public class CutPoint {
25    public ISymbolicExpressionTreeNode Parent { get; set; }
26    public ISymbolicExpressionTreeNode Child { get; set; }
27    private int childIndex;
28    public int ChildIndex {
29      get { return childIndex; }
30    }
31    public CutPoint(ISymbolicExpressionTreeNode parent, ISymbolicExpressionTreeNode child) {
32      this.Parent = parent;
33      this.Child = child;
34      this.childIndex = parent.IndexOfSubtree(child);
35    }
36    public CutPoint(ISymbolicExpressionTreeNode parent, int childIndex) {
37      this.Parent = parent;
38      this.childIndex = childIndex;
39      this.Child = null;
40    }
41
42    public bool IsMatchingPointType(ISymbolicExpressionTreeNode newChild) {
43      var parent = this.Parent;
44      if (newChild == null) {
45        // make sure that one subtree can be removed and that only the last subtree is removed
46        return parent.Grammar.GetMinimumSubtreeCount(parent.Symbol) < parent.SubtreeCount &&
47          this.ChildIndex == parent.SubtreeCount - 1;
48      } else {
49        // check syntax constraints of direct parent - child relation
50        if (!parent.Grammar.ContainsSymbol(newChild.Symbol) ||
51            !parent.Grammar.IsAllowedChildSymbol(parent.Symbol, newChild.Symbol, this.ChildIndex))
52          return false;
53
54        bool result = true;
55        // check point type for the whole branch
56        newChild.ForEachNodePostfix((n) => {
57          result =
58            result &&
59            parent.Grammar.ContainsSymbol(n.Symbol) &&
60            n.SubtreeCount >= parent.Grammar.GetMinimumSubtreeCount(n.Symbol) &&
61            n.SubtreeCount <= parent.Grammar.GetMaximumSubtreeCount(n.Symbol);
62        });
63        return result;
64      }
65    }
66  }
67}
Note: See TracBrowser for help on using the repository browser.