| | | 1 | | namespace MoreStructures.RecImmTrees.Conversions; |
| | | 2 | | |
| | | 3 | | /// <summary> |
| | | 4 | | /// <inheritdoc/> |
| | | 5 | | /// Recursive implementation. |
| | | 6 | | /// </summary> |
| | | 7 | | /// <typeparam name="TEdge">The type of edges of the specific structure.</typeparam> |
| | | 8 | | /// <typeparam name="TNode">The type of nodes of the specific structure.</typeparam> |
| | | 9 | | /// <remarks> |
| | | 10 | | /// <inheritdoc cref="IStringifier{TEdge, TNode}" path="/remarks"/> |
| | | 11 | | /// <para id="advantages"> |
| | | 12 | | /// ADVANTAGES AND DISADVANTAGES |
| | | 13 | | /// <br/> |
| | | 14 | | /// Implemented fully recursively, so limited by stack depth and usable with tree of a "reasonable" height. |
| | | 15 | | /// </para> |
| | | 16 | | /// </remarks> |
| | | 17 | | public class FullyRecursiveStringifier<TEdge, TNode> |
| | | 18 | | : StringifierBase<TEdge, TNode>, IStringifier<TEdge, TNode> |
| | | 19 | | where TEdge : IRecImmDictIndexedTreeEdge<TEdge, TNode>, IComparable<TEdge> |
| | | 20 | | where TNode : IRecImmDictIndexedTreeNode<TEdge, TNode> |
| | | 21 | | { |
| | | 22 | | /// <inheritdoc path="//*[not(self::remarks)]"/> |
| | | 23 | | /// <inheritdoc cref="FullyRecursiveStringifier{TEdge, TNode}" path="/remarks"/> |
| | | 24 | | public FullyRecursiveStringifier( |
| | | 25 | | Func<TNode, string> rootStringifier, Func<TEdge, TNode, string> edgeAndNodeStringifier) |
| | 12 | 26 | | : base(rootStringifier, edgeAndNodeStringifier) |
| | 12 | 27 | | { |
| | 12 | 28 | | } |
| | | 29 | | |
| | | 30 | | /// <inheritdoc path="//*[not(self::remarks)]"/> |
| | | 31 | | /// <inheritdoc cref="FullyRecursiveStringifier{TEdge, TNode}" path="/remarks"/> |
| | | 32 | | public override string Stringify(TNode node) |
| | 7 | 33 | | { |
| | 7 | 34 | | var stringBuilder = new StringBuilder(); |
| | 7 | 35 | | stringBuilder.Append(RootStringifier(node)); |
| | 7 | 36 | | Stringify(stringBuilder, node, 0); |
| | 7 | 37 | | return stringBuilder.ToString(); |
| | 7 | 38 | | } |
| | | 39 | | |
| | | 40 | | private void Stringify(StringBuilder stringBuilder, TNode node, int level) |
| | 122 | 41 | | { |
| | 711 | 42 | | foreach (var (childEdge, childNode) in node.Children.OrderBy(c => c.Key)) |
| | 115 | 43 | | { |
| | 115 | 44 | | stringBuilder.Append(NewLine); |
| | 9948 | 45 | | for (int i = 0; i < level; i++) |
| | 4859 | 46 | | stringBuilder.Append(Indent); |
| | 115 | 47 | | stringBuilder.Append($"{Indent}{EdgeAndNodeStringifier(childEdge, childNode)}"); |
| | 115 | 48 | | Stringify(stringBuilder, childNode, level + 1); |
| | 115 | 49 | | } |
| | 122 | 50 | | } |
| | | 51 | | |
| | | 52 | | |
| | | 53 | | /// <inheritdoc path="//*[not(self::remarks)]"/> |
| | | 54 | | /// <inheritdoc cref="FullyRecursiveStringifier{TEdge, TNode}" path="/remarks"/> |
| | | 55 | | public override string Stringify(TreePath<TEdge, TNode> path) => |
| | 3 | 56 | | string.Join(PathSeparator, Stringify(path.PathNodes)); |
| | | 57 | | |
| | | 58 | | private IEnumerable<string> Stringify(IEnumerable<KeyValuePair<TEdge, TNode>> pathNodes) |
| | 7 | 59 | | { |
| | 7 | 60 | | if (!pathNodes.Any()) |
| | 3 | 61 | | yield break; |
| | | 62 | | |
| | 4 | 63 | | var nextPathNode = pathNodes.First(); |
| | 4 | 64 | | yield return EdgeAndNodeStringifier(nextPathNode.Key, nextPathNode.Value); |
| | | 65 | | |
| | 18 | 66 | | foreach (var fragment in Stringify(pathNodes.Skip(1))) |
| | 3 | 67 | | yield return fragment; |
| | 4 | 68 | | } |
| | | 69 | | } |