class by appending the class name to guava.dev. For example,
[guava.dev/ImmutableList](https://guava.dev/ImmutableList)!

## Learn about Guava

-   Our users' guide, [Guava Explained]
-   [A nice collection](https://www.tfnico.com/presentations/google-guava) of
    other helpful links

## Links

-   [GitHub project](https://github.com/google/guava)

success.failure_url_delete_all = URL de fallo eliminada.
success.delete_file = Archivo {0} eliminado.
success.job_started = Trabajo {0} iniciado.
success.job_stopped = Trabajo {0} detenido.
success.upload_synonym_file = Archivo de sinónimos cargado.
success.upload_protwords_file = Archivo Protwords cargado.
success.upload_stopwords_file = Archivo de palabras vacías cargado.

   * equivalently, if this inverse view contains a key that is equal to {@code value}).
   *
   * <p>Due to the property that values in a BiMap are unique, this will tend to execute in
   * faster-than-linear time.
   *
   * @param value the object to search for in the values of this BiMap
   * @return true if a mapping exists from a key to the specified value
   */
  @Override

    if (!iterator.hasNext()) {
      return Optional.absent();
    }

    /*
     * TODO(kevinb): consider whether this "optimization" is worthwhile. Users with SortedSets tend
     * to know they are SortedSets and probably would not call this method.
     */
    if (iterable instanceof SortedSet) {
      SortedSet<E> sortedSet = (SortedSet<E>) iterable;

				"application/vnd.bmi",
				"application/vnd.businessobjects",
				"application/vnd.cab-jscript",
				"application/vnd.canon-cpdl",
				"application/vnd.canon-lips",
				"application/vnd.cendio.thinlinc.clientconf",
				"application/vnd.chemdraw+xml",
				"application/vnd.chipnuts.karaoke-mmd",
				"application/vnd.cinderella",
				"application/vnd.cirpack.isdn-ext",
				"application/vnd.claymore",

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to

     * traverse. When nodes would otherwise be changed, new nodes are created to replace them. This
     * works well for hash tables since the bin lists tend to be short. (The average length is less
     * than two.)
     *
     * Read operations can thus proceed without locking, but rely on selected uses of volatiles to

  </mime-type>
  <mime-type type="application/vnd.cab-jscript"/>
  <mime-type type="application/vnd.canon-cpdl"/>
  <mime-type type="application/vnd.canon-lips"/>
  <mime-type type="application/vnd.cendio.thinlinc.clientconf"/>
  <mime-type type="application/vnd.chemdraw+xml">
    <glob pattern="*.cdxml"/>
  </mime-type>
  <mime-type type="application/vnd.chipnuts.karaoke-mmd">
    <glob pattern="*.mmd"/>