[4803] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[9456] | 3 | * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4803] | 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.Text;
|
---|
[5499] | 23 | using System.Linq;
|
---|
[4820] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Common;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
[4803] | 27 |
|
---|
[5499] | 28 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
[4820] | 29 |
|
---|
[9862] | 30 | [Item("Default String Formatter", "The default string formatter for symbolic expression trees.")]
|
---|
[4820] | 31 | [StorableClass]
|
---|
| 32 | public class SymbolicExpressionTreeStringFormatter : NamedItem, ISymbolicExpressionTreeStringFormatter {
|
---|
| 33 |
|
---|
[4803] | 34 | public bool Indent { get; set; }
|
---|
[4820] | 35 |
|
---|
| 36 | [StorableConstructor]
|
---|
| 37 | protected SymbolicExpressionTreeStringFormatter(bool deserializing) : base(deserializing) { }
|
---|
[4840] | 38 | protected SymbolicExpressionTreeStringFormatter(SymbolicExpressionTreeStringFormatter original, Cloner cloner)
|
---|
| 39 | : base(original, cloner) {
|
---|
| 40 | Indent = original.Indent;
|
---|
| 41 | }
|
---|
[4803] | 42 | public SymbolicExpressionTreeStringFormatter()
|
---|
| 43 | : base() {
|
---|
[4840] | 44 | Name = "Default String Formatter";
|
---|
[4803] | 45 | Indent = true;
|
---|
| 46 | }
|
---|
| 47 |
|
---|
[5510] | 48 | public string Format(ISymbolicExpressionTree symbolicExpressionTree) {
|
---|
[4803] | 49 | return FormatRecursively(symbolicExpressionTree.Root, 0);
|
---|
| 50 | }
|
---|
| 51 |
|
---|
[5499] | 52 | private string FormatRecursively(ISymbolicExpressionTreeNode node, int indentLength) {
|
---|
[4803] | 53 | StringBuilder strBuilder = new StringBuilder();
|
---|
| 54 | if (Indent) strBuilder.Append(' ', indentLength);
|
---|
| 55 | strBuilder.Append("(");
|
---|
| 56 | // internal nodes or leaf nodes?
|
---|
[5733] | 57 | if (node.Subtrees.Count() > 0) {
|
---|
[4803] | 58 | // symbol on same line as '('
|
---|
| 59 | strBuilder.AppendLine(node.ToString());
|
---|
| 60 | // each subtree expression on a new line
|
---|
| 61 | // and closing ')' also on new line
|
---|
[5733] | 62 | foreach (var subtree in node.Subtrees) {
|
---|
[4803] | 63 | strBuilder.AppendLine(FormatRecursively(subtree, indentLength + 2));
|
---|
| 64 | }
|
---|
| 65 | if (Indent) strBuilder.Append(' ', indentLength);
|
---|
| 66 | strBuilder.Append(")");
|
---|
| 67 | } else {
|
---|
| 68 | // symbol in the same line with as '(' and ')'
|
---|
| 69 | strBuilder.Append(node.ToString());
|
---|
| 70 | strBuilder.Append(")");
|
---|
| 71 | }
|
---|
| 72 | return strBuilder.ToString();
|
---|
| 73 | }
|
---|
[4820] | 74 |
|
---|
| 75 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 76 | return new SymbolicExpressionTreeStringFormatter(this, cloner);
|
---|
| 77 | }
|
---|
[4803] | 78 | }
|
---|
| 79 | }
|
---|