| | | 1 | | using MoreStructures.RecImmTrees; |
| | | 2 | | |
| | | 3 | | namespace MoreStructures.CountTrees; |
| | | 4 | | |
| | | 5 | | /// <summary> |
| | | 6 | | /// An implementation of <see cref="IRecImmDictIndexedTreeEdge{TEdge, TNode}"/>, wrapping another |
| | | 7 | | /// implementation of <see cref="IRecImmDictIndexedTreeEdge{TEdge, TNode}"/>, and linking two |
| | | 8 | | /// instances of wrapper nodes <see cref="CountTreeNode{TEdge, TNode}"/>. |
| | | 9 | | /// </summary> |
| | | 10 | | /// <typeparam name="TEdge"> |
| | | 11 | | /// <inheritdoc cref="IRecImmDictIndexedTreeNode{TEdge, TNode}" path="/typeparam[@name='TEdge']"/> |
| | | 12 | | /// </typeparam> |
| | | 13 | | /// <typeparam name="TNode"> |
| | | 14 | | /// <inheritdoc cref="IRecImmDictIndexedTreeNode{TEdge, TNode}" path="/typeparam[@name='TNode']"/> |
| | | 15 | | /// </typeparam> |
| | | 16 | | /// <param name="WrappedEdge">The edge being wrapped, pointing to descendants which are going to be counted.</param> |
| | | 17 | | /// <remarks> |
| | | 18 | | /// Due to records semantics, two <see cref="CountTreeEdge{TEdge, TNode}"/> instances wrapping the |
| | | 19 | | /// same underlying edge, or two equivalent edges, will be equal. |
| | | 20 | | /// </remarks> |
| | | 21 | | /// <example> |
| | | 22 | | /// <code> |
| | | 23 | | /// Edge edge = ... |
| | | 24 | | /// CountTreeEdge<Edge, Node> countEdge = new(edge); |
| | | 25 | | /// </code> |
| | | 26 | | /// </example> |
| | 60055 | 27 | | public sealed record CountTreeEdge<TEdge, TNode>(TEdge WrappedEdge) |
| | 30018 | 28 | | : IRecImmDictIndexedTreeEdge<CountTreeEdge<TEdge, TNode>, CountTreeNode<TEdge, TNode>> |
| | 30018 | 29 | | where TEdge : IRecImmDictIndexedTreeEdge<TEdge, TNode> |
| | 30018 | 30 | | where TNode : IRecImmDictIndexedTreeNode<TEdge, TNode>; |