source: trunk/sources/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding/3.3/SymbolicExpressionTree.cs @ 3317

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System;
using System.Linq;
using System.Collections.Generic;
using System.Text;
using HeuristicLab.Core;
using System.Xml;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using HeuristicLab.Data;

namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
  [StorableClass]
  [Item("SymbolicExpressionTree", "Represents a symbolic expression tree.")]
  public class SymbolicExpressionTree : Item {
    [Storable]
    private SymbolicExpressionTreeNode root;
    public SymbolicExpressionTreeNode Root {
      get { return root; }
      set {
        if (value == null) throw new ArgumentNullException();
        else if (value != root) {
          root = value;
          OnToStringChanged();
        }
      }
    }

    public SymbolicExpressionTreeNode ResultProducingExpression {
      get { return root.SubTrees[0].SubTrees[0]; }
    }

    [Storable]
    private Dictionary<int, IEnumerable<string>> allowedFunctionsInBranch;

    public int Size {
      get {
        return root.GetSize();
      }
    }

    public int Height {
      get {
        return root.GetHeight();
      }
    }

    public SymbolicExpressionTree()
      : base() {
      allowedFunctionsInBranch = new Dictionary<int, IEnumerable<string>>();
    }

    public SymbolicExpressionTree(SymbolicExpressionTreeNode root)
      : base() {
      allowedFunctionsInBranch = new Dictionary<int, IEnumerable<string>>();
    }

    public IEnumerable<SymbolicExpressionTreeNode> IterateNodesPrefix() {
      return IterateNodesPrefix(root);
    }
    private IEnumerable<SymbolicExpressionTreeNode> IterateNodesPrefix(SymbolicExpressionTreeNode node) {
      yield return node;
      foreach (var subtree in node.SubTrees) {
        foreach (var n in IterateNodesPrefix(subtree))
          yield return n;
      }
    }
    public IEnumerable<SymbolicExpressionTreeNode> IterateNodesPostfix() {
      return IterateNodesPostfix(root);
    }
    private IEnumerable<SymbolicExpressionTreeNode> IterateNodesPostfix(SymbolicExpressionTreeNode node) {
      foreach (var subtree in node.SubTrees) {
        foreach (var n in IterateNodesPrefix(subtree))
          yield return n;
      }
      yield return node;
    }

    public override IDeepCloneable Clone(Cloner cloner) {
      SymbolicExpressionTree clone = new SymbolicExpressionTree();
      cloner.RegisterClonedObject(this, clone);
      clone.ReadOnlyView = ReadOnlyView;
      clone.root = (SymbolicExpressionTreeNode)this.root.Clone();
      clone.allowedFunctionsInBranch = new Dictionary<int, IEnumerable<string>>(allowedFunctionsInBranch);
      return clone;
    }
  }
}