Skip to content

Commit b2de2f2

Browse files
Spacing issue resolved per copilot pr requirement.
1 parent 17d35f1 commit b2de2f2

1 file changed

Lines changed: 3 additions & 3 deletions

File tree

src/F23.StringSimilarity/NormalizedLevenshtein.cs

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -46,12 +46,12 @@ public class NormalizedLevenshtein : INormalizedStringDistance, INormalizedStrin
4646
/// <exception cref="ArgumentNullException">If s1 or s2 is null.</exception>
4747
public double Distance(string s1, string s2)
4848
=> Distance(s1.AsSpan(), s2.AsSpan());
49-
49+
5050
/// <summary>
5151
/// Calculates the normalized distance between two sequences of elements.
5252
/// </summary>
5353
/// <remarks>The distance is normalized by the length of the longer sequence. This ensures the
54-
/// result is always in the range [0.0, 1.0], where 0.0 indicates identical sequences and 1.0 indicates
54+
/// result is always in the range [0.0, 1.0], where 0.0 indicates identical sequences and 1.0 indicates
5555
/// maximum dissimilarity.</remarks>
5656
/// <typeparam name="T">The type of elements in the sequences. Must implement <see cref="IEquatable{T}"/>.</typeparam>
5757
/// <param name="s1">The first sequence to compare. Cannot be empty or null.</param>
@@ -96,7 +96,7 @@ public double Distance<T>(ReadOnlySpan<T> s1, ReadOnlySpan<T> s2)
9696
/// <exception cref="ArgumentNullException">If s1 or s2 is null.</exception>
9797
public double Similarity(string s1, string s2)
9898
=> 1.0 - Distance(s1, s2);
99-
99+
100100
/// <summary>
101101
/// Calculates the similarity between two sequences based on their distance.
102102
/// </summary>

0 commit comments

Comments
 (0)