class AbstractComparisonStrategy implements ComparisonStrategy {

  @Override
  public Iterable<?> duplicatesFrom(Iterable<?> iterable) {
    if (isNullOrEmpty(iterable)) return EMPTY_SET;

    Set<Object> noDuplicates = newSetUsingComparisonStrategy();
    Set<Object> duplicatesWithOrderPreserved = new LinkedHashSet<>();
    for (Object element : iterable) {
      if (noDuplicates.contains(element)) {
        duplicatesWithOrderPreserved.add(element);
      } else {
        noDuplicates.add(element);
      }
    }
    return duplicatesWithOrderPreserved;
  }

  /**
   * Returns a {@link Set} honoring the comparison strategy used.
   *
   * @return a {@link Set} honoring the comparison strategy used.
   */
  protected abstract Set<Object> newSetUsingComparisonStrategy();

  @Override
  public boolean arrayContains(Object array, Object value) {<FILL_FUNCTION_BODY>}

  @Override
  public boolean isLessThan(Object actual, Object other) {
    return !areEqual(actual, other) && !isGreaterThan(actual, other);
  }

  @Override
  public boolean isLessThanOrEqualTo(Object actual, Object other) {
    return areEqual(actual, other) || isLessThan(actual, other);
  }

  @Override
  public boolean isGreaterThanOrEqualTo(Object actual, Object other) {
    return areEqual(actual, other) || isGreaterThan(actual, other);
  }

  @Override
  public boolean isStandard() {
    return false;
  }

}

    for (int i = 0; i < getLength(array); i++) {
      Object element = Array.get(array, i);
      if (areEqual(element, value)) return true;
    }
    return false;
  
<no_super_class>