[2210] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[3244] | 3 | * Copyright (C) 2002-2010 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 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
[4068] | 24 | using System.Drawing;
|
---|
[3376] | 25 | using HeuristicLab.Common;
|
---|
[2210] | 26 | using HeuristicLab.Core;
|
---|
[3223] | 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[2210] | 28 |
|
---|
[3223] | 29 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
| 30 | [StorableClass]
|
---|
| 31 | [Item("SymbolicExpressionTree", "Represents a symbolic expression tree.")]
|
---|
[3294] | 32 | public class SymbolicExpressionTree : Item {
|
---|
[3710] | 33 | public override Image ItemImage {
|
---|
| 34 | get { return HeuristicLab.Common.Resources.VS2008ImageLibrary.Function; }
|
---|
| 35 | }
|
---|
[3252] | 36 | [Storable]
|
---|
[3223] | 37 | private SymbolicExpressionTreeNode root;
|
---|
| 38 | public SymbolicExpressionTreeNode Root {
|
---|
| 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 |
|
---|
[3223] | 49 | public int Size {
|
---|
| 50 | get {
|
---|
[3926] | 51 | if (root == null)
|
---|
| 52 | return 0;
|
---|
[3223] | 53 | return root.GetSize();
|
---|
| 54 | }
|
---|
[2210] | 55 | }
|
---|
| 56 |
|
---|
[3223] | 57 | public int Height {
|
---|
| 58 | get {
|
---|
[3926] | 59 | if (root == null)
|
---|
| 60 | return 0;
|
---|
[3223] | 61 | return root.GetHeight();
|
---|
[2210] | 62 | }
|
---|
| 63 | }
|
---|
| 64 |
|
---|
[3294] | 65 | public SymbolicExpressionTree()
|
---|
| 66 | : base() {
|
---|
| 67 | }
|
---|
[2210] | 68 |
|
---|
[3294] | 69 | public SymbolicExpressionTree(SymbolicExpressionTreeNode root)
|
---|
| 70 | : base() {
|
---|
[3442] | 71 | this.Root = root;
|
---|
[3294] | 72 | }
|
---|
[2210] | 73 |
|
---|
[3244] | 74 | public IEnumerable<SymbolicExpressionTreeNode> IterateNodesPrefix() {
|
---|
[3926] | 75 | if (root == null)
|
---|
| 76 | return new SymbolicExpressionTreeNode[0];
|
---|
[3338] | 77 | return root.IterateNodesPrefix();
|
---|
[3244] | 78 | }
|
---|
| 79 | public IEnumerable<SymbolicExpressionTreeNode> IterateNodesPostfix() {
|
---|
[3926] | 80 | if (root == null)
|
---|
| 81 | return new SymbolicExpressionTreeNode[0];
|
---|
[3338] | 82 | return root.IterateNodesPostfix();
|
---|
[3244] | 83 | }
|
---|
[3338] | 84 |
|
---|
[3223] | 85 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 86 | SymbolicExpressionTree clone = new SymbolicExpressionTree();
|
---|
| 87 | cloner.RegisterClonedObject(this, clone);
|
---|
[3926] | 88 | if (root != null)
|
---|
| 89 | clone.root = (SymbolicExpressionTreeNode)this.root.Clone();
|
---|
[3223] | 90 | return clone;
|
---|
[2210] | 91 | }
|
---|
| 92 | }
|
---|
| 93 | }
|
---|