class ConfusionSet {

  private final Set<ConfusionString> set = new HashSet<>();
  private final long factor;

  /**
   * @param factor the factor that one string must be more probable than the other to be considered a correction, must be &gt;= 1
   */
  public ConfusionSet(long factor, List<ConfusionString> confusionStrings) {
    if (factor < 1) {
      throw new IllegalArgumentException("factor must be >= 1: " + factor);
    }
    this.factor = factor;
    set.addAll(Objects.requireNonNull(confusionStrings));
  }

  /**
   * @param factor the factor that one string must be more probable than the other to be considered a correction, must be &gt;= 1
   */
  public ConfusionSet(long factor, String... words) {
    if (factor < 1) {
      throw new IllegalArgumentException("factor must be >= 1: " + factor);
    }
    Objects.requireNonNull(words);
    this.factor = factor;
    for (String word : words) {
      set.add(new ConfusionString(word, null));
    }
  }

  /* Alternative must be at least this much more probable to be considered correct. */
  public long getFactor() {
    return factor;
  }

  public Set<ConfusionString> getSet() {
    return Collections.unmodifiableSet(set);
  }

  public Set<ConfusionString> getUppercaseFirstCharSet() {
    Set<ConfusionString> result = new HashSet<>();
    for (ConfusionString s : set) {
      ConfusionString newString = new ConfusionString(StringTools.uppercaseFirstChar(s.getString()), s.getDescription());
      result.add(newString);
    }
    return Collections.unmodifiableSet(result);
  }

  @Override
  public String toString() {
    return set.toString();
  }

  @Override
  public boolean equals(Object o) {<FILL_FUNCTION_BODY>}

  @Override
  public int hashCode() {
    return Objects.hash(set, factor);
  }
  
}

    if (this == o) return true;
    if (o == null || getClass() != o.getClass()) return false;
    ConfusionSet other = (ConfusionSet) o;
    return Objects.equals(set, other.set) && Objects.equals(factor, other.factor);
  
<no_super_class>