while (entryItr.hasNext()) {
      Entry<K, V> entry = entryItr.next();
      entry.setValue(e3().getValue());
      entryItr.remove();
    }
    assertTrue(getMap().isEmpty());
  }

  public void testContainsEntryWithIncomparableKey() {
    try {
      assertFalse(getMap().entrySet().contains(mapEntry(IncomparableType.INSTANCE, v0())));
    } catch (ClassCastException acceptable) {

    while (entryItr.hasNext()) {
      Entry<K, V> entry = entryItr.next();
      entry.setValue(e3().getValue());
      entryItr.remove();
    }
    assertTrue(getMap().isEmpty());
  }

  public void testContainsEntryWithIncomparableKey() {
    try {
      assertFalse(getMap().entrySet().contains(mapEntry(IncomparableType.INSTANCE, v0())));
    } catch (ClassCastException acceptable) {

     */
    public V getAt(final int index) {
        return getEntryAt(index).getValue();
    }

    /**
     * Returns the key at the specified index.
     *
     * @param index
     *            the index
     * @return the key at the specified index
     */
    public K getKeyAt(final int index) {
        return getEntryAt(index).getKey();
    }

    /**

    Object key = new Object();
    assertThat(cache.getUnchecked(key)).isSameInstanceAs(computed);
    RemovalNotification<Object, Object> notification = listener.remove();
    assertThat(notification.getKey()).isSameInstanceAs(key);
    assertThat(notification.getValue()).isSameInstanceAs(computed);
    assertThat(notification.getCause()).isEqualTo(RemovalCause.SIZE);
    assertThat(listener.isEmpty()).isTrue();

    Object key = new Object();
    assertThat(cache.getUnchecked(key)).isSameInstanceAs(computed);
    RemovalNotification<Object, Object> notification = listener.remove();
    assertThat(notification.getKey()).isSameInstanceAs(key);
    assertThat(notification.getValue()).isSameInstanceAs(computed);
    assertThat(notification.getCause()).isEqualTo(RemovalCause.SIZE);
    assertThat(listener.isEmpty()).isTrue();

        } else if (Constants.NTLM.equals(scheme)) {
            final Properties props = new Properties();
            paramMap.entrySet().stream().filter(e -> e.getKey().startsWith("jcifs.")).forEach(e -> {
                props.setProperty(e.getKey(), e.getValue());
            });
            authScheme = new NTLMScheme(new JcifsEngine(props));
        } else if (Constants.FORM.equals(scheme)) {

      return new WrappedSortedSet(
          getKey(),
          getSortedSetDelegate().headSet(toElement),
          (getAncestor() == null) ? this : getAncestor());
    }

    @Override
    public SortedSet<V> subSet(@ParametricNullness V fromElement, @ParametricNullness V toElement) {
      refreshIfEmpty();
      return new WrappedSortedSet(
          getKey(),

                    final Boolean b = (Boolean) xObj.value();
                    putResultDataBody(dataMap, entry.getKey(), b.toString());
                    break;
                case NUMBER:
                    final Number d = (Number) xObj.value();
                    putResultDataBody(dataMap, entry.getKey(), d.toString());
                    break;
                case STRING:

    /**
     * Adds an entry to the built multimap.
     *
     * @since 11.0
     */
    @CanIgnoreReturnValue
    public Builder<K, V> put(Entry<? extends K, ? extends V> entry) {
      return put(entry.getKey(), entry.getValue());
    }

    /**
     * Adds entries to the built multimap.
     *
     * @since 19.0
     */
    @CanIgnoreReturnValue

            }).forEach(e -> {
                if (logger.isDebugEnabled()) {
                    logger.debug("system.properties: setProperty({}, {})", e.getKey(), e.getValue());
                }
                System.setProperty(e.getKey(), e.getValue());
            });
        }
    }

    /**
     * Updates the application configuration.
     *