-
Notifications
You must be signed in to change notification settings - Fork 375
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
use single best completion item for commands, options, and global opt…
…ions
- Loading branch information
Showing
4 changed files
with
117 additions
and
94 deletions.
There are no files selected for viewing
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
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
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
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
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,86 @@ | ||
| using System.CommandLine.Parsing; | ||
| using System.IO; | ||
|
|
||
| namespace System.CommandLine; | ||
|
|
||
| internal static class TokenDistances | ||
| { | ||
|
|
||
| //Based on https://blogs.msdn.microsoft.com/toub/2006/05/05/generic-levenshtein-edit-distance-with-c/ | ||
| public static int GetLevensteinDistance(string first, string second) | ||
| { | ||
| // Validate parameters | ||
| if (first is null) | ||
| { | ||
| throw new ArgumentNullException(nameof(first)); | ||
| } | ||
|
|
||
| if (second is null) | ||
| { | ||
| throw new ArgumentNullException(nameof(second)); | ||
| } | ||
|
|
||
|
|
||
| // Get the length of both. If either is 0, return | ||
| // the length of the other, since that number of insertions | ||
| // would be required. | ||
|
|
||
| int n = first.Length, m = second.Length; | ||
| if (n == 0) return m; | ||
| if (m == 0) return n; | ||
|
|
||
|
|
||
| // Rather than maintain an entire matrix (which would require O(n*m) space), | ||
| // just store the current row and the next row, each of which has a length m+1, | ||
| // so just O(m) space. Initialize the current row. | ||
|
|
||
| int curRow = 0, nextRow = 1; | ||
| int[][] rows = { new int[m + 1], new int[m + 1] }; | ||
|
|
||
| for (int j = 0; j <= m; ++j) | ||
| { | ||
| rows[curRow][j] = j; | ||
| } | ||
|
|
||
| // For each virtual row (since we only have physical storage for two) | ||
| for (int i = 1; i <= n; ++i) | ||
| { | ||
| // Fill in the values in the row | ||
| rows[nextRow][0] = i; | ||
| for (int j = 1; j <= m; ++j) | ||
| { | ||
| int dist1 = rows[curRow][j] + 1; | ||
| int dist2 = rows[nextRow][j - 1] + 1; | ||
| int dist3 = rows[curRow][j - 1] + (first[i - 1].Equals(second[j - 1]) ? 0 : 1); | ||
|
|
||
| rows[nextRow][j] = Math.Min(dist1, Math.Min(dist2, dist3)); | ||
| } | ||
|
|
||
|
|
||
| // Swap the current and next rows | ||
| if (curRow == 0) | ||
| { | ||
| curRow = 1; | ||
| nextRow = 0; | ||
| } | ||
| else | ||
| { | ||
| curRow = 0; | ||
| nextRow = 1; | ||
| } | ||
| } | ||
|
|
||
| // Return the computed edit distance | ||
| return rows[curRow][m]; | ||
|
|
||
| } | ||
|
|
||
| ///<summary>Measures the length of the common starting substring of two strings</summary> | ||
| public static int GetStartsWithDistance(string first, string second) | ||
| { | ||
| int i; | ||
| for (i = 0; i < first.Length && i < second.Length && first[i] == second[i]; i++) | ||
| { } | ||
| return i; | ||
| } | ||
| } |