com.github.dylon.liblevenshtein.levenshtein.distance.AbstractMemoized Maven / Gradle / Ivy

Go to download

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

A library for spelling-correction based on Levenshtein Automata.

There is a newer version: 2.2.2

// Generated by delombok at Mon Apr 04 11:50:59 PDT 2016
package com.github.dylon.liblevenshtein.levenshtein.distance;

import lombok.NonNull;
import it.unimi.dsi.fastutil.objects.Object2IntMap;
import it.unimi.dsi.fastutil.objects.Object2IntOpenHashMap;
import com.github.dylon.liblevenshtein.collection.SymmetricImmutablePair;
import com.github.dylon.liblevenshtein.levenshtein.IDistance;

/**
 * Common, initialization logic for memoized, distance metrics.
 * @author Dylon Edwards
 * @since 2.1.0
 */
public abstract class AbstractMemoized implements IDistance {
  /**
   * Default return value of memoized distances when no record exists.
   */
  protected static final int DEFAULT_RETURN_VALUE = -1;
  /**
   * Memoizes the distance pairs of terms.
   */
  protected final Object2IntMap> memo;

  /**
   * Initializes the memoization map, etc.
   */
  public AbstractMemoized() {
    memo = new Object2IntOpenHashMap>();
    memo.defaultReturnValue(DEFAULT_RETURN_VALUE);
  }

  /**
   * If {@code t} is less than the length of {@code u}, then return the
   * substring of {@code u} beginning at {@code 1 + t}; Otherwise, return an
   * empty string. It is assumed that {@code u} and {@code v} are not null.
   * @param u String to slice
   * @param t Lower bound of the index at which to slice {@code u}
   * @return The substring of {@code u} beginning at index, {@code 1 + t}, if
   * {@code t} is less than the length of {@code u}, or an empty string
   * otherwise.
   */
  public String f(final String u, final int t) {
    if (t < u.length()) {
      return u.substring(1 + t);
    }
    return "";
  }

  /**
   * {@inheritDoc}
   */
  @Override
  public int between(@NonNull final String v, @NonNull final String w) {
    if (v == null) {
      throw new java.lang.IllegalArgumentException("v is null");
    }
    if (w == null) {
      throw new java.lang.IllegalArgumentException("w is null");
    }
    // Don't want to check for nullity on each recursion ...
    return memoizedDistance(v, w);
  }

  /**
   * Memoizes the distance between terms, {@code v} and {@code w}, and returns
   * it.
   * @param v Term to compare with {@code w}
   * @param w Term to compare with {@code v}
   * @return Distance between {@code v} and {@code w}
   */
  public abstract int memoizedDistance(String v, String w);
}