Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Symbols/Wildcards/AnyNodeSymbol.cs @ 12951

Last change on this file since 12951 was 12951, checked in by bburlacu, 9 years ago

#1772:

  • Slight refactor in QueryMatch.cs
  • Added a parameter to the genealogy analyzer for removing older generations from the graph (useful to conserve memory in experiments)
  • Updated wildcard nodes (added persistence & cloning)
  • Implemented diversification strategy based on schema frequencies & phenotypic similarity as a separate operator (for now keep also the analyzer)
  • Updated license headers
  • Added QueryMatch performance test (to be expanded)
File size: 2.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2015 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26
27namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
28  [StorableClass]
29  [Item("AnyNodeSymbol", "A symbol that represents a '=' wildcard that can match any node of the same type (function or leaf)")]
30  public class AnyNodeSymbol : Symbol {
31    public AnyNodeSymbol(bool deserializing) : base(deserializing) { }
32
33    public AnyNodeSymbol(Symbol original, Cloner cloner) : base(original, cloner) { }
34
35    public AnyNodeSymbol(string name, string description) : base(name, description) { }
36
37    protected AnyNodeSymbol(AnyNodeSymbol original, Cloner cloner) : base(original, cloner) { }
38
39    public override IDeepCloneable Clone(Cloner cloner) {
40      return new AnyNodeSymbol(this, cloner);
41    }
42
43    private AnyNodeSymbol() : base("=", "A wildcard symbol that can match any node of the same type (function or leaf node)") { }
44
45    public AnyNodeSymbol(int minimumArity, int maximumArity)
46      : base("=", "A wildcard symbol that can match any node of the same type (function or leaf node)") {
47      this.MinimumArity = minimumArity;
48      this.MaximumArity = maximumArity;
49    }
50
51    public override ISymbolicExpressionTreeNode CreateTreeNode() {
52      return new AnyNode(this);
53    }
54
55    public override int MinimumArity { get; }
56    public override int MaximumArity { get; }
57  }
58}
Note: See TracBrowser for help on using the repository browser.