Commit5fea6e2

committed

Javadoc

1 parent2f50c4f commit5fea6e2Copy full SHA for 5fea6e2

File tree

-1

lines changed

src/main/java/org/apache/commons/text/similarity
- LevenshteinDetailedDistance.java

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -314,7 +314,7 @@ private static <E> LevenshteinResults unlimitedCompare(SimilarityInput<E> left,`
`314`	`314`	`* p, the second int[]. Doing so allows us to retain the previous cost counts as required by the algorithm (taking the minimum of the cost count to the`
`315`	`315`	`* left, up one, and diagonally up and to the left of the current cost count being calculated). (Note that the arrays aren't really copied anymore, just`
`316`	`316`	`* switched...this is clearly much better than cloning an array or doing a System.arraycopy() each time through the outer loop.)`
`317`		`- *`
	`317`	`+ *`
`318`	`318`	`* Effectively, the difference between the two implementations is this one does not cause an out of memory condition when calculating the LD over two`
`319`	`319`	`* very large strings.`
`320`	`320`	`*/`

Comments

(0)