}
  }

  // Returned from removeAt() to iterator.remove()
  private static final class MoveDesc<E> {
    final E toTrickle;
    final E replaced;

    MoveDesc(E toTrickle, E replaced) {
      this.toTrickle = toTrickle;
      this.replaced = replaced;
    }
  }

  /** Removes and returns the value at {@code index}. */
  private E removeAndGet(int index) {

     */
    public boolean contains(final E element) {
        return indexOf(element) != -1;
    }

    /**
     * Removes an element from the list.
     *
     * @param element the element
     * @return true if the element was removed, false otherwise
     */
    public boolean remove(final E element) {
        if (element == null) {
            for (Entry e = header.next; e != header; e = e.next) {

   *     operation
   */
  void removeAll(RangeSet<C> other);

  /**
   * Removes all of the specified ranges from this range set (optional operation).
   *
   * <p>This is equivalent to calling {@link #remove} on each of the ranges in {@code other} in
   * turn.
   *
   * @throws UnsupportedOperationException if this range set does not support the {@code removeAll}
   *     operation

 *       the values corresponding to {@code key}
 * </ul>
 *
 * <p>The collections returned by the {@link #replaceValues replaceValues} and {@link #removeAll
 * removeAll} methods, which contain values that have just been removed from the multimap, are
 * naturally <i>not</i> views.
 *
 * <h3>Subinterfaces</h3>
 *
 * <p>Instead of using the {@code Multimap} interface directly, prefer the subinterfaces {@link

                    return e;
                }
            }
        }
        return null;
    }

    /**
     * Removes the entry at the specified index from the list entries.
     *
     * @param index
     *            the index of the entry to remove
     * @return the removed entry
     */
    protected Entry<K, V> removeList(final int index) {
        final Entry<K, V> e = listTable[index];

# Release 2.12.0

### Breaking Changes

*   Build, Compilation and Packaging

      // values of these removes, but the cache should be empty after the removes, regardless.
      keys.remove(1);
      keys.remove(2);
      assertThat(keys.remove(null)).isFalse();
      assertThat(keys.remove(6)).isFalse();
      assertThat(keys.remove(-6)).isFalse();
      assertThat(keys.removeAll(asList(null, 0, 15, 1500))).isFalse();

    }

    /**
     * Removes the specified element from this set if it is present.
     *
     * @param o
     *            object to be removed from this set, if present.
     * @return true if the set contained the specified element.
     */
    @Override
    public boolean remove(final Object o) {
        return map.remove(o) == PRESENT;
    }

    /**

		return jentry{}, false
	}

	// 1. If bucket versioning is disabled, remove the remote object.
	// 2. If bucket versioning is suspended and
	//    a. version id is specified, remove its remote object.
	//    b. version id is not specified, remove null version's remote object if it exists.
	// 3. If bucket versioning is enabled and
	//    a. version id is specified, remove its remote object.

   * removeAll}{@code (occurrencesToRemove)}, which removes all occurrences of elements that appear
   * in {@code occurrencesToRemove}. However, this operation <i>is</i> equivalent to, albeit
   * sometimes more efficient than, the following:
   *
   * {@snippet :
   * for (E e : occurrencesToRemove) {
   *   multisetToModify.remove(e);
   * }
   * }
   *