us.fatehi.utility.Inflection Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of schemacrawler Show documentation

SchemaCrawler is an open-source Java API that makes working with database metadata as easy as working with plain old Java objects. SchemaCrawler is also a database schema discovery and comprehension, and schema documentation tool. You can search for database schema objects using regular expressions, and output the schema and data in a readable text format. The output is designed to be diff-ed against other database schemas.

There is a newer version: 16.24.2

Show newest version

package us.fatehi.utility;

import java.util.ArrayList;
import java.util.List;
import java.util.regex.Pattern;

/**
 * Implementation of Rails' 
 * Inflections to handle singularization and pluralization of 'Rails strings'. Copied from rogueweb's port of Rails to Java.
 *
 * @author Anthony Eden
 */
public class Inflection {

  private static final List plural = new ArrayList<>();

  private static final List singular = new ArrayList<>();

  private static final List uncountable = new ArrayList<>();

  static {
    // plural is "singular to plural form"
    // singular is "plural to singular form"
    plural("$", "s");
    plural("s$", "s");
    plural("(ax|test)is$", "$1es");
    plural("(octop|vir)us$", "$1i");
    plural("(alias|status)$", "$1es");
    plural("(bu)s$", "$1ses");
    plural("(buffal|tomat)o$", "$1oes");
    plural("([ti])um$", "$1a");
    plural("sis$", "ses");
    plural("(?:([^f])fe|([lr])f)$", "$1$2ves");
    plural("(hive)$", "$1s");
    plural("([^aeiouy]|qu)y$", "$1ies");
    // plural("([^aeiouy]|qu)ies$", "$1y");
    plural("(x|ch|ss|sh)$", "$1es");
    plural("(matr|vert|ind)ix|ex$", "$1ices");
    plural("([m|l])ouse$", "$1ice");
    plural("^(ox)$", "$1en");
    plural("(quiz)$", "$1zes");

    singular("s$", "");
    singular("(n)ews$", "$1ews");
    singular("([ti])a$", "$1um");
    singular("((a)naly|(b)a|(d)iagno|(p)arenthe|(p)rogno|(s)ynop|(t)he)ses$", "$1$2sis");
    singular("(^analy)ses$", "$1sis");
    singular("([^f])ves$", "$1fe");
    singular("(hive)s$", "$1");
    singular("(tive)s$", "$1");
    singular("([lr])ves$", "$1f");
    singular("([^aeiouy]|qu)ies$", "$1y");
    singular("(s)eries$", "$1eries");
    singular("(m)ovies$", "$1ovie");
    singular("(x|ch|ss|sh)es$", "$1");
    singular("([m|l])ice$", "$1ouse");
    singular("(bus)es$", "$1");
    singular("(o)es$", "$1");
    singular("(shoe)s$", "$1");
    singular("(cris|ax|test)es$", "$1is");
    singular("(octop|vir)i$", "$1us");
    singular("(alias|status)es$", "$1");
    singular("^(ox)en", "$1");
    singular("(vert|ind)ices$", "$1ex");
    singular("(matr)ices$", "$1ix");
    singular("(quiz)zes$", "$1");

    // irregular
    irregular("person", "people");
    irregular("man", "men");
    irregular("child", "children");
    irregular("sex", "sexes");
    irregular("move", "moves");
    irregular("sleeve", "sleeves");

    uncountable("equipment");
    uncountable("information");
    uncountable("rice");
    uncountable("money");
    uncountable("species");
    uncountable("series");
    uncountable("fish");
    uncountable("sheep");

    // Collections.reverse(singular);
    // Collections.reverse(plural);
  }

  /**
   * Return true if the word is uncountable.
   *
   * @param word The word
   * @return True if it is uncountable
   */
  public static boolean isUncountable(final String word) {
    for (final String w : uncountable) {
      if (w.equalsIgnoreCase(word)) {
        return true;
      }
    }
    return false;
  }

  /**
   * Return the pluralized version of a word.
   *
   * @param word The word
   * @return The pluralized word
   */
  public static String pluralize(final String word) {
    if (Inflection.isUncountable(word)) {
      return word;
    }

    for (final Inflection inflection : plural) {
      if (inflection.match(word)) {
        return inflection.replace(word);
      }
    }
    return word;
  }

  /**
   * Return the singularized version of a word.
   *
   * @param word The word
   * @return The singularized word
   */
  public static String singularize(final String word) {
    if (Inflection.isUncountable(word)) {
      return word;
    }

    for (final Inflection inflection : singular) {
      // System.out.println(word + " matches " + inflection.pattern +
      // "? (ignore case: " + inflection.ignoreCase + ")");
      if (inflection.match(word)) {
        // System.out.println("match!");
        return inflection.replace(word);
      }
    }
    return word;
  }

  private static void irregular(final String s, final String p) {
    plural("(" + s.substring(0, 1) + ")" + s.substring(1) + "$", "$1" + p.substring(1));
    singular("(" + p.substring(0, 1) + ")" + p.substring(1) + "$", "$1" + s.substring(1));
  }

  private static void plural(final String pattern, final String replacement) {
    plural.add(0, new Inflection(pattern, replacement));
  }

  private static void singular(final String pattern, final String replacement) {
    singular.add(0, new Inflection(pattern, replacement));
  }

  private static void uncountable(final String word) {
    uncountable.add(word);
  }

  private final String pattern;

  private final String replacement;

  private final boolean ignoreCase;

  public Inflection(final String pattern) {
    this(pattern, null, true);
  }

  public Inflection(final String pattern, final String replacement) {
    this(pattern, replacement, true);
  }

  public Inflection(final String pattern, final String replacement, final boolean ignoreCase) {
    this.pattern = pattern;
    this.replacement = replacement;
    this.ignoreCase = ignoreCase;
  }

  /**
   * Does the given word match?
   *
   * @param word The word
   * @return True if it matches the inflection pattern
   */
  public boolean match(final String word) {
    int flags = 0;
    if (ignoreCase) {
      flags = flags | Pattern.CASE_INSENSITIVE;
    }
    return Pattern.compile(pattern, flags).matcher(word).find();
  }

  /**
   * Replace the word with its pattern.
   *
   * @param word The word
   * @return The result
   */
  public String replace(final String word) {
    int flags = 0;
    if (ignoreCase) {
      flags = flags | Pattern.CASE_INSENSITIVE;
    }
    return Pattern.compile(pattern, flags).matcher(word).replaceAll(replacement);
  }
}