diff -r 000000000000 -r 373ffda63c9a src/share/jaxws_classes/com/sun/xml/internal/bind/v2/util/EditDistance.java --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/src/share/jaxws_classes/com/sun/xml/internal/bind/v2/util/EditDistance.java Wed Apr 27 01:27:09 2016 +0800 @@ -0,0 +1,143 @@ +/* + * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. + * + * This code is free software; you can redistribute it and/or modify it + * under the terms of the GNU General Public License version 2 only, as + * published by the Free Software Foundation. Oracle designates this + * particular file as subject to the "Classpath" exception as provided + * by Oracle in the LICENSE file that accompanied this code. + * + * This code is distributed in the hope that it will be useful, but WITHOUT + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or + * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License + * version 2 for more details (a copy is included in the LICENSE file that + * accompanied this code). + * + * You should have received a copy of the GNU General Public License version + * 2 along with this work; if not, write to the Free Software Foundation, + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. + * + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA + * or visit www.oracle.com if you need additional information or have any + * questions. + */ + +package com.sun.xml.internal.bind.v2.util; + +import java.util.AbstractMap; +import java.util.Arrays; +import java.util.Collection; +import java.util.WeakHashMap; + +/** + * Computes the string edit distance. + * + *
+ * Refer to a computer science text book for the definition
+ * of the "string edit distance".
+ *
+ * @author
+ * Kohsuke Kawaguchi (kohsuke.kawaguchi@sun.com)
+ */
+public class EditDistance {
+
+ /**
+ * Weak results cache to avoid additional computations.
+ * Because of high complexity caching is required.
+ */
+ private static final WeakHashMap
+ * The complexity is O(nm) where n=a.length() and m=b.length().
+ */
+ public static int editDistance( String a, String b ) {
+ // let's check cache
+ AbstractMap.SimpleEntrygroup
closest to
+ * key
and returns it.
+ *
+ * @return null if group.length==0.
+ */
+ public static String findNearest( String key, String[] group ) {
+ return findNearest(key, Arrays.asList(group));
+ }
+
+ /**
+ * Finds the string in the group
closest to
+ * key
and returns it.
+ *
+ * @return null if group.length==0.
+ */
+ public static String findNearest( String key, Collection