resolveContexts","resolveValues","primary","updateFunc","rerrorNames","asyncError","console","warn","message","stack","readyException","readyList","completed","removeEventListener","readyWait","wait","readyState","doScroll","access","chainable","emptyGet","raw","bulk","_key","rmsPrefix","rdashAlpha","fcamelCase","_all","letter","toUpperCase","camelCase","string","acceptData","owner","Data","uid","defineProperty","configurable","set","data","prop","hasData","dataPriv","dataUser","rbrace","rmultiD...

  }

  protected Collection<Method> suppressForHashSet() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedHashSet() {
    return emptySet();
  }

  protected Collection<Method> suppressForEnumSet() {
    return emptySet();
  }

  protected Collection<Method> suppressForSynchronizedNavigableSet() {
    return emptySet();
  }

     */
    public static UpgradeResult empty() {
        return new UpgradeResult(Collections.emptySet(), Collections.emptySet(), Collections.emptySet());
    }

    /**
     * Merges this result with another result, combining the sets of POMs.
     * This allows proper aggregation of results from multiple strategies without double-counting.
     */
    public UpgradeResult merge(UpgradeResult other) {

  }

  protected Collection<Method> suppressForCheckedMap() {
    return emptySet();
  }

  protected Collection<Method> suppressForCheckedSortedMap() {
    return emptySet();
  }

  protected Collection<Method> suppressForEmptyMap() {
    return emptySet();
  }

  protected Collection<Method> suppressForSingletonMap() {
    return emptySet();
  }

  protected Collection<Method> suppressForHashMap() {

    Set<Object> set = new HashSet<>();
    assertThat(union(emptySet(), emptySet()).copyInto(set)).isSameInstanceAs(set);
    assertThat(intersection(emptySet(), emptySet()).copyInto(set)).isSameInstanceAs(set);
    assertThat(difference(emptySet(), emptySet()).copyInto(set)).isSameInstanceAs(set);
    assertThat(symmetricDifference(emptySet(), emptySet()).copyInto(set)).isSameInstanceAs(set);
  }

  }

  protected Collection<Method> suppressForArrayDeque() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedList() {
    return emptySet();
  }

  protected Collection<Method> suppressForArrayBlockingQueue() {
    return emptySet();
  }

  protected Collection<Method> suppressForConcurrentLinkedQueue() {
    return emptySet();
  }

  }

  protected Collection<Method> suppressForEmptyList() {
    return emptySet();
  }

  protected Collection<Method> suppressForSingletonList() {
    return emptySet();
  }

  protected Collection<Method> suppressForArraysAsList() {
    return emptySet();
  }

  protected Collection<Method> suppressForArrayList() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedList() {

  }

  protected Collection<Method> suppressForEmptyList() {
    return emptySet();
  }

  protected Collection<Method> suppressForSingletonList() {
    return emptySet();
  }

  protected Collection<Method> suppressForArraysAsList() {
    return emptySet();
  }

  protected Collection<Method> suppressForArrayList() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedList() {

  }

  protected Collection<Method> suppressForEmptySet() {
    return emptySet();
  }

  protected Collection<Method> suppressForSingletonSet() {
    return emptySet();
  }

  protected Collection<Method> suppressForHashSet() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedHashSet() {
    return emptySet();
  }

  protected Collection<Method> suppressForEnumSet() {

    return emptySet();
  }

  protected Collection<Method> suppressForConcurrentLinkedQueue() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedBlockingDeque() {
    return emptySet();
  }

  protected Collection<Method> suppressForLinkedBlockingQueue() {
    return emptySet();
  }

  protected Collection<Method> suppressForPriorityBlockingQueue() {
    return emptySet();
  }