source: branches/2839_HiveProjectManagement/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/CutPoint.cs @ 16057

Last change on this file since 16057 was 16057, checked in by jkarder, 2 years ago

#2839:

File size: 2.7 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2018 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; private set; }
26    public ISymbolicExpressionTreeNode Child { get; private set; }
27    private readonly ISymbolicExpressionTreeGrammar grammar;
28
29    public int ChildIndex { get; private set; }
30
31    public CutPoint(ISymbolicExpressionTreeNode parent, ISymbolicExpressionTreeNode child) {     
32      this.Parent = parent;
33      this.Child = child;
34      this.ChildIndex = parent.IndexOfSubtree(child);
35      this.grammar = parent.Grammar;
36    }
37    public CutPoint(ISymbolicExpressionTreeNode parent, int childIndex) {
38      this.Parent = parent;
39      this.ChildIndex = childIndex;
40      this.Child = null;
41      this.grammar = parent.Grammar;
42    }
43
44    public bool IsMatchingPointType(ISymbolicExpressionTreeNode newChild) {
45      var parent = this.Parent;
46      if (newChild == null) {
47        // make sure that one subtree can be removed and that only the last subtree is removed
48        return grammar.GetMinimumSubtreeCount(parent.Symbol) < parent.SubtreeCount &&
49          this.ChildIndex == parent.SubtreeCount - 1;
50      } else {
51        // check syntax constraints of direct parent - child relation
52        if (!grammar.ContainsSymbol(newChild.Symbol) ||
53            !grammar.IsAllowedChildSymbol(parent.Symbol, newChild.Symbol, this.ChildIndex))
54          return false;
55
56        bool result = true;
57        // check point type for the whole branch
58        newChild.ForEachNodePostfix((n) => {
59          result =
60            result &&
61            grammar.ContainsSymbol(n.Symbol) &&
62            n.SubtreeCount >= grammar.GetMinimumSubtreeCount(n.Symbol) &&
63            n.SubtreeCount <= grammar.GetMaximumSubtreeCount(n.Symbol);
64        });
65        return result;
66      }
67    }
68  }
69}
Note: See TracBrowser for help on using the repository browser.