tedkulp/Readarr
1
0
Fork 0
mirror of https://github.com/Readarr/Readarr.git synced 2026-04-25 22:36:59 -04:00
Code Issues Projects Releases Wiki Activity

Enforce rule IDE0005 on build

Browse Source 
(cherry picked from commit 6b1e4ef81938d264a2ddc8b626b0502f799aa640)

Closes #2555
This commit is contained in:
Bogdan
2023-05-28 02:53:49 +03:00
parent 0a43481aed
commit c98f4512df
6 changed files with 47 additions and 40 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/NzbDrone.Common/Extensions/BerghelRoach.cs
+28 -28
View File
@@ -356,34 +356,34 @@ namespace NzbDrone.Common.Extensions
}
/**
* Computes the highest row in which the distance {@code p} appears
* in diagonal {@code k} of the edit distance computation for
* strings {@code a} and {@code b}. The diagonal number is
* represented by the difference in the indices for the two strings;
* it can range from {@code -b.length()} through {@code a.length()}.
*
* More precisely, this computes the highest value x such that
* <pre>
* p = edit-distance(a[0:(x+k)), b[0:x)).
* </pre>
*
* This is the "f" function described by Ukkonen.
*
* The caller must assure that abs(k) &le; p, the only values for
* which this is well-defined.
*
* The implementation depends on the cached results of prior
* computeRow calls for diagonals k-1, k, and k+1 for distance p-1.
* These must be supplied in {@code knownLeft}, {@code knownAbove},
* and {@code knownRight}, respectively.
* @param k diagonal number
* @param p edit distance
* @param a one string to be compared
* @param b other string to be compared
* @param knownLeft value of {@code computeRow(k-1, p-1, ...)}
* @param knownAbove value of {@code computeRow(k, p-1, ...)}
* @param knownRight value of {@code computeRow(k+1, p-1, ...)}
*/
* Computes the highest row in which the distance {@code p} appears
* in diagonal {@code k} of the edit distance computation for
* strings {@code a} and {@code b}. The diagonal number is
* represented by the difference in the indices for the two strings;
* it can range from {@code -b.length()} through {@code a.length()}.
*
* More precisely, this computes the highest value x such that
* <pre>
* p = edit-distance(a[0:(x+k)), b[0:x)).
* </pre>
*
* This is the "f" function described by Ukkonen.
*
* The caller must assure that abs(k) &#x2264; p, the only values for
* which this is well-defined.
*
* The implementation depends on the cached results of prior
* computeRow calls for diagonals k-1, k, and k+1 for distance p-1.
* These must be supplied in {@code knownLeft}, {@code knownAbove},
* and {@code knownRight}, respectively.
* @param k diagonal number
* @param p edit distance
* @param a one string to be compared
* @param b other string to be compared
* @param knownLeft value of {@code computeRow(k-1, p-1, ...)}
* @param knownAbove value of {@code computeRow(k, p-1, ...)}
* @param knownRight value of {@code computeRow(k+1, p-1, ...)}
*/
private static int ComputeRow(int k,
int p,
char[] a,