[3929] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 2002-2010 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
| 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;
|
---|
| 23 |
|
---|
| 24 | namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding {
|
---|
[4722] | 25 |
|
---|
[3929] | 26 | public class SymbolicExpressionTreeStringFormatter {
|
---|
[4722] | 27 |
|
---|
[3929] | 28 | public bool Indent { get; set; }
|
---|
[4722] | 29 |
|
---|
[3929] | 30 | public SymbolicExpressionTreeStringFormatter()
|
---|
| 31 | : base() {
|
---|
| 32 | Indent = true;
|
---|
| 33 | }
|
---|
| 34 |
|
---|
| 35 | public string Format(SymbolicExpressionTree symbolicExpressionTree) {
|
---|
| 36 | return FormatRecursively(symbolicExpressionTree.Root, 0);
|
---|
| 37 | }
|
---|
| 38 |
|
---|
| 39 | private string FormatRecursively(SymbolicExpressionTreeNode node, int indentLength) {
|
---|
| 40 | StringBuilder strBuilder = new StringBuilder();
|
---|
| 41 | if (Indent) strBuilder.Append(' ', indentLength);
|
---|
| 42 | strBuilder.Append("(");
|
---|
| 43 | // internal nodes or leaf nodes?
|
---|
| 44 | if (node.SubTrees.Count > 0) {
|
---|
| 45 | // symbol on same line as '('
|
---|
| 46 | strBuilder.AppendLine(node.ToString());
|
---|
| 47 | // each subtree expression on a new line
|
---|
| 48 | // and closing ')' also on new line
|
---|
| 49 | foreach (var subtree in node.SubTrees) {
|
---|
| 50 | strBuilder.AppendLine(FormatRecursively(subtree, indentLength + 2));
|
---|
| 51 | }
|
---|
| 52 | if (Indent) strBuilder.Append(' ', indentLength);
|
---|
| 53 | strBuilder.Append(")");
|
---|
| 54 | } else {
|
---|
| 55 | // symbol in the same line with as '(' and ')'
|
---|
| 56 | strBuilder.Append(node.ToString());
|
---|
| 57 | strBuilder.Append(")");
|
---|
| 58 | }
|
---|
| 59 | return strBuilder.ToString();
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 | }
|
---|