JAXB OSGI 4.0.9 · org.glassfish.jaxb.core.v2.util.EditDistance

Field Summary

Modifier and Type	Field and Description
private final String	a Two strings to be compared.
private final String	b Two strings to be compared.
private int[]	back back buffer.
private static final WeakHashMap<AbstractMap.SimpleEntry<String, String>, Integer>	CACHE Weak results cache to avoid additional computations.
private int[]	cost cost vector.

Access	Constructor and Description
private	EditDistance(String a, String b)

Modifier and Type	Method and Description
private int	calc()
public static int	editDistance(String a, String b) Computes the edit distance between two strings.
public static String	Returns: null if group.length==0. findNearest(String key, String[] group) Finds the string in the `group` closest to `key` and returns it.
public static String	Returns: null if group.length==0. findNearest(String key, Collection<String> group) Finds the string in the `group` closest to `key` and returns it.
private void	flip() Swaps two buffers.
private int	min(int a, int b, int c)

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

a	back to summary
private final String a Two strings to be compared.

b	back to summary
private final String b Two strings to be compared.

back	back to summary
private int[] back back buffer.

CACHE	back to summary
private static final WeakHashMap<AbstractMap.SimpleEntry<String, String>, Integer> CACHE Weak results cache to avoid additional computations. Because of high complexity caching is required.

cost	back to summary
private int[] cost cost vector.

EditDistance	back to summary
private EditDistance(String a, String b)

calc	back to summary
private int calc()

editDistance	back to summary
public static int editDistance(String a, String b) Computes the edit distance between two strings. The complexity is O(nm) where n=a.length() and m=b.length().

editDistance

public static int editDistance(String a, String b)

Computes the edit distance between two strings.

The complexity is O(nm) where n=a.length() and m=b.length().

findNearest back to summary

findNearest	back to summary
public static String findNearest(String key, String[] group) Finds the string in the `group` closest to `key` and returns it. Returns:String null if group.length==0.

public static String findNearest(String key, String[] group)

Finds the string in the group closest to key and returns it.

findNearest back to summary

findNearest	back to summary
public static String findNearest(String key, Collection<String> group) Finds the string in the `group` closest to `key` and returns it. Returns:String null if group.length==0.

public static String findNearest(String key, Collection<String> group)

Finds the string in the group closest to key and returns it.

flip	back to summary
private void flip() Swaps two buffers.

min	back to summary
private int min(int a, int b, int c)