newTop.right = right.removeMin(newTop);
        newTop.left = left;
        newTop.distinctElements = distinctElements - 1;
        newTop.totalCount = totalCount - oldElemCount;
        return newTop.rebalance();
      }
    }

    // Removes the minimum node from this subtree to be reused elsewhere
    private @Nullable AvlNode<E> removeMin(AvlNode<E> node) {
      if (left == null) {

        newTop.right = right.removeMin(newTop);
        newTop.left = left;
        newTop.distinctElements = distinctElements - 1;
        newTop.totalCount = totalCount - oldElemCount;
        return newTop.rebalance();
      }
    }

    // Removes the minimum node from this subtree to be reused elsewhere
    private @Nullable AvlNode<E> removeMin(AvlNode<E> node) {
      if (left == null) {

    assertTrue(
        removeIf(
            list,
            new Predicate<String>() {
              @Override
              public boolean apply(String s) {
                return s.equals("b") || s.equals("d") || s.equals("f");
              }
            }));
    assertEquals(newArrayList("a", "c", "e"), list);
    assertFalse(
        removeIf(
            list,

        // Clean up account attempts
        accountAttempts.entrySet().removeIf(entry -> {
            AccountAttempts account = entry.getValue();
            return !account.isLockedOut() && account.getLastAttempt().plus(cleanupInterval).isBefore(now);
        });

        // Clean up IP attempts
        ipAttempts.entrySet().removeIf(entry -> {
            IpAttempts ip = entry.getValue();

        // Clean up old failure records
        long now = System.currentTimeMillis();
        lastFailureTimes.entrySet().removeIf(entry -> now - entry.getValue() > FAILURE_RECOVERY_TIME * 2);

        // Clean up old consecutive failure counters
        consecutiveFailures.entrySet().removeIf(entry -> {
            String key = entry.getKey();
            Long lastFailure = lastFailureTimes.get(key);

        T transform(@ParametricNullness F from) {
          return function.apply(from);
        }
      };
    }

    @Override
    public boolean removeIf(Predicate<? super T> filter) {
      checkNotNull(filter);
      return fromList.removeIf(element -> filter.test(function.apply(element)));
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /**

                  return map.entrySet().remove(o);
                }

                @Override
                public boolean removeIf(Predicate<? super Entry<String, String>> filter) {
                  return map.entrySet().removeIf(filter);
                }

                @Override
                public boolean containsAll(Collection<?> c) {

   * @since 2.0
   */
  @CanIgnoreReturnValue
  public static <T extends @Nullable Object> boolean removeIf(
      Iterable<T> removeFrom, Predicate<? super T> predicate) {
    if (removeFrom instanceof Collection) {
      return ((Collection<T>) removeFrom).removeIf(predicate);
    }
    return Iterators.removeIf(removeFrom.iterator(), predicate);
  }

        if (shutdown) {
            return;
        }

        lock.writeLock().lock();
        try {
            // Clean up expired handles
            handles.entrySet().removeIf(entry -> {
                HandleInfo info = entry.getValue();
                if (info.isExpired() && !info.isReconnecting()) {
                    guidToHandle.remove(info.getCreateGuid());

   */
  @CanIgnoreReturnValue
  public static <T extends @Nullable Object> boolean removeIf(
      Iterable<T> removeFrom, Predicate<? super T> predicate) {
    if (removeFrom instanceof RandomAccess && removeFrom instanceof List) {
      return removeIfFromRandomAccessList((List<T>) removeFrom, checkNotNull(predicate));
    }
    return Iterators.removeIf(removeFrom.iterator(), predicate);
  }