Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/TreeMatching/SymbolicExpressionTreeNodeComparer.cs @ 14545

Last change on this file since 14545 was 14185, checked in by swagner, 8 years ago

#2526: Updated year of copyrights in license headers

File size: 2.7 KB
RevLine 
[11486]1#region License Information
2/* HeuristicLab
[14185]3 * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[11486]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 System;
[10562]23using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
24
25namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
26  // this comparer considers that a < b if the type of a is "greater" than the type of b, for example:
27  // - A function node is "greater" than a terminal node
28  // - A variable terminal is "greater" than a constant terminal
29  // - used for bringing subtrees to a "canonical" form when the operation allows reordering of arguments
30  public class SymbolicExpressionTreeNodeComparer : ISymbolicExpressionTreeNodeComparer {
[11910]31    public static int CompareNodes(ISymbolicExpressionTreeNode a, ISymbolicExpressionTreeNode b) {
[11486]32      var ta = a as SymbolicExpressionTreeTerminalNode;
33      var tb = b as SymbolicExpressionTreeTerminalNode;
34
35      if (ta == null)
36        return tb == null ? String.CompareOrdinal(a.Symbol.Name, b.Symbol.Name) : -1;
37
38      if (tb == null)
39        return 1;
40
41      // at this point we know a and b are both terminals
[10562]42      var va = a as VariableTreeNode;
[11486]43      var vb = b as VariableTreeNode;
44
45      if (va != null)
46        return vb == null ? -1 : CompareVariables(va, vb);
47
48      if (vb != null)
49        return 1;
50
51      // at this point we know a and b are not variables
52      var ca = a as ConstantTreeNode;
53      var cb = b as ConstantTreeNode;
54
55      if (ca != null && cb != null)
56        return ca.Value.CompareTo(cb.Value);
57
58      // for other unknown terminal types, compare strings
59      return string.CompareOrdinal(a.ToString(), b.ToString());
[10562]60    }
[11486]61
62    private static int CompareVariables(VariableTreeNode a, VariableTreeNode b) {
63      int result = string.CompareOrdinal(a.VariableName, b.VariableName);
64      return result == 0 ? a.Weight.CompareTo(b.Weight) : result;
65    }
[11894]66
[11910]67    public int Compare(ISymbolicExpressionTreeNode x, ISymbolicExpressionTreeNode y) {
68      return CompareNodes(x, y);
[11894]69    }
[10562]70  }
[11486]71
[10562]72}
Note: See TracBrowser for help on using the repository browser.