[WIP] TreeDictionary #6
Open
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Fix typo in summary documentation of ITree`1
Renamed ITree.cs -> ITree`1.cs ITreeNode.cs -> ITreeNode`1.cs To fulfill file name pattern.
Add interfaces for trees with more spefific node types. These are: - ITree<TValue, TNode> where TNode : ITreeNode<TValue, TNode> - ITreeNode<TValue, TNode> where TNode : ITreeNode<TValue, TNode where TNode : ITreeNode<TValue, TNode>>
Renamed TopologicalExtensionProxy
Codecov Report
@@ Coverage Diff @@
## master #6 +/- ##
=======================================
Coverage 90.86% 90.86%
=======================================
Files 6 6
Lines 230 230
=======================================
Hits 209 209
Misses 21 21Continue to review full report at Codecov.
|
Change call to vstest.
…phirSOFT.TopologicalComparison into feature/TreeDictionary
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Provides a dictionary that can lookup a value in a tree structure induced by a topological comparison.
Todo