//////////////////////////////////////////////////////////////////////////////////////////////////// // PlotSquared - A plot manager and world generator for the Bukkit API / // Copyright (c) 2014 IntellectualSites/IntellectualCrafters / // / // This program is free software; you can redistribute it and/or modify / // it under the terms of the GNU General Public License as published by / // the Free Software Foundation; either version 3 of the License, or / // (at your option) any later version. / // / // This program 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 for more details. / // / // You should have received a copy of the GNU General Public License / // along with this program; if not, write to the Free Software Foundation, / // Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA / // / // You can contact us via: support@intellectualsites.com / //////////////////////////////////////////////////////////////////////////////////////////////////// package com.intellectualcrafters.plot.util; import java.util.ArrayList; import java.util.Collections; /** * String comparison library * * @author Citymonstret * @author Empire92 */ @SuppressWarnings("unused") public class StringComparison { private T bestMatch; private double match = Integer.MAX_VALUE; private T bestMatchObject; /** * Constructor * * @param input Input Base Value * @param objects Objects to compare */ public StringComparison(String input, final T[] objects) { init(input, objects); } /** * You should call init(...) when you are ready to get a String comparison value */ public StringComparison() {} public void init(String input, final T[] objects) { int c; this.bestMatch = objects[0]; this.bestMatchObject = objects[0]; input = input.toLowerCase(); for (final T o : objects) { if ((c = compare(input, o.toString().toLowerCase())) < this.match) { this.match = c; this.bestMatch = o; this.bestMatchObject = o; } } } /** * Compare two strings * * @param s1 String Base * @param s2 Object * * @return match */ public static int compare(final String s1, final String s2) { int distance = StringMan.getLevenshteinDistance(s1, s2); if (s2.contains(s1)) { distance -= (Math.min(s1.length(), s2.length())); } if (s2.startsWith(s1)) { distance -= 4; } return distance; } /** * Create an ArrayList containing pairs of letters * * @param s string to split * * @return ArrayList */ public static ArrayList wLetterPair(final String s) { final ArrayList aPairs = new ArrayList<>(); final String[] wo = s.split("\\s"); for (final String aWo : wo) { final String[] po = sLetterPair(aWo); Collections.addAll(aPairs, po); } return aPairs; } /** * Get an array containing letter pairs * * @param s string to split * * @return Array */ public static String[] sLetterPair(final String s) { final int numPair = s.length() - 1; final String[] p = new String[numPair]; for (int i = 0; i < numPair; i++) { p[i] = s.substring(i, i + 2); } return p; } /** * Get the object * * @return match object */ public T getMatchObject() { return this.bestMatchObject; } /** * Get the best match value * * @return match value */ public String getBestMatch() { return this.bestMatch.toString(); } /** * Will return both the match number, and the actual match string * * @return object[] containing: double, String */ public ComparisonResult getBestMatchAdvanced() { return new ComparisonResult(this.match, this.bestMatch); } /** * The comparison result */ public class ComparisonResult { public final T best; public final double match; /** * The constructor * @param match Match value * @param best Best Match */ public ComparisonResult(final double match, final T best) { this.match = match; this.best = best; } } }