Tue, 06 Mar 2012 16:09:35 -0800
7150322: Stop using drop source bundles in jaxws
Reviewed-by: darcy, ohrstrom
ohair@286 | 1 | /* |
ohair@286 | 2 | * Copyright (c) 1997, 2011, Oracle and/or its affiliates. All rights reserved. |
ohair@286 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
ohair@286 | 4 | * |
ohair@286 | 5 | * This code is free software; you can redistribute it and/or modify it |
ohair@286 | 6 | * under the terms of the GNU General Public License version 2 only, as |
ohair@286 | 7 | * published by the Free Software Foundation. Oracle designates this |
ohair@286 | 8 | * particular file as subject to the "Classpath" exception as provided |
ohair@286 | 9 | * by Oracle in the LICENSE file that accompanied this code. |
ohair@286 | 10 | * |
ohair@286 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
ohair@286 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
ohair@286 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
ohair@286 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
ohair@286 | 15 | * accompanied this code). |
ohair@286 | 16 | * |
ohair@286 | 17 | * You should have received a copy of the GNU General Public License version |
ohair@286 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
ohair@286 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
ohair@286 | 20 | * |
ohair@286 | 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
ohair@286 | 22 | * or visit www.oracle.com if you need additional information or have any |
ohair@286 | 23 | * questions. |
ohair@286 | 24 | */ |
ohair@286 | 25 | |
ohair@286 | 26 | package com.sun.xml.internal.bind.v2.util; |
ohair@286 | 27 | |
ohair@286 | 28 | import java.util.Collection; |
ohair@286 | 29 | import java.util.Arrays; |
ohair@286 | 30 | |
ohair@286 | 31 | /** |
ohair@286 | 32 | * Computes the string edit distance. |
ohair@286 | 33 | * |
ohair@286 | 34 | * <p> |
ohair@286 | 35 | * Refer to a computer science text book for the definition |
ohair@286 | 36 | * of the "string edit distance". |
ohair@286 | 37 | * |
ohair@286 | 38 | * @author |
ohair@286 | 39 | * Kohsuke Kawaguchi (kohsuke.kawaguchi@sun.com) |
ohair@286 | 40 | */ |
ohair@286 | 41 | public class EditDistance { |
ohair@286 | 42 | |
ohair@286 | 43 | /** |
ohair@286 | 44 | * Computes the edit distance between two strings. |
ohair@286 | 45 | * |
ohair@286 | 46 | * <p> |
ohair@286 | 47 | * The complexity is O(nm) where n=a.length() and m=b.length(). |
ohair@286 | 48 | */ |
ohair@286 | 49 | public static int editDistance( String a, String b ) { |
ohair@286 | 50 | return new EditDistance(a,b).calc(); |
ohair@286 | 51 | } |
ohair@286 | 52 | |
ohair@286 | 53 | /** |
ohair@286 | 54 | * Finds the string in the <code>group</code> closest to |
ohair@286 | 55 | * <code>key</code> and returns it. |
ohair@286 | 56 | * |
ohair@286 | 57 | * @return null if group.length==0. |
ohair@286 | 58 | */ |
ohair@286 | 59 | public static String findNearest( String key, String[] group ) { |
ohair@286 | 60 | return findNearest(key, Arrays.asList(group)); |
ohair@286 | 61 | } |
ohair@286 | 62 | |
ohair@286 | 63 | /** |
ohair@286 | 64 | * Finds the string in the <code>group</code> closest to |
ohair@286 | 65 | * <code>key</code> and returns it. |
ohair@286 | 66 | * |
ohair@286 | 67 | * @return null if group.length==0. |
ohair@286 | 68 | */ |
ohair@286 | 69 | public static String findNearest( String key, Collection<String> group ) { |
ohair@286 | 70 | int c = Integer.MAX_VALUE; |
ohair@286 | 71 | String r = null; |
ohair@286 | 72 | |
ohair@286 | 73 | for (String s : group) { |
ohair@286 | 74 | int ed = editDistance(key,s); |
ohair@286 | 75 | if( c>ed ) { |
ohair@286 | 76 | c = ed; |
ohair@286 | 77 | r = s; |
ohair@286 | 78 | } |
ohair@286 | 79 | } |
ohair@286 | 80 | return r; |
ohair@286 | 81 | } |
ohair@286 | 82 | |
ohair@286 | 83 | /** cost vector. */ |
ohair@286 | 84 | private int[] cost; |
ohair@286 | 85 | /** back buffer. */ |
ohair@286 | 86 | private int[] back; |
ohair@286 | 87 | |
ohair@286 | 88 | /** Two strings to be compared. */ |
ohair@286 | 89 | private final String a,b; |
ohair@286 | 90 | |
ohair@286 | 91 | private EditDistance( String a, String b ) { |
ohair@286 | 92 | this.a=a; |
ohair@286 | 93 | this.b=b; |
ohair@286 | 94 | cost = new int[a.length()+1]; |
ohair@286 | 95 | back = new int[a.length()+1]; // back buffer |
ohair@286 | 96 | |
ohair@286 | 97 | for( int i=0; i<=a.length(); i++ ) |
ohair@286 | 98 | cost[i] = i; |
ohair@286 | 99 | } |
ohair@286 | 100 | |
ohair@286 | 101 | /** |
ohair@286 | 102 | * Swaps two buffers. |
ohair@286 | 103 | */ |
ohair@286 | 104 | private void flip() { |
ohair@286 | 105 | int[] t = cost; |
ohair@286 | 106 | cost = back; |
ohair@286 | 107 | back = t; |
ohair@286 | 108 | } |
ohair@286 | 109 | |
ohair@286 | 110 | private int min(int a,int b,int c) { |
ohair@286 | 111 | return Math.min(a,Math.min(b,c)); |
ohair@286 | 112 | } |
ohair@286 | 113 | |
ohair@286 | 114 | private int calc() { |
ohair@286 | 115 | for( int j=0; j<b.length(); j++ ) { |
ohair@286 | 116 | flip(); |
ohair@286 | 117 | cost[0] = j+1; |
ohair@286 | 118 | for( int i=0; i<a.length(); i++ ) { |
ohair@286 | 119 | int match = (a.charAt(i)==b.charAt(j))?0:1; |
ohair@286 | 120 | cost[i+1] = min( back[i]+match, cost[i]+1, back[i+1]+1 ); |
ohair@286 | 121 | } |
ohair@286 | 122 | } |
ohair@286 | 123 | return cost[a.length()]; |
ohair@286 | 124 | } |
ohair@286 | 125 | } |