labels.url=URL
labels.userFavorite=Journal des favoris
labels.userInfo=Informations utilisateur
labels.webApiJson=Réponse JSON
labels.webConfigName=Nom de la configuration d'exploration Web
labels.allLanguages=Toutes les langues
labels.dictId=ID du dictionnaire
labels.docId=ID du document
labels.endTime=Heure de fin
labels.hq=hq
labels.inputs=Entrées
labels.jobLogging=Journalisation
labels.jobName=Nom
labels.jobStatus=Statut

      - [Docker runtime Known Issues](#docker-runtime-known-issues)
      - [Rkt runtime Known Issues](#rkt-runtime-known-issues)
  - [Provider-specific Notes](#provider-specific-notes)
  - [Previous Releases Included in v1.3.0](#previous-releases-included-in-v130)
- [v1.3.0-beta.3](#v130-beta3)
  - [Downloads](#downloads-10)
  - [Changelog since v1.3.0-beta.2](#changelog-since-v130-beta2)

   * all are provided (an empty list), the resulting Cartesian product has one element, an empty
   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of sets of size {@code m, n, p} is a
   * set of size {@code m x n x p}, its actual memory consumption is much smaller. When the

   * all are provided (an empty list), the resulting Cartesian product has one element, an empty
   * list (counter-intuitive, but mathematically consistent).
   *
   * <p><i>Performance notes:</i> while the cartesian product of sets of size {@code m, n, p} is a
   * set of size {@code m x n x p}, its actual memory consumption is much smaller. When the

				"application/vnd.3gpp.pic-bw-var",
				"application/vnd.3gpp.sms",
				"application/vnd.3gpp2.bcmcsinfo+xml",
				"application/vnd.3gpp2.sms",
				"application/vnd.3gpp2.tcap",
				"application/vnd.3m.post-it-notes",
				"application/vnd.accpac.simply.aso",
				"application/vnd.accpac.simply.imp",
				"application/vnd.acucobol",
				"application/vnd.acucorp",
				"application/vnd.adobe.air-application-installer-package+zip",

work-wired:before{content:"\f6ff"}.fa-neuter:before{content:"\f22c"}.fa-newspaper:before{content:"\f1ea"}.fa-nimblr:before{content:"\f5a8"}.fa-node:before{content:"\f419"}.fa-node-js:before{content:"\f3d3"}.fa-not-equal:before{content:"\f53e"}.fa-notes-medical:before{content:"\f481"}.fa-npm:before{content:"\f3d4"}.fa-ns8:before{content:"\f3d5"}.fa-nutritionix:before{content:"\f3d6"}.fa-object-group:before{content:"\f247"}.fa-object-ungroup:before{content:"\f248"}.fa-odnoklassniki:before{content:...

labels.facet_filetype_png=Imagen PNG
labels.facet_filetype_svg=Imagen SVG
labels.facet_filetype_tiff=Imagen TIFF
labels.facet_filetype_jpg=Imagen JPEG
labels.facet_filetype_archive=Archivo
labels.facet_filetype_bat=Archivo por lotes
labels.facet_filetype_c=C
labels.facet_filetype_cpp=C++
labels.facet_filetype_csharp=C#
labels.facet_filetype_css=CSS
labels.facet_filetype_go=Go
labels.facet_filetype_groovy=Groovy

    Preconditions.checkNotNull(callback);
    future.addListener(new CallbackListener<V>(future, callback), executor);
  }

  /** See {@link #addCallback(ListenableFuture, FutureCallback, Executor)} for behavioral notes. */
  private static final class CallbackListener<V extends @Nullable Object> implements Runnable {
    final Future<V> future;
    final FutureCallback<? super V> callback;

work-wired:before{content:"\f6ff"}.fa-neuter:before{content:"\f22c"}.fa-newspaper:before{content:"\f1ea"}.fa-nimblr:before{content:"\f5a8"}.fa-node:before{content:"\f419"}.fa-node-js:before{content:"\f3d3"}.fa-not-equal:before{content:"\f53e"}.fa-notes-medical:before{content:"\f481"}.fa-npm:before{content:"\f3d4"}.fa-ns8:before{content:"\f3d5"}.fa-nutritionix:before{content:"\f3d6"}.fa-object-group:before{content:"\f247"}.fa-object-ungroup:before{content:"\f248"}.fa-odnoklassniki:before{content:...

 * Iterator}. Except as noted, each method has a corresponding {@link Iterable}-based method in the
 * {@link Iterables} class.
 *
 * <p><i>Performance notes:</i> Unless otherwise noted, all of the iterators produced in this class
 * are <i>lazy</i>, which means that they only advance the backing iteration when absolutely
 * necessary.
 *