Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.4/SymbolicExpressionTree.cs @ 7964

Last change on this file since 7964 was 7795, checked in by bburlacu, 12 years ago

#1845: Implemented breadth-first traversal of nodes for symbolic expression trees. The new method is called IterateNodesBreadth().

File size: 3.1 KB
RevLine 
[2210]1#region License Information
2/* HeuristicLab
[7259]3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[2210]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;
23using System.Collections.Generic;
[4068]24using System.Drawing;
[3376]25using HeuristicLab.Common;
[2210]26using HeuristicLab.Core;
[3223]27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
[2210]28
[3223]29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
30  [StorableClass]
31  [Item("SymbolicExpressionTree", "Represents a symbolic expression tree.")]
[5499]32  public class SymbolicExpressionTree : Item, ISymbolicExpressionTree {
[7201]33    public static new Image StaticItemImage {
[5287]34      get { return HeuristicLab.Common.Resources.VSImageLibrary.Function; }
[3710]35    }
[3252]36    [Storable]
[5499]37    private ISymbolicExpressionTreeNode root;
38    public ISymbolicExpressionTreeNode Root {
[3223]39      get { return root; }
40      set {
41        if (value == null) throw new ArgumentNullException();
42        else if (value != root) {
43          root = value;
44          OnToStringChanged();
45        }
46      }
[2211]47    }
48
[5549]49    public int Length {
[3223]50      get {
[3926]51        if (root == null)
52          return 0;
[5549]53        return root.GetLength();
[3223]54      }
[2210]55    }
56
[5549]57    public int Depth {
[3223]58      get {
[3926]59        if (root == null)
60          return 0;
[5549]61        return root.GetDepth();
[2210]62      }
63    }
64
[4722]65    [StorableConstructor]
66    protected SymbolicExpressionTree(bool deserializing) : base(deserializing) { }
67    protected SymbolicExpressionTree(SymbolicExpressionTree original, Cloner cloner)
68      : base(original, cloner) {
69      root = cloner.Clone(original.Root);
[3294]70    }
[4722]71    public SymbolicExpressionTree() : base() { }
[5532]72    public SymbolicExpressionTree(ISymbolicExpressionTreeNode root)
[3294]73      : base() {
[3442]74      this.Root = root;
[3294]75    }
[2210]76
[7795]77    public IEnumerable<ISymbolicExpressionTreeNode> IterateNodesBreadth() {
78      if (root == null)
79        return new SymbolicExpressionTreeNode[0];
80      return root.IterateNodesBreadth();
81    }
82
[5499]83    public IEnumerable<ISymbolicExpressionTreeNode> IterateNodesPrefix() {
[3926]84      if (root == null)
85        return new SymbolicExpressionTreeNode[0];
[3338]86      return root.IterateNodesPrefix();
[3244]87    }
[5499]88    public IEnumerable<ISymbolicExpressionTreeNode> IterateNodesPostfix() {
[3926]89      if (root == null)
90        return new SymbolicExpressionTreeNode[0];
[3338]91      return root.IterateNodesPostfix();
[3244]92    }
[3338]93
[3223]94    public override IDeepCloneable Clone(Cloner cloner) {
[4722]95      return new SymbolicExpressionTree(this, cloner);
[2210]96    }
97  }
98}
Note: See TracBrowser for help on using the repository browser.